/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe002_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:20:43,389 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:20:43,454 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 18:20:43,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:20:43,459 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:20:43,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:20:43,481 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:20:43,482 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:20:43,482 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:20:43,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:20:43,485 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:20:43,485 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:20:43,485 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:20:43,486 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:20:43,486 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:20:43,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:20:43,487 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:20:43,487 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:20:43,487 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:20:43,487 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:20:43,487 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:20:43,487 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:20:43,487 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:20:43,488 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:20:43,488 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:20:43,488 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:20:43,488 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:20:43,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:20:43,489 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:20:43,489 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:20:43,489 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:20:43,489 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:20:43,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:20:43,490 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:20:43,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:20:43,490 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 18:20:43,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:20:43,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:20:43,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:20:43,722 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:20:43,722 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:20:43,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_rmo.oepc.i [2023-08-26 18:20:44,695 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:20:44,895 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:20:44,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_rmo.oepc.i [2023-08-26 18:20:44,908 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a799e7b86/e18138be845245b690070c382ceb1627/FLAG044833a25 [2023-08-26 18:20:44,920 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a799e7b86/e18138be845245b690070c382ceb1627 [2023-08-26 18:20:44,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:20:44,922 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:20:44,923 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:20:44,923 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:20:44,924 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:20:44,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:20:44" (1/1) ... [2023-08-26 18:20:44,925 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d2bbe8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:20:44, skipping insertion in model container [2023-08-26 18:20:44,925 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:20:44" (1/1) ... [2023-08-26 18:20:44,959 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:20:45,228 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:20:45,247 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:20:45,271 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 18:20:45,273 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 18:20:45,305 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:20:45,331 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:20:45,332 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:20:45,336 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:20:45,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:20:45 WrapperNode [2023-08-26 18:20:45,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:20:45,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:20:45,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:20:45,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:20:45,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:20:45" (1/1) ... [2023-08-26 18:20:45,370 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:20:45" (1/1) ... [2023-08-26 18:20:45,396 INFO L138 Inliner]: procedures = 176, calls = 83, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 173 [2023-08-26 18:20:45,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:20:45,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:20:45,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:20:45,398 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:20:45,403 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:20:45" (1/1) ... [2023-08-26 18:20:45,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:20:45" (1/1) ... [2023-08-26 18:20:45,415 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:20:45" (1/1) ... [2023-08-26 18:20:45,416 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:20:45" (1/1) ... [2023-08-26 18:20:45,425 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:20:45" (1/1) ... [2023-08-26 18:20:45,426 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:20:45" (1/1) ... [2023-08-26 18:20:45,428 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:20:45" (1/1) ... [2023-08-26 18:20:45,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:20:45" (1/1) ... [2023-08-26 18:20:45,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:20:45,433 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:20:45,433 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:20:45,433 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:20:45,434 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:20:45" (1/1) ... [2023-08-26 18:20:45,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:20:45,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:20:45,469 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-26 18:20:45,470 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-26 18:20:45,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 18:20:45,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:20:45,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:20:45,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:20:45,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:20:45,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:20:45,496 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:20:45,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:20:45,496 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:20:45,497 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:20:45,497 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 18:20:45,497 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 18:20:45,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:20:45,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:20:45,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:20:45,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:20:45,499 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 18:20:45,612 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:20:45,614 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:20:46,023 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:20:46,449 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:20:46,450 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:20:46,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:20:46 BoogieIcfgContainer [2023-08-26 18:20:46,452 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:20:46,458 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:20:46,458 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:20:46,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:20:46,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:20:44" (1/3) ... [2023-08-26 18:20:46,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7201e3bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:20:46, skipping insertion in model container [2023-08-26 18:20:46,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:20:45" (2/3) ... [2023-08-26 18:20:46,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7201e3bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:20:46, skipping insertion in model container [2023-08-26 18:20:46,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:20:46" (3/3) ... [2023-08-26 18:20:46,463 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_rmo.oepc.i [2023-08-26 18:20:46,514 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:20:46,514 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2023-08-26 18:20:46,514 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:20:46,601 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:20:46,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 196 places, 189 transitions, 393 flow [2023-08-26 18:20:46,702 INFO L124 PetriNetUnfolderBase]: 3/186 cut-off events. [2023-08-26 18:20:46,702 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:20:46,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 186 events. 3/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 129. Up to 2 conditions per place. [2023-08-26 18:20:46,707 INFO L82 GeneralOperation]: Start removeDead. Operand has 196 places, 189 transitions, 393 flow [2023-08-26 18:20:46,713 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 193 places, 186 transitions, 381 flow [2023-08-26 18:20:46,715 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:20:46,725 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 186 transitions, 381 flow [2023-08-26 18:20:46,728 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 186 transitions, 381 flow [2023-08-26 18:20:46,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 186 transitions, 381 flow [2023-08-26 18:20:46,773 INFO L124 PetriNetUnfolderBase]: 3/186 cut-off events. [2023-08-26 18:20:46,773 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:20:46,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 186 events. 3/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 129. Up to 2 conditions per place. [2023-08-26 18:20:46,778 INFO L119 LiptonReduction]: Number of co-enabled transitions 8612 [2023-08-26 18:21:03,083 INFO L134 LiptonReduction]: Checked pairs total: 49859 [2023-08-26 18:21:03,083 INFO L136 LiptonReduction]: Total number of compositions: 157 [2023-08-26 18:21:03,092 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:21:03,095 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=false, 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;@156375d8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:21:03,096 INFO L358 AbstractCegarLoop]: Starting to check reachability of 100 error locations. [2023-08-26 18:21:03,097 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:21:03,097 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 18:21:03,097 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:21:03,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:03,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:21:03,098 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:03,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:03,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1201, now seen corresponding path program 1 times [2023-08-26 18:21:03,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:03,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658912531] [2023-08-26 18:21:03,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:03,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:03,195 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-26 18:21:03,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:03,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658912531] [2023-08-26 18:21:03,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658912531] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:03,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:03,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:21:03,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59419570] [2023-08-26 18:21:03,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:03,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:21:03,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:03,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:21:03,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:21:03,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 346 [2023-08-26 18:21:03,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 88 transitions, 185 flow. Second operand has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:03,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:03,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 346 [2023-08-26 18:21:03,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:05,954 INFO L124 PetriNetUnfolderBase]: 16294/23361 cut-off events. [2023-08-26 18:21:05,954 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-26 18:21:05,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46288 conditions, 23361 events. 16294/23361 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2273. Compared 167492 event pairs, 16294 based on Foata normal form. 400/9766 useless extension candidates. Maximal degree in co-relation 46277. Up to 22831 conditions per place. [2023-08-26 18:21:06,064 INFO L140 encePairwiseOnDemand]: 308/346 looper letters, 43 selfloop transitions, 0 changer transitions 0/50 dead transitions. [2023-08-26 18:21:06,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 50 transitions, 195 flow [2023-08-26 18:21:06,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:21:06,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:21:06,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 333 transitions. [2023-08-26 18:21:06,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48121387283236994 [2023-08-26 18:21:06,078 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 333 transitions. [2023-08-26 18:21:06,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 333 transitions. [2023-08-26 18:21:06,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:06,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 333 transitions. [2023-08-26 18:21:06,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 166.5) internal successors, (333), 2 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:06,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 346.0) internal successors, (1038), 3 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:06,089 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 346.0) internal successors, (1038), 3 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:06,090 INFO L175 Difference]: Start difference. First operand has 97 places, 88 transitions, 185 flow. Second operand 2 states and 333 transitions. [2023-08-26 18:21:06,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 50 transitions, 195 flow [2023-08-26 18:21:06,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 192 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:21:06,095 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 106 flow [2023-08-26 18:21:06,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-08-26 18:21:06,099 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -39 predicate places. [2023-08-26 18:21:06,099 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 106 flow [2023-08-26 18:21:06,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:06,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:06,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:21:06,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:21:06,100 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:06,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:06,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1188544, now seen corresponding path program 1 times [2023-08-26 18:21:06,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:06,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45664654] [2023-08-26 18:21:06,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:06,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:06,266 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-26 18:21:06,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:06,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45664654] [2023-08-26 18:21:06,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45664654] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:06,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:06,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:21:06,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955540840] [2023-08-26 18:21:06,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:06,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:21:06,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:06,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:21:06,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:21:06,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 346 [2023-08-26 18:21:06,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:06,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:06,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 346 [2023-08-26 18:21:06,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:08,364 INFO L124 PetriNetUnfolderBase]: 14310/20980 cut-off events. [2023-08-26 18:21:08,364 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:21:08,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41928 conditions, 20980 events. 14310/20980 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1240. Compared 137408 event pairs, 9819 based on Foata normal form. 0/12066 useless extension candidates. Maximal degree in co-relation 41925. Up to 14243 conditions per place. [2023-08-26 18:21:08,440 INFO L140 encePairwiseOnDemand]: 325/346 looper letters, 55 selfloop transitions, 10 changer transitions 0/66 dead transitions. [2023-08-26 18:21:08,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 66 transitions, 268 flow [2023-08-26 18:21:08,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:21:08,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:21:08,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-08-26 18:21:08,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36801541425818884 [2023-08-26 18:21:08,442 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-08-26 18:21:08,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-08-26 18:21:08,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:08,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-08-26 18:21:08,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:08,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:08,445 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:08,445 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 106 flow. Second operand 3 states and 382 transitions. [2023-08-26 18:21:08,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 66 transitions, 268 flow [2023-08-26 18:21:08,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 66 transitions, 268 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:21:08,447 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 188 flow [2023-08-26 18:21:08,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2023-08-26 18:21:08,447 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -38 predicate places. [2023-08-26 18:21:08,447 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 188 flow [2023-08-26 18:21:08,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:08,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:08,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:21:08,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:21:08,448 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:08,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:08,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1188545, now seen corresponding path program 1 times [2023-08-26 18:21:08,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:08,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336581686] [2023-08-26 18:21:08,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:08,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:08,566 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-26 18:21:08,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:08,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336581686] [2023-08-26 18:21:08,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336581686] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:08,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:08,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:21:08,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676013362] [2023-08-26 18:21:08,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:08,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:21:08,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:08,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:21:08,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:21:08,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 346 [2023-08-26 18:21:08,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:08,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:08,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 346 [2023-08-26 18:21:08,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:09,294 INFO L124 PetriNetUnfolderBase]: 4092/6386 cut-off events. [2023-08-26 18:21:09,295 INFO L125 PetriNetUnfolderBase]: For 2167/2182 co-relation queries the response was YES. [2023-08-26 18:21:09,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18114 conditions, 6386 events. 4092/6386 cut-off events. For 2167/2182 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 39473 event pairs, 3031 based on Foata normal form. 1759/7640 useless extension candidates. Maximal degree in co-relation 18109. Up to 6250 conditions per place. [2023-08-26 18:21:09,317 INFO L140 encePairwiseOnDemand]: 335/346 looper letters, 41 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2023-08-26 18:21:09,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 45 transitions, 254 flow [2023-08-26 18:21:09,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:21:09,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:21:09,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-08-26 18:21:09,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34971098265895956 [2023-08-26 18:21:09,319 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-08-26 18:21:09,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-08-26 18:21:09,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:09,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-08-26 18:21:09,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:09,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:09,322 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:09,322 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 188 flow. Second operand 3 states and 363 transitions. [2023-08-26 18:21:09,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 45 transitions, 254 flow [2023-08-26 18:21:09,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 45 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:21:09,336 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 148 flow [2023-08-26 18:21:09,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2023-08-26 18:21:09,337 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -48 predicate places. [2023-08-26 18:21:09,337 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 148 flow [2023-08-26 18:21:09,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:09,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:09,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:09,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:21:09,338 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:09,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:09,338 INFO L85 PathProgramCache]: Analyzing trace with hash -471237991, now seen corresponding path program 1 times [2023-08-26 18:21:09,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:09,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744575772] [2023-08-26 18:21:09,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:09,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:09,522 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-26 18:21:09,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:09,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744575772] [2023-08-26 18:21:09,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744575772] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:09,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:09,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:21:09,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479126655] [2023-08-26 18:21:09,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:09,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:21:09,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:09,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:21:09,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:21:09,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 346 [2023-08-26 18:21:09,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:09,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:09,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 346 [2023-08-26 18:21:09,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:10,127 INFO L124 PetriNetUnfolderBase]: 3517/5842 cut-off events. [2023-08-26 18:21:10,127 INFO L125 PetriNetUnfolderBase]: For 1135/1291 co-relation queries the response was YES. [2023-08-26 18:21:10,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14675 conditions, 5842 events. 3517/5842 cut-off events. For 1135/1291 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 40002 event pairs, 1375 based on Foata normal form. 29/4664 useless extension candidates. Maximal degree in co-relation 14670. Up to 3202 conditions per place. [2023-08-26 18:21:10,145 INFO L140 encePairwiseOnDemand]: 342/346 looper letters, 61 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2023-08-26 18:21:10,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 72 transitions, 366 flow [2023-08-26 18:21:10,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:21:10,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:21:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2023-08-26 18:21:10,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4142581888246628 [2023-08-26 18:21:10,147 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2023-08-26 18:21:10,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2023-08-26 18:21:10,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:10,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2023-08-26 18:21:10,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:10,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:10,150 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:10,150 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 148 flow. Second operand 3 states and 430 transitions. [2023-08-26 18:21:10,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 72 transitions, 366 flow [2023-08-26 18:21:10,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 72 transitions, 365 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:21:10,152 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 160 flow [2023-08-26 18:21:10,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2023-08-26 18:21:10,152 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -47 predicate places. [2023-08-26 18:21:10,152 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 160 flow [2023-08-26 18:21:10,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:10,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:10,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:10,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:21:10,153 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:10,153 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:10,153 INFO L85 PathProgramCache]: Analyzing trace with hash -471237633, now seen corresponding path program 1 times [2023-08-26 18:21:10,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:10,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046693481] [2023-08-26 18:21:10,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:10,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:10,788 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-26 18:21:10,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:10,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046693481] [2023-08-26 18:21:10,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046693481] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:10,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:10,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:21:10,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456787708] [2023-08-26 18:21:10,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:10,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:21:10,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:10,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:21:10,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:21:10,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 346 [2023-08-26 18:21:10,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:10,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:10,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 346 [2023-08-26 18:21:10,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:11,545 INFO L124 PetriNetUnfolderBase]: 3438/5610 cut-off events. [2023-08-26 18:21:11,546 INFO L125 PetriNetUnfolderBase]: For 1775/1856 co-relation queries the response was YES. [2023-08-26 18:21:11,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15366 conditions, 5610 events. 3438/5610 cut-off events. For 1775/1856 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 36588 event pairs, 1390 based on Foata normal form. 20/4786 useless extension candidates. Maximal degree in co-relation 15360. Up to 4468 conditions per place. [2023-08-26 18:21:11,567 INFO L140 encePairwiseOnDemand]: 342/346 looper letters, 56 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2023-08-26 18:21:11,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 69 transitions, 370 flow [2023-08-26 18:21:11,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:21:11,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:21:11,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-08-26 18:21:11,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40173410404624277 [2023-08-26 18:21:11,569 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-08-26 18:21:11,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-08-26 18:21:11,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:11,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-08-26 18:21:11,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:11,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:11,572 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:11,572 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 160 flow. Second operand 3 states and 417 transitions. [2023-08-26 18:21:11,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 69 transitions, 370 flow [2023-08-26 18:21:11,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 69 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:21:11,573 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 197 flow [2023-08-26 18:21:11,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2023-08-26 18:21:11,574 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -46 predicate places. [2023-08-26 18:21:11,574 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 197 flow [2023-08-26 18:21:11,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:11,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:11,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:11,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:21:11,575 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:11,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:11,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1723466365, now seen corresponding path program 1 times [2023-08-26 18:21:11,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:11,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192480183] [2023-08-26 18:21:11,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:11,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:11,874 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-26 18:21:11,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:11,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192480183] [2023-08-26 18:21:11,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192480183] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:11,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:11,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:21:11,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036499549] [2023-08-26 18:21:11,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:11,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:21:11,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:11,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:21:11,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:21:11,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 346 [2023-08-26 18:21:11,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 197 flow. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:11,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:11,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 346 [2023-08-26 18:21:11,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:12,558 INFO L124 PetriNetUnfolderBase]: 3431/5605 cut-off events. [2023-08-26 18:21:12,558 INFO L125 PetriNetUnfolderBase]: For 1965/2008 co-relation queries the response was YES. [2023-08-26 18:21:12,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15801 conditions, 5605 events. 3431/5605 cut-off events. For 1965/2008 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 36571 event pairs, 995 based on Foata normal form. 13/4903 useless extension candidates. Maximal degree in co-relation 15794. Up to 3811 conditions per place. [2023-08-26 18:21:12,576 INFO L140 encePairwiseOnDemand]: 342/346 looper letters, 70 selfloop transitions, 7 changer transitions 0/85 dead transitions. [2023-08-26 18:21:12,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 85 transitions, 469 flow [2023-08-26 18:21:12,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:21:12,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:21:12,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 560 transitions. [2023-08-26 18:21:12,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4046242774566474 [2023-08-26 18:21:12,578 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 560 transitions. [2023-08-26 18:21:12,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 560 transitions. [2023-08-26 18:21:12,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:12,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 560 transitions. [2023-08-26 18:21:12,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:12,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:12,581 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:12,582 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 197 flow. Second operand 4 states and 560 transitions. [2023-08-26 18:21:12,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 85 transitions, 469 flow [2023-08-26 18:21:12,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 85 transitions, 464 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:21:12,584 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 212 flow [2023-08-26 18:21:12,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2023-08-26 18:21:12,584 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -43 predicate places. [2023-08-26 18:21:12,585 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 212 flow [2023-08-26 18:21:12,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:12,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:12,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:12,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:21:12,585 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:12,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:12,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1723466723, now seen corresponding path program 1 times [2023-08-26 18:21:12,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:12,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966284863] [2023-08-26 18:21:12,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:12,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:12,685 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-26 18:21:12,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:12,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966284863] [2023-08-26 18:21:12,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966284863] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:12,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:12,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:21:12,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386842865] [2023-08-26 18:21:12,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:12,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:21:12,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:12,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:21:12,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:21:12,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 346 [2023-08-26 18:21:12,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:12,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:12,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 346 [2023-08-26 18:21:12,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:13,304 INFO L124 PetriNetUnfolderBase]: 4085/6628 cut-off events. [2023-08-26 18:21:13,304 INFO L125 PetriNetUnfolderBase]: For 2844/2844 co-relation queries the response was YES. [2023-08-26 18:21:13,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19312 conditions, 6628 events. 4085/6628 cut-off events. For 2844/2844 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 44077 event pairs, 1313 based on Foata normal form. 0/6016 useless extension candidates. Maximal degree in co-relation 19304. Up to 2768 conditions per place. [2023-08-26 18:21:13,326 INFO L140 encePairwiseOnDemand]: 335/346 looper letters, 55 selfloop transitions, 17 changer transitions 0/73 dead transitions. [2023-08-26 18:21:13,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 73 transitions, 433 flow [2023-08-26 18:21:13,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:21:13,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:21:13,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 473 transitions. [2023-08-26 18:21:13,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3417630057803468 [2023-08-26 18:21:13,328 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 473 transitions. [2023-08-26 18:21:13,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 473 transitions. [2023-08-26 18:21:13,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:13,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 473 transitions. [2023-08-26 18:21:13,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:13,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:13,334 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:13,334 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 212 flow. Second operand 4 states and 473 transitions. [2023-08-26 18:21:13,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 73 transitions, 433 flow [2023-08-26 18:21:13,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 73 transitions, 416 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-26 18:21:13,340 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 240 flow [2023-08-26 18:21:13,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2023-08-26 18:21:13,341 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -43 predicate places. [2023-08-26 18:21:13,341 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 240 flow [2023-08-26 18:21:13,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:13,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:13,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:13,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:21:13,342 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:13,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:13,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1723466722, now seen corresponding path program 1 times [2023-08-26 18:21:13,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:13,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318681944] [2023-08-26 18:21:13,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:13,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:13,473 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-26 18:21:13,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:13,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318681944] [2023-08-26 18:21:13,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318681944] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:13,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:13,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:21:13,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447362762] [2023-08-26 18:21:13,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:13,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:21:13,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:13,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:21:13,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:21:13,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 346 [2023-08-26 18:21:13,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:13,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:13,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 346 [2023-08-26 18:21:13,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:14,336 INFO L124 PetriNetUnfolderBase]: 5702/9203 cut-off events. [2023-08-26 18:21:14,336 INFO L125 PetriNetUnfolderBase]: For 5430/5445 co-relation queries the response was YES. [2023-08-26 18:21:14,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27903 conditions, 9203 events. 5702/9203 cut-off events. For 5430/5445 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 64558 event pairs, 3071 based on Foata normal form. 65/8925 useless extension candidates. Maximal degree in co-relation 27895. Up to 4867 conditions per place. [2023-08-26 18:21:14,362 INFO L140 encePairwiseOnDemand]: 341/346 looper letters, 75 selfloop transitions, 7 changer transitions 0/85 dead transitions. [2023-08-26 18:21:14,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 85 transitions, 542 flow [2023-08-26 18:21:14,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:21:14,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:21:14,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2023-08-26 18:21:14,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34826589595375723 [2023-08-26 18:21:14,364 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2023-08-26 18:21:14,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2023-08-26 18:21:14,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:14,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2023-08-26 18:21:14,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:14,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:14,366 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:14,367 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 240 flow. Second operand 4 states and 482 transitions. [2023-08-26 18:21:14,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 85 transitions, 542 flow [2023-08-26 18:21:14,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 85 transitions, 520 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:21:14,375 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 255 flow [2023-08-26 18:21:14,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=255, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2023-08-26 18:21:14,375 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -40 predicate places. [2023-08-26 18:21:14,375 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 255 flow [2023-08-26 18:21:14,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:14,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:14,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:14,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:21:14,376 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:14,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:14,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1985096356, now seen corresponding path program 2 times [2023-08-26 18:21:14,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:14,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122724549] [2023-08-26 18:21:14,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:14,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:14,495 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-26 18:21:14,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:14,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122724549] [2023-08-26 18:21:14,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122724549] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:14,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:14,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:21:14,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704284988] [2023-08-26 18:21:14,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:14,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:21:14,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:14,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:21:14,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:21:14,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 346 [2023-08-26 18:21:14,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 255 flow. Second operand has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:14,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:14,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 346 [2023-08-26 18:21:14,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:15,359 INFO L124 PetriNetUnfolderBase]: 5597/9048 cut-off events. [2023-08-26 18:21:15,359 INFO L125 PetriNetUnfolderBase]: For 7398/7423 co-relation queries the response was YES. [2023-08-26 18:21:15,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27073 conditions, 9048 events. 5597/9048 cut-off events. For 7398/7423 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 63463 event pairs, 2580 based on Foata normal form. 75/8187 useless extension candidates. Maximal degree in co-relation 27064. Up to 6660 conditions per place. [2023-08-26 18:21:15,392 INFO L140 encePairwiseOnDemand]: 343/346 looper letters, 74 selfloop transitions, 5 changer transitions 0/82 dead transitions. [2023-08-26 18:21:15,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 82 transitions, 523 flow [2023-08-26 18:21:15,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:21:15,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:21:15,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 480 transitions. [2023-08-26 18:21:15,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3468208092485549 [2023-08-26 18:21:15,394 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 480 transitions. [2023-08-26 18:21:15,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 480 transitions. [2023-08-26 18:21:15,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:15,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 480 transitions. [2023-08-26 18:21:15,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:15,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:15,397 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:15,397 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 255 flow. Second operand 4 states and 480 transitions. [2023-08-26 18:21:15,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 82 transitions, 523 flow [2023-08-26 18:21:15,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 82 transitions, 510 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:21:15,400 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 246 flow [2023-08-26 18:21:15,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=246, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2023-08-26 18:21:15,401 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -41 predicate places. [2023-08-26 18:21:15,401 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 246 flow [2023-08-26 18:21:15,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:15,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:15,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:15,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:21:15,401 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:15,402 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:15,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1724618170, now seen corresponding path program 1 times [2023-08-26 18:21:15,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:15,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060014293] [2023-08-26 18:21:15,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:15,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:15,768 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-26 18:21:15,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:15,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060014293] [2023-08-26 18:21:15,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060014293] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:15,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:15,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:21:15,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741092950] [2023-08-26 18:21:15,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:15,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:21:15,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:15,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:21:15,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:21:15,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 346 [2023-08-26 18:21:15,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 246 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:15,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:15,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 346 [2023-08-26 18:21:15,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:16,622 INFO L124 PetriNetUnfolderBase]: 5671/9130 cut-off events. [2023-08-26 18:21:16,622 INFO L125 PetriNetUnfolderBase]: For 6716/6716 co-relation queries the response was YES. [2023-08-26 18:21:16,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27193 conditions, 9130 events. 5671/9130 cut-off events. For 6716/6716 co-relation queries the response was YES. Maximal size of possible extension queue 718. Compared 63827 event pairs, 2370 based on Foata normal form. 20/8231 useless extension candidates. Maximal degree in co-relation 27185. Up to 6851 conditions per place. [2023-08-26 18:21:16,655 INFO L140 encePairwiseOnDemand]: 341/346 looper letters, 93 selfloop transitions, 12 changer transitions 0/106 dead transitions. [2023-08-26 18:21:16,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 106 transitions, 703 flow [2023-08-26 18:21:16,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:21:16,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:21:16,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 478 transitions. [2023-08-26 18:21:16,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3453757225433526 [2023-08-26 18:21:16,656 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 478 transitions. [2023-08-26 18:21:16,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 478 transitions. [2023-08-26 18:21:16,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:16,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 478 transitions. [2023-08-26 18:21:16,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:16,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:16,659 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:16,659 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 246 flow. Second operand 4 states and 478 transitions. [2023-08-26 18:21:16,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 106 transitions, 703 flow [2023-08-26 18:21:16,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 106 transitions, 693 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:21:16,663 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 332 flow [2023-08-26 18:21:16,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=332, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2023-08-26 18:21:16,663 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -39 predicate places. [2023-08-26 18:21:16,663 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 332 flow [2023-08-26 18:21:16,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:16,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:16,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:16,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:21:16,664 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:16,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:16,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1887849998, now seen corresponding path program 1 times [2023-08-26 18:21:16,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:16,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566734765] [2023-08-26 18:21:16,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:16,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:17,337 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-26 18:21:17,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:17,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566734765] [2023-08-26 18:21:17,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566734765] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:17,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:17,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:21:17,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364616079] [2023-08-26 18:21:17,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:17,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:21:17,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:17,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:21:17,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:21:17,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 346 [2023-08-26 18:21:17,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 332 flow. Second operand has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:17,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:17,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 346 [2023-08-26 18:21:17,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:18,289 INFO L124 PetriNetUnfolderBase]: 6230/10016 cut-off events. [2023-08-26 18:21:18,290 INFO L125 PetriNetUnfolderBase]: For 8156/8181 co-relation queries the response was YES. [2023-08-26 18:21:18,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31619 conditions, 10016 events. 6230/10016 cut-off events. For 8156/8181 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 71330 event pairs, 2940 based on Foata normal form. 45/8957 useless extension candidates. Maximal degree in co-relation 31610. Up to 6674 conditions per place. [2023-08-26 18:21:18,327 INFO L140 encePairwiseOnDemand]: 337/346 looper letters, 85 selfloop transitions, 19 changer transitions 0/107 dead transitions. [2023-08-26 18:21:18,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 107 transitions, 728 flow [2023-08-26 18:21:18,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:21:18,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:21:18,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 619 transitions. [2023-08-26 18:21:18,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3578034682080925 [2023-08-26 18:21:18,329 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 619 transitions. [2023-08-26 18:21:18,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 619 transitions. [2023-08-26 18:21:18,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:18,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 619 transitions. [2023-08-26 18:21:18,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:18,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:18,332 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:18,332 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 332 flow. Second operand 5 states and 619 transitions. [2023-08-26 18:21:18,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 107 transitions, 728 flow [2023-08-26 18:21:18,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 107 transitions, 717 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 18:21:18,343 INFO L231 Difference]: Finished difference. Result has 62 places, 65 transitions, 418 flow [2023-08-26 18:21:18,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=418, PETRI_PLACES=62, PETRI_TRANSITIONS=65} [2023-08-26 18:21:18,344 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -35 predicate places. [2023-08-26 18:21:18,344 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 65 transitions, 418 flow [2023-08-26 18:21:18,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:18,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:18,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:18,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:21:18,344 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:18,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:18,345 INFO L85 PathProgramCache]: Analyzing trace with hash -602687502, now seen corresponding path program 2 times [2023-08-26 18:21:18,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:18,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12872910] [2023-08-26 18:21:18,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:18,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:19,293 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-26 18:21:19,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:19,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12872910] [2023-08-26 18:21:19,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12872910] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:19,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:19,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:21:19,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112341981] [2023-08-26 18:21:19,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:19,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:21:19,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:19,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:21:19,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:21:19,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 346 [2023-08-26 18:21:19,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 65 transitions, 418 flow. Second operand has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:19,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:19,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 346 [2023-08-26 18:21:19,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:20,430 INFO L124 PetriNetUnfolderBase]: 7120/11384 cut-off events. [2023-08-26 18:21:20,430 INFO L125 PetriNetUnfolderBase]: For 14178/14205 co-relation queries the response was YES. [2023-08-26 18:21:20,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38912 conditions, 11384 events. 7120/11384 cut-off events. For 14178/14205 co-relation queries the response was YES. Maximal size of possible extension queue 946. Compared 82332 event pairs, 2822 based on Foata normal form. 47/10883 useless extension candidates. Maximal degree in co-relation 38902. Up to 6792 conditions per place. [2023-08-26 18:21:20,477 INFO L140 encePairwiseOnDemand]: 338/346 looper letters, 104 selfloop transitions, 28 changer transitions 0/135 dead transitions. [2023-08-26 18:21:20,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 135 transitions, 997 flow [2023-08-26 18:21:20,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:21:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:21:20,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 737 transitions. [2023-08-26 18:21:20,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.355009633911368 [2023-08-26 18:21:20,480 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 737 transitions. [2023-08-26 18:21:20,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 737 transitions. [2023-08-26 18:21:20,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:20,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 737 transitions. [2023-08-26 18:21:20,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:20,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 346.0) internal successors, (2422), 7 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:20,483 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 346.0) internal successors, (2422), 7 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:20,483 INFO L175 Difference]: Start difference. First operand has 62 places, 65 transitions, 418 flow. Second operand 6 states and 737 transitions. [2023-08-26 18:21:20,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 135 transitions, 997 flow [2023-08-26 18:21:20,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 135 transitions, 969 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:21:20,500 INFO L231 Difference]: Finished difference. Result has 66 places, 75 transitions, 557 flow [2023-08-26 18:21:20,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=557, PETRI_PLACES=66, PETRI_TRANSITIONS=75} [2023-08-26 18:21:20,500 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -31 predicate places. [2023-08-26 18:21:20,501 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 75 transitions, 557 flow [2023-08-26 18:21:20,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:20,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:20,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:20,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 18:21:20,501 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:20,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:20,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1923557348, now seen corresponding path program 3 times [2023-08-26 18:21:20,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:20,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977093924] [2023-08-26 18:21:20,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:20,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:21,510 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-26 18:21:21,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:21,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977093924] [2023-08-26 18:21:21,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977093924] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:21,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:21,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:21:21,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064183753] [2023-08-26 18:21:21,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:21,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:21:21,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:21,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:21:21,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:21:21,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 346 [2023-08-26 18:21:21,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 75 transitions, 557 flow. Second operand has 6 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:21,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:21,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 346 [2023-08-26 18:21:21,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:22,879 INFO L124 PetriNetUnfolderBase]: 7792/12424 cut-off events. [2023-08-26 18:21:22,879 INFO L125 PetriNetUnfolderBase]: For 23207/23212 co-relation queries the response was YES. [2023-08-26 18:21:22,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46737 conditions, 12424 events. 7792/12424 cut-off events. For 23207/23212 co-relation queries the response was YES. Maximal size of possible extension queue 1047. Compared 90939 event pairs, 3527 based on Foata normal form. 17/11827 useless extension candidates. Maximal degree in co-relation 46725. Up to 9042 conditions per place. [2023-08-26 18:21:22,936 INFO L140 encePairwiseOnDemand]: 338/346 looper letters, 98 selfloop transitions, 45 changer transitions 0/146 dead transitions. [2023-08-26 18:21:22,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 146 transitions, 1300 flow [2023-08-26 18:21:22,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:21:22,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:21:22,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 715 transitions. [2023-08-26 18:21:22,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3444123314065511 [2023-08-26 18:21:22,938 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 715 transitions. [2023-08-26 18:21:22,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 715 transitions. [2023-08-26 18:21:22,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:22,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 715 transitions. [2023-08-26 18:21:22,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:22,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 346.0) internal successors, (2422), 7 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:22,942 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 346.0) internal successors, (2422), 7 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:22,942 INFO L175 Difference]: Start difference. First operand has 66 places, 75 transitions, 557 flow. Second operand 6 states and 715 transitions. [2023-08-26 18:21:22,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 146 transitions, 1300 flow [2023-08-26 18:21:22,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 146 transitions, 1254 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:21:22,989 INFO L231 Difference]: Finished difference. Result has 71 places, 100 transitions, 952 flow [2023-08-26 18:21:22,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=952, PETRI_PLACES=71, PETRI_TRANSITIONS=100} [2023-08-26 18:21:22,990 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -26 predicate places. [2023-08-26 18:21:22,990 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 100 transitions, 952 flow [2023-08-26 18:21:22,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:22,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:22,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:22,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 18:21:22,990 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:22,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:22,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1887781290, now seen corresponding path program 1 times [2023-08-26 18:21:22,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:22,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660032468] [2023-08-26 18:21:22,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:22,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:23,066 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-26 18:21:23,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:23,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660032468] [2023-08-26 18:21:23,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660032468] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:23,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:23,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:21:23,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463971749] [2023-08-26 18:21:23,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:23,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:21:23,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:23,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:21:23,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:21:23,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 346 [2023-08-26 18:21:23,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 100 transitions, 952 flow. Second operand has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:23,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:23,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 346 [2023-08-26 18:21:23,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:24,087 INFO L124 PetriNetUnfolderBase]: 6431/10277 cut-off events. [2023-08-26 18:21:24,087 INFO L125 PetriNetUnfolderBase]: For 27534/27534 co-relation queries the response was YES. [2023-08-26 18:21:24,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42473 conditions, 10277 events. 6431/10277 cut-off events. For 27534/27534 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 72169 event pairs, 2485 based on Foata normal form. 230/10134 useless extension candidates. Maximal degree in co-relation 42458. Up to 3853 conditions per place. [2023-08-26 18:21:24,132 INFO L140 encePairwiseOnDemand]: 329/346 looper letters, 118 selfloop transitions, 36 changer transitions 0/155 dead transitions. [2023-08-26 18:21:24,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 155 transitions, 1857 flow [2023-08-26 18:21:24,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:21:24,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:21:24,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 458 transitions. [2023-08-26 18:21:24,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3309248554913295 [2023-08-26 18:21:24,134 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 458 transitions. [2023-08-26 18:21:24,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 458 transitions. [2023-08-26 18:21:24,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:24,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 458 transitions. [2023-08-26 18:21:24,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:24,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:24,137 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:24,137 INFO L175 Difference]: Start difference. First operand has 71 places, 100 transitions, 952 flow. Second operand 4 states and 458 transitions. [2023-08-26 18:21:24,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 155 transitions, 1857 flow [2023-08-26 18:21:24,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 155 transitions, 1768 flow, removed 44 selfloop flow, removed 1 redundant places. [2023-08-26 18:21:24,176 INFO L231 Difference]: Finished difference. Result has 75 places, 126 transitions, 1393 flow [2023-08-26 18:21:24,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1393, PETRI_PLACES=75, PETRI_TRANSITIONS=126} [2023-08-26 18:21:24,176 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -22 predicate places. [2023-08-26 18:21:24,177 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 126 transitions, 1393 flow [2023-08-26 18:21:24,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:24,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:24,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:24,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 18:21:24,177 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:24,177 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:24,177 INFO L85 PathProgramCache]: Analyzing trace with hash 268881849, now seen corresponding path program 1 times [2023-08-26 18:21:24,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:24,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699697598] [2023-08-26 18:21:24,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:24,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:24,847 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-26 18:21:24,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:24,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699697598] [2023-08-26 18:21:24,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699697598] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:24,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:24,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:21:24,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119414604] [2023-08-26 18:21:24,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:24,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:21:24,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:24,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:21:24,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:21:24,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 346 [2023-08-26 18:21:24,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 126 transitions, 1393 flow. Second operand has 8 states, 8 states have (on average 91.75) internal successors, (734), 8 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:24,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:24,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 346 [2023-08-26 18:21:24,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:26,543 INFO L124 PetriNetUnfolderBase]: 7884/12676 cut-off events. [2023-08-26 18:21:26,543 INFO L125 PetriNetUnfolderBase]: For 34877/34877 co-relation queries the response was YES. [2023-08-26 18:21:26,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54228 conditions, 12676 events. 7884/12676 cut-off events. For 34877/34877 co-relation queries the response was YES. Maximal size of possible extension queue 1015. Compared 93597 event pairs, 2162 based on Foata normal form. 72/12372 useless extension candidates. Maximal degree in co-relation 54212. Up to 7762 conditions per place. [2023-08-26 18:21:26,602 INFO L140 encePairwiseOnDemand]: 336/346 looper letters, 197 selfloop transitions, 86 changer transitions 2/286 dead transitions. [2023-08-26 18:21:26,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 286 transitions, 3336 flow [2023-08-26 18:21:26,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-26 18:21:26,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-26 18:21:26,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1490 transitions. [2023-08-26 18:21:26,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28709055876685935 [2023-08-26 18:21:26,605 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1490 transitions. [2023-08-26 18:21:26,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1490 transitions. [2023-08-26 18:21:26,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:26,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1490 transitions. [2023-08-26 18:21:26,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 99.33333333333333) internal successors, (1490), 15 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:26,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 346.0) internal successors, (5536), 16 states have internal predecessors, (5536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:26,612 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 346.0) internal successors, (5536), 16 states have internal predecessors, (5536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:26,612 INFO L175 Difference]: Start difference. First operand has 75 places, 126 transitions, 1393 flow. Second operand 15 states and 1490 transitions. [2023-08-26 18:21:26,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 286 transitions, 3336 flow [2023-08-26 18:21:26,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 286 transitions, 3322 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:21:26,731 INFO L231 Difference]: Finished difference. Result has 96 places, 197 transitions, 2641 flow [2023-08-26 18:21:26,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=1389, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2641, PETRI_PLACES=96, PETRI_TRANSITIONS=197} [2023-08-26 18:21:26,732 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -1 predicate places. [2023-08-26 18:21:26,732 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 197 transitions, 2641 flow [2023-08-26 18:21:26,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.75) internal successors, (734), 8 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:26,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:26,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:26,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 18:21:26,732 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:26,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:26,733 INFO L85 PathProgramCache]: Analyzing trace with hash 499194495, now seen corresponding path program 2 times [2023-08-26 18:21:26,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:26,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251122774] [2023-08-26 18:21:26,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:26,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:27,383 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-26 18:21:27,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:27,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251122774] [2023-08-26 18:21:27,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251122774] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:27,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:27,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 18:21:27,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880081021] [2023-08-26 18:21:27,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:27,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 18:21:27,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:27,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 18:21:27,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-08-26 18:21:27,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 346 [2023-08-26 18:21:27,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 197 transitions, 2641 flow. Second operand has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:27,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:27,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 346 [2023-08-26 18:21:27,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:29,618 INFO L124 PetriNetUnfolderBase]: 8988/14619 cut-off events. [2023-08-26 18:21:29,618 INFO L125 PetriNetUnfolderBase]: For 53014/53014 co-relation queries the response was YES. [2023-08-26 18:21:29,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67452 conditions, 14619 events. 8988/14619 cut-off events. For 53014/53014 co-relation queries the response was YES. Maximal size of possible extension queue 1208. Compared 112284 event pairs, 1663 based on Foata normal form. 36/14199 useless extension candidates. Maximal degree in co-relation 67427. Up to 5852 conditions per place. [2023-08-26 18:21:29,701 INFO L140 encePairwiseOnDemand]: 335/346 looper letters, 251 selfloop transitions, 126 changer transitions 1/379 dead transitions. [2023-08-26 18:21:29,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 379 transitions, 4839 flow [2023-08-26 18:21:29,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-26 18:21:29,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-26 18:21:29,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1619 transitions. [2023-08-26 18:21:29,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2924494219653179 [2023-08-26 18:21:29,705 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1619 transitions. [2023-08-26 18:21:29,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1619 transitions. [2023-08-26 18:21:29,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:29,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1619 transitions. [2023-08-26 18:21:29,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 101.1875) internal successors, (1619), 16 states have internal predecessors, (1619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:29,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 346.0) internal successors, (5882), 17 states have internal predecessors, (5882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:29,712 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 346.0) internal successors, (5882), 17 states have internal predecessors, (5882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:29,712 INFO L175 Difference]: Start difference. First operand has 96 places, 197 transitions, 2641 flow. Second operand 16 states and 1619 transitions. [2023-08-26 18:21:29,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 379 transitions, 4839 flow [2023-08-26 18:21:30,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 379 transitions, 4705 flow, removed 67 selfloop flow, removed 0 redundant places. [2023-08-26 18:21:30,018 INFO L231 Difference]: Finished difference. Result has 118 places, 256 transitions, 3704 flow [2023-08-26 18:21:30,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=2507, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3704, PETRI_PLACES=118, PETRI_TRANSITIONS=256} [2023-08-26 18:21:30,019 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, 21 predicate places. [2023-08-26 18:21:30,019 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 256 transitions, 3704 flow [2023-08-26 18:21:30,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:30,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:30,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:30,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 18:21:30,019 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:30,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:30,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1608321714, now seen corresponding path program 1 times [2023-08-26 18:21:30,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:30,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698023636] [2023-08-26 18:21:30,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:30,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:30,145 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-26 18:21:30,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:30,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698023636] [2023-08-26 18:21:30,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698023636] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:30,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:30,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:21:30,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361015801] [2023-08-26 18:21:30,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:30,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:21:30,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:30,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:21:30,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:21:30,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 346 [2023-08-26 18:21:30,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 256 transitions, 3704 flow. Second operand has 7 states, 7 states have (on average 99.0) internal successors, (693), 7 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:30,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:30,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 346 [2023-08-26 18:21:30,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:31,658 INFO L124 PetriNetUnfolderBase]: 6838/11265 cut-off events. [2023-08-26 18:21:31,658 INFO L125 PetriNetUnfolderBase]: For 52789/52789 co-relation queries the response was YES. [2023-08-26 18:21:31,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54518 conditions, 11265 events. 6838/11265 cut-off events. For 52789/52789 co-relation queries the response was YES. Maximal size of possible extension queue 843. Compared 84664 event pairs, 2474 based on Foata normal form. 332/11369 useless extension candidates. Maximal degree in co-relation 54485. Up to 4954 conditions per place. [2023-08-26 18:21:31,721 INFO L140 encePairwiseOnDemand]: 328/346 looper letters, 274 selfloop transitions, 66 changer transitions 8/349 dead transitions. [2023-08-26 18:21:31,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 349 transitions, 5491 flow [2023-08-26 18:21:31,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:21:31,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:21:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 655 transitions. [2023-08-26 18:21:31,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3155105973025048 [2023-08-26 18:21:31,723 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 655 transitions. [2023-08-26 18:21:31,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 655 transitions. [2023-08-26 18:21:31,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:31,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 655 transitions. [2023-08-26 18:21:31,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:31,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 346.0) internal successors, (2422), 7 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:31,736 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 346.0) internal successors, (2422), 7 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:31,736 INFO L175 Difference]: Start difference. First operand has 118 places, 256 transitions, 3704 flow. Second operand 6 states and 655 transitions. [2023-08-26 18:21:31,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 349 transitions, 5491 flow [2023-08-26 18:21:32,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 349 transitions, 5354 flow, removed 40 selfloop flow, removed 7 redundant places. [2023-08-26 18:21:32,069 INFO L231 Difference]: Finished difference. Result has 118 places, 276 transitions, 4155 flow [2023-08-26 18:21:32,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=3582, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4155, PETRI_PLACES=118, PETRI_TRANSITIONS=276} [2023-08-26 18:21:32,069 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, 21 predicate places. [2023-08-26 18:21:32,069 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 276 transitions, 4155 flow [2023-08-26 18:21:32,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.0) internal successors, (693), 7 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:32,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:32,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:32,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 18:21:32,070 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:32,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:32,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1681631572, now seen corresponding path program 1 times [2023-08-26 18:21:32,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:32,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010245043] [2023-08-26 18:21:32,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:32,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:32,283 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-26 18:21:32,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:32,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010245043] [2023-08-26 18:21:32,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010245043] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:32,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:32,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 18:21:32,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055437554] [2023-08-26 18:21:32,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:32,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 18:21:32,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:32,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 18:21:32,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-08-26 18:21:32,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 346 [2023-08-26 18:21:32,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 276 transitions, 4155 flow. Second operand has 10 states, 10 states have (on average 95.5) internal successors, (955), 10 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:32,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:32,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 346 [2023-08-26 18:21:32,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:33,654 INFO L124 PetriNetUnfolderBase]: 5783/8993 cut-off events. [2023-08-26 18:21:33,654 INFO L125 PetriNetUnfolderBase]: For 50503/50503 co-relation queries the response was YES. [2023-08-26 18:21:33,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46753 conditions, 8993 events. 5783/8993 cut-off events. For 50503/50503 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 58481 event pairs, 570 based on Foata normal form. 332/9325 useless extension candidates. Maximal degree in co-relation 46719. Up to 4448 conditions per place. [2023-08-26 18:21:33,690 INFO L140 encePairwiseOnDemand]: 332/346 looper letters, 47 selfloop transitions, 10 changer transitions 296/354 dead transitions. [2023-08-26 18:21:33,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 354 transitions, 5661 flow [2023-08-26 18:21:33,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:21:33,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:21:33,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 824 transitions. [2023-08-26 18:21:33,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2976878612716763 [2023-08-26 18:21:33,692 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 824 transitions. [2023-08-26 18:21:33,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 824 transitions. [2023-08-26 18:21:33,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:33,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 824 transitions. [2023-08-26 18:21:33,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 103.0) internal successors, (824), 8 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:33,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 346.0) internal successors, (3114), 9 states have internal predecessors, (3114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:33,696 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 346.0) internal successors, (3114), 9 states have internal predecessors, (3114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:33,696 INFO L175 Difference]: Start difference. First operand has 118 places, 276 transitions, 4155 flow. Second operand 8 states and 824 transitions. [2023-08-26 18:21:33,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 354 transitions, 5661 flow [2023-08-26 18:21:33,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 354 transitions, 5593 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-08-26 18:21:33,997 INFO L231 Difference]: Finished difference. Result has 112 places, 47 transitions, 477 flow [2023-08-26 18:21:33,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=4035, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=477, PETRI_PLACES=112, PETRI_TRANSITIONS=47} [2023-08-26 18:21:33,997 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, 15 predicate places. [2023-08-26 18:21:33,997 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 47 transitions, 477 flow [2023-08-26 18:21:33,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 95.5) internal successors, (955), 10 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:33,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:33,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:33,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 18:21:33,998 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:33,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:33,998 INFO L85 PathProgramCache]: Analyzing trace with hash 2057016129, now seen corresponding path program 1 times [2023-08-26 18:21:33,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:33,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10056140] [2023-08-26 18:21:33,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:33,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:34,118 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-26 18:21:34,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:34,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10056140] [2023-08-26 18:21:34,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10056140] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:34,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:34,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:21:34,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98956813] [2023-08-26 18:21:34,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:34,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:21:34,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:34,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:21:34,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:21:34,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 346 [2023-08-26 18:21:34,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 47 transitions, 477 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:34,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:34,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 346 [2023-08-26 18:21:34,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:34,258 INFO L124 PetriNetUnfolderBase]: 453/821 cut-off events. [2023-08-26 18:21:34,258 INFO L125 PetriNetUnfolderBase]: For 5177/5260 co-relation queries the response was YES. [2023-08-26 18:21:34,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3617 conditions, 821 events. 453/821 cut-off events. For 5177/5260 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4043 event pairs, 98 based on Foata normal form. 32/845 useless extension candidates. Maximal degree in co-relation 3584. Up to 640 conditions per place. [2023-08-26 18:21:34,262 INFO L140 encePairwiseOnDemand]: 341/346 looper letters, 55 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2023-08-26 18:21:34,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 70 transitions, 801 flow [2023-08-26 18:21:34,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:21:34,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:21:34,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2023-08-26 18:21:34,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38246628131021193 [2023-08-26 18:21:34,264 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2023-08-26 18:21:34,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2023-08-26 18:21:34,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:34,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2023-08-26 18:21:34,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:34,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:34,266 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:34,266 INFO L175 Difference]: Start difference. First operand has 112 places, 47 transitions, 477 flow. Second operand 3 states and 397 transitions. [2023-08-26 18:21:34,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 70 transitions, 801 flow [2023-08-26 18:21:34,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 70 transitions, 648 flow, removed 28 selfloop flow, removed 20 redundant places. [2023-08-26 18:21:34,270 INFO L231 Difference]: Finished difference. Result has 73 places, 50 transitions, 389 flow [2023-08-26 18:21:34,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=389, PETRI_PLACES=73, PETRI_TRANSITIONS=50} [2023-08-26 18:21:34,271 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -24 predicate places. [2023-08-26 18:21:34,271 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 50 transitions, 389 flow [2023-08-26 18:21:34,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:34,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:34,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:34,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 18:21:34,271 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:34,271 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:34,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1535761512, now seen corresponding path program 1 times [2023-08-26 18:21:34,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:34,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792061870] [2023-08-26 18:21:34,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:34,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:35,461 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-26 18:21:35,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:35,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792061870] [2023-08-26 18:21:35,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792061870] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:35,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:35,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:21:35,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983545101] [2023-08-26 18:21:35,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:35,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:21:35,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:35,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:21:35,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:21:35,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 346 [2023-08-26 18:21:35,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 50 transitions, 389 flow. Second operand has 7 states, 7 states have (on average 106.42857142857143) internal successors, (745), 7 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:35,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:35,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 346 [2023-08-26 18:21:35,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:35,740 INFO L124 PetriNetUnfolderBase]: 511/906 cut-off events. [2023-08-26 18:21:35,741 INFO L125 PetriNetUnfolderBase]: For 2825/2825 co-relation queries the response was YES. [2023-08-26 18:21:35,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4070 conditions, 906 events. 511/906 cut-off events. For 2825/2825 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4415 event pairs, 236 based on Foata normal form. 3/908 useless extension candidates. Maximal degree in co-relation 4047. Up to 768 conditions per place. [2023-08-26 18:21:35,744 INFO L140 encePairwiseOnDemand]: 339/346 looper letters, 47 selfloop transitions, 15 changer transitions 0/63 dead transitions. [2023-08-26 18:21:35,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 63 transitions, 575 flow [2023-08-26 18:21:35,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:21:35,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:21:35,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 557 transitions. [2023-08-26 18:21:35,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3219653179190751 [2023-08-26 18:21:35,745 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 557 transitions. [2023-08-26 18:21:35,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 557 transitions. [2023-08-26 18:21:35,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:35,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 557 transitions. [2023-08-26 18:21:35,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:35,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:35,748 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:35,748 INFO L175 Difference]: Start difference. First operand has 73 places, 50 transitions, 389 flow. Second operand 5 states and 557 transitions. [2023-08-26 18:21:35,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 63 transitions, 575 flow [2023-08-26 18:21:35,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 63 transitions, 565 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 18:21:35,751 INFO L231 Difference]: Finished difference. Result has 77 places, 51 transitions, 433 flow [2023-08-26 18:21:35,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=433, PETRI_PLACES=77, PETRI_TRANSITIONS=51} [2023-08-26 18:21:35,751 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -20 predicate places. [2023-08-26 18:21:35,751 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 51 transitions, 433 flow [2023-08-26 18:21:35,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.42857142857143) internal successors, (745), 7 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:35,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:35,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:35,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 18:21:35,752 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:35,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:35,752 INFO L85 PathProgramCache]: Analyzing trace with hash 239220736, now seen corresponding path program 2 times [2023-08-26 18:21:35,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:35,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322534785] [2023-08-26 18:21:35,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:35,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:36,859 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-26 18:21:36,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:36,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322534785] [2023-08-26 18:21:36,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322534785] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:36,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:36,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:21:36,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330499040] [2023-08-26 18:21:36,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:36,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:21:36,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:36,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:21:36,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:21:36,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 346 [2023-08-26 18:21:36,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 51 transitions, 433 flow. Second operand has 8 states, 8 states have (on average 109.125) internal successors, (873), 8 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:36,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:36,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 346 [2023-08-26 18:21:36,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:37,178 INFO L124 PetriNetUnfolderBase]: 813/1436 cut-off events. [2023-08-26 18:21:37,179 INFO L125 PetriNetUnfolderBase]: For 5679/5679 co-relation queries the response was YES. [2023-08-26 18:21:37,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6786 conditions, 1436 events. 813/1436 cut-off events. For 5679/5679 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 8001 event pairs, 162 based on Foata normal form. 3/1438 useless extension candidates. Maximal degree in co-relation 6762. Up to 946 conditions per place. [2023-08-26 18:21:37,185 INFO L140 encePairwiseOnDemand]: 337/346 looper letters, 80 selfloop transitions, 43 changer transitions 0/124 dead transitions. [2023-08-26 18:21:37,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 124 transitions, 1281 flow [2023-08-26 18:21:37,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:21:37,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:21:37,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 813 transitions. [2023-08-26 18:21:37,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3356729975227085 [2023-08-26 18:21:37,187 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 813 transitions. [2023-08-26 18:21:37,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 813 transitions. [2023-08-26 18:21:37,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:37,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 813 transitions. [2023-08-26 18:21:37,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:37,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 346.0) internal successors, (2768), 8 states have internal predecessors, (2768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:37,190 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 346.0) internal successors, (2768), 8 states have internal predecessors, (2768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:37,190 INFO L175 Difference]: Start difference. First operand has 77 places, 51 transitions, 433 flow. Second operand 7 states and 813 transitions. [2023-08-26 18:21:37,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 124 transitions, 1281 flow [2023-08-26 18:21:37,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 124 transitions, 1188 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-26 18:21:37,197 INFO L231 Difference]: Finished difference. Result has 83 places, 85 transitions, 880 flow [2023-08-26 18:21:37,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=880, PETRI_PLACES=83, PETRI_TRANSITIONS=85} [2023-08-26 18:21:37,197 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -14 predicate places. [2023-08-26 18:21:37,197 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 85 transitions, 880 flow [2023-08-26 18:21:37,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.125) internal successors, (873), 8 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:37,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:37,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:37,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 18:21:37,198 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:37,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:37,198 INFO L85 PathProgramCache]: Analyzing trace with hash -883754388, now seen corresponding path program 3 times [2023-08-26 18:21:37,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:37,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240048136] [2023-08-26 18:21:37,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:37,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:38,293 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-26 18:21:38,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:38,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240048136] [2023-08-26 18:21:38,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240048136] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:38,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:38,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:21:38,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311576911] [2023-08-26 18:21:38,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:38,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:21:38,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:38,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:21:38,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:21:38,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 346 [2023-08-26 18:21:38,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 85 transitions, 880 flow. Second operand has 7 states, 7 states have (on average 106.42857142857143) internal successors, (745), 7 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:38,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:38,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 346 [2023-08-26 18:21:38,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:38,538 INFO L124 PetriNetUnfolderBase]: 808/1430 cut-off events. [2023-08-26 18:21:38,538 INFO L125 PetriNetUnfolderBase]: For 6909/6909 co-relation queries the response was YES. [2023-08-26 18:21:38,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7417 conditions, 1430 events. 808/1430 cut-off events. For 6909/6909 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 7951 event pairs, 212 based on Foata normal form. 3/1432 useless extension candidates. Maximal degree in co-relation 7390. Up to 989 conditions per place. [2023-08-26 18:21:38,545 INFO L140 encePairwiseOnDemand]: 340/346 looper letters, 64 selfloop transitions, 35 changer transitions 0/100 dead transitions. [2023-08-26 18:21:38,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 100 transitions, 1174 flow [2023-08-26 18:21:38,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:21:38,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:21:38,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 556 transitions. [2023-08-26 18:21:38,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3213872832369942 [2023-08-26 18:21:38,546 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 556 transitions. [2023-08-26 18:21:38,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 556 transitions. [2023-08-26 18:21:38,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:38,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 556 transitions. [2023-08-26 18:21:38,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:38,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:38,548 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:38,548 INFO L175 Difference]: Start difference. First operand has 83 places, 85 transitions, 880 flow. Second operand 5 states and 556 transitions. [2023-08-26 18:21:38,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 100 transitions, 1174 flow [2023-08-26 18:21:38,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 100 transitions, 1169 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 18:21:38,557 INFO L231 Difference]: Finished difference. Result has 88 places, 87 transitions, 1023 flow [2023-08-26 18:21:38,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1023, PETRI_PLACES=88, PETRI_TRANSITIONS=87} [2023-08-26 18:21:38,557 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -9 predicate places. [2023-08-26 18:21:38,558 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 87 transitions, 1023 flow [2023-08-26 18:21:38,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.42857142857143) internal successors, (745), 7 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:38,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:38,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:38,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 18:21:38,558 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:38,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:38,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1606282742, now seen corresponding path program 1 times [2023-08-26 18:21:38,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:38,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953758645] [2023-08-26 18:21:38,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:38,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:38,677 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-26 18:21:38,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:38,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953758645] [2023-08-26 18:21:38,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953758645] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:38,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:38,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:21:38,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991308447] [2023-08-26 18:21:38,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:38,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:21:38,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:38,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:21:38,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:21:38,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 346 [2023-08-26 18:21:38,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 87 transitions, 1023 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:38,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:38,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 346 [2023-08-26 18:21:38,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:38,819 INFO L124 PetriNetUnfolderBase]: 347/739 cut-off events. [2023-08-26 18:21:38,819 INFO L125 PetriNetUnfolderBase]: For 4854/4888 co-relation queries the response was YES. [2023-08-26 18:21:38,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3869 conditions, 739 events. 347/739 cut-off events. For 4854/4888 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4115 event pairs, 25 based on Foata normal form. 96/832 useless extension candidates. Maximal degree in co-relation 3840. Up to 272 conditions per place. [2023-08-26 18:21:38,822 INFO L140 encePairwiseOnDemand]: 341/346 looper letters, 92 selfloop transitions, 7 changer transitions 0/127 dead transitions. [2023-08-26 18:21:38,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 127 transitions, 1641 flow [2023-08-26 18:21:38,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:21:38,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:21:38,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 528 transitions. [2023-08-26 18:21:38,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3815028901734104 [2023-08-26 18:21:38,824 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 528 transitions. [2023-08-26 18:21:38,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 528 transitions. [2023-08-26 18:21:38,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:38,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 528 transitions. [2023-08-26 18:21:38,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:38,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:38,826 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:38,826 INFO L175 Difference]: Start difference. First operand has 88 places, 87 transitions, 1023 flow. Second operand 4 states and 528 transitions. [2023-08-26 18:21:38,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 127 transitions, 1641 flow [2023-08-26 18:21:38,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 127 transitions, 1585 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-08-26 18:21:38,832 INFO L231 Difference]: Finished difference. Result has 90 places, 86 transitions, 979 flow [2023-08-26 18:21:38,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=979, PETRI_PLACES=90, PETRI_TRANSITIONS=86} [2023-08-26 18:21:38,833 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -7 predicate places. [2023-08-26 18:21:38,833 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 86 transitions, 979 flow [2023-08-26 18:21:38,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:38,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:38,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:38,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-26 18:21:38,833 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:38,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:38,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1606436628, now seen corresponding path program 1 times [2023-08-26 18:21:38,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:38,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155640065] [2023-08-26 18:21:38,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:38,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:39,036 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-26 18:21:39,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:39,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155640065] [2023-08-26 18:21:39,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155640065] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:39,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:39,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:21:39,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730315947] [2023-08-26 18:21:39,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:39,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:21:39,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:39,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:21:39,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:21:39,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 346 [2023-08-26 18:21:39,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 86 transitions, 979 flow. Second operand has 5 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:39,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:39,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 346 [2023-08-26 18:21:39,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:39,361 INFO L124 PetriNetUnfolderBase]: 1007/2022 cut-off events. [2023-08-26 18:21:39,361 INFO L125 PetriNetUnfolderBase]: For 11371/11402 co-relation queries the response was YES. [2023-08-26 18:21:39,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10547 conditions, 2022 events. 1007/2022 cut-off events. For 11371/11402 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 13131 event pairs, 277 based on Foata normal form. 43/2054 useless extension candidates. Maximal degree in co-relation 10517. Up to 823 conditions per place. [2023-08-26 18:21:39,372 INFO L140 encePairwiseOnDemand]: 342/346 looper letters, 106 selfloop transitions, 15 changer transitions 7/155 dead transitions. [2023-08-26 18:21:39,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 155 transitions, 1753 flow [2023-08-26 18:21:39,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:21:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:21:39,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 664 transitions. [2023-08-26 18:21:39,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3838150289017341 [2023-08-26 18:21:39,374 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 664 transitions. [2023-08-26 18:21:39,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 664 transitions. [2023-08-26 18:21:39,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:39,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 664 transitions. [2023-08-26 18:21:39,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:39,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:39,376 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:39,376 INFO L175 Difference]: Start difference. First operand has 90 places, 86 transitions, 979 flow. Second operand 5 states and 664 transitions. [2023-08-26 18:21:39,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 155 transitions, 1753 flow [2023-08-26 18:21:39,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 155 transitions, 1703 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-08-26 18:21:39,391 INFO L231 Difference]: Finished difference. Result has 95 places, 88 transitions, 1020 flow [2023-08-26 18:21:39,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1020, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2023-08-26 18:21:39,391 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -2 predicate places. [2023-08-26 18:21:39,391 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 1020 flow [2023-08-26 18:21:39,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:39,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:39,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:39,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-26 18:21:39,392 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:39,392 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:39,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1103246048, now seen corresponding path program 2 times [2023-08-26 18:21:39,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:39,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446322438] [2023-08-26 18:21:39,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:39,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:39,548 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-26 18:21:39,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:39,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446322438] [2023-08-26 18:21:39,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446322438] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:39,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:39,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:21:39,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634275645] [2023-08-26 18:21:39,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:39,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:21:39,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:39,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:21:39,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:21:39,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 346 [2023-08-26 18:21:39,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 1020 flow. Second operand has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:39,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:39,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 346 [2023-08-26 18:21:39,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:39,735 INFO L124 PetriNetUnfolderBase]: 562/1191 cut-off events. [2023-08-26 18:21:39,735 INFO L125 PetriNetUnfolderBase]: For 7705/7748 co-relation queries the response was YES. [2023-08-26 18:21:39,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6148 conditions, 1191 events. 562/1191 cut-off events. For 7705/7748 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 7949 event pairs, 26 based on Foata normal form. 113/1289 useless extension candidates. Maximal degree in co-relation 6115. Up to 531 conditions per place. [2023-08-26 18:21:39,740 INFO L140 encePairwiseOnDemand]: 341/346 looper letters, 89 selfloop transitions, 10 changer transitions 1/125 dead transitions. [2023-08-26 18:21:39,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 125 transitions, 1631 flow [2023-08-26 18:21:39,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:21:39,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:21:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 649 transitions. [2023-08-26 18:21:39,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37514450867052024 [2023-08-26 18:21:39,742 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 649 transitions. [2023-08-26 18:21:39,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 649 transitions. [2023-08-26 18:21:39,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:39,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 649 transitions. [2023-08-26 18:21:39,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:39,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:39,744 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:39,744 INFO L175 Difference]: Start difference. First operand has 95 places, 88 transitions, 1020 flow. Second operand 5 states and 649 transitions. [2023-08-26 18:21:39,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 125 transitions, 1631 flow [2023-08-26 18:21:39,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 125 transitions, 1507 flow, removed 25 selfloop flow, removed 4 redundant places. [2023-08-26 18:21:39,753 INFO L231 Difference]: Finished difference. Result has 96 places, 83 transitions, 896 flow [2023-08-26 18:21:39,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=896, PETRI_PLACES=96, PETRI_TRANSITIONS=83} [2023-08-26 18:21:39,753 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -1 predicate places. [2023-08-26 18:21:39,753 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 83 transitions, 896 flow [2023-08-26 18:21:39,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:39,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:39,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:39,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-26 18:21:39,754 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:39,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:39,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1385216776, now seen corresponding path program 1 times [2023-08-26 18:21:39,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:39,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629163891] [2023-08-26 18:21:39,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:39,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:21:39,839 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:21:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:21:39,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:21:39,937 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:21:39,938 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONASSERT (99 of 100 remaining) [2023-08-26 18:21:39,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 100 remaining) [2023-08-26 18:21:39,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 100 remaining) [2023-08-26 18:21:39,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 100 remaining) [2023-08-26 18:21:39,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 100 remaining) [2023-08-26 18:21:39,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 100 remaining) [2023-08-26 18:21:39,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 100 remaining) [2023-08-26 18:21:39,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 100 remaining) [2023-08-26 18:21:39,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 100 remaining) [2023-08-26 18:21:39,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 100 remaining) [2023-08-26 18:21:39,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 100 remaining) [2023-08-26 18:21:39,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 100 remaining) [2023-08-26 18:21:39,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 100 remaining) [2023-08-26 18:21:39,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 100 remaining) [2023-08-26 18:21:39,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 100 remaining) [2023-08-26 18:21:39,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 100 remaining) [2023-08-26 18:21:39,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 100 remaining) [2023-08-26 18:21:39,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 100 remaining) [2023-08-26 18:21:39,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 100 remaining) [2023-08-26 18:21:39,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 100 remaining) [2023-08-26 18:21:39,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 100 remaining) [2023-08-26 18:21:39,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 100 remaining) [2023-08-26 18:21:39,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 100 remaining) [2023-08-26 18:21:39,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 100 remaining) [2023-08-26 18:21:39,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 100 remaining) [2023-08-26 18:21:39,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 100 remaining) [2023-08-26 18:21:39,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 100 remaining) [2023-08-26 18:21:39,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 100 remaining) [2023-08-26 18:21:39,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 100 remaining) [2023-08-26 18:21:39,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 100 remaining) [2023-08-26 18:21:39,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 100 remaining) [2023-08-26 18:21:39,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 100 remaining) [2023-08-26 18:21:39,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 100 remaining) [2023-08-26 18:21:39,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 100 remaining) [2023-08-26 18:21:39,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 100 remaining) [2023-08-26 18:21:39,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 100 remaining) [2023-08-26 18:21:39,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 100 remaining) [2023-08-26 18:21:39,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 100 remaining) [2023-08-26 18:21:39,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 100 remaining) [2023-08-26 18:21:39,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 100 remaining) [2023-08-26 18:21:39,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 100 remaining) [2023-08-26 18:21:39,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 100 remaining) [2023-08-26 18:21:39,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 100 remaining) [2023-08-26 18:21:39,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 100 remaining) [2023-08-26 18:21:39,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 100 remaining) [2023-08-26 18:21:39,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 100 remaining) [2023-08-26 18:21:39,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 100 remaining) [2023-08-26 18:21:39,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 100 remaining) [2023-08-26 18:21:39,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 100 remaining) [2023-08-26 18:21:39,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 100 remaining) [2023-08-26 18:21:39,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 100 remaining) [2023-08-26 18:21:39,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 100 remaining) [2023-08-26 18:21:39,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 100 remaining) [2023-08-26 18:21:39,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 100 remaining) [2023-08-26 18:21:39,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 100 remaining) [2023-08-26 18:21:39,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 100 remaining) [2023-08-26 18:21:39,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 100 remaining) [2023-08-26 18:21:39,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 100 remaining) [2023-08-26 18:21:39,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 100 remaining) [2023-08-26 18:21:39,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 100 remaining) [2023-08-26 18:21:39,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 100 remaining) [2023-08-26 18:21:39,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 100 remaining) [2023-08-26 18:21:39,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 100 remaining) [2023-08-26 18:21:39,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 100 remaining) [2023-08-26 18:21:39,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 100 remaining) [2023-08-26 18:21:39,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 100 remaining) [2023-08-26 18:21:39,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 100 remaining) [2023-08-26 18:21:39,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 100 remaining) [2023-08-26 18:21:39,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 100 remaining) [2023-08-26 18:21:39,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 100 remaining) [2023-08-26 18:21:39,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 100 remaining) [2023-08-26 18:21:39,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 100 remaining) [2023-08-26 18:21:39,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 100 remaining) [2023-08-26 18:21:39,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 100 remaining) [2023-08-26 18:21:39,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 100 remaining) [2023-08-26 18:21:39,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 100 remaining) [2023-08-26 18:21:39,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 100 remaining) [2023-08-26 18:21:39,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 100 remaining) [2023-08-26 18:21:39,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 100 remaining) [2023-08-26 18:21:39,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 100 remaining) [2023-08-26 18:21:39,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 100 remaining) [2023-08-26 18:21:39,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 100 remaining) [2023-08-26 18:21:39,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 100 remaining) [2023-08-26 18:21:39,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 100 remaining) [2023-08-26 18:21:39,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 100 remaining) [2023-08-26 18:21:39,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 100 remaining) [2023-08-26 18:21:39,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 100 remaining) [2023-08-26 18:21:39,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 100 remaining) [2023-08-26 18:21:39,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 100 remaining) [2023-08-26 18:21:39,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 100 remaining) [2023-08-26 18:21:39,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 100 remaining) [2023-08-26 18:21:39,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 100 remaining) [2023-08-26 18:21:39,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 100 remaining) [2023-08-26 18:21:39,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 100 remaining) [2023-08-26 18:21:39,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 100 remaining) [2023-08-26 18:21:39,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 100 remaining) [2023-08-26 18:21:39,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 100 remaining) [2023-08-26 18:21:39,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 100 remaining) [2023-08-26 18:21:39,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 100 remaining) [2023-08-26 18:21:39,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 100 remaining) [2023-08-26 18:21:39,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-26 18:21:39,951 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:39,956 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:21:39,956 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:21:40,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:21:40 BasicIcfg [2023-08-26 18:21:40,031 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:21:40,031 INFO L158 Benchmark]: Toolchain (without parser) took 55109.50ms. Allocated memory was 360.7MB in the beginning and 3.1GB in the end (delta: 2.7GB). Free memory was 333.1MB in the beginning and 1.4GB in the end (delta: -1.0GB). Peak memory consumption was 1.7GB. Max. memory is 16.0GB. [2023-08-26 18:21:40,031 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 360.7MB. Free memory was 337.2MB in the beginning and 337.1MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:21:40,032 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.14ms. Allocated memory is still 360.7MB. Free memory was 332.5MB in the beginning and 307.0MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 18:21:40,032 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.46ms. Allocated memory is still 360.7MB. Free memory was 307.0MB in the beginning and 304.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:21:40,032 INFO L158 Benchmark]: Boogie Preprocessor took 34.95ms. Allocated memory is still 360.7MB. Free memory was 304.3MB in the beginning and 302.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:21:40,032 INFO L158 Benchmark]: RCFGBuilder took 1018.78ms. Allocated memory was 360.7MB in the beginning and 434.1MB in the end (delta: 73.4MB). Free memory was 302.1MB in the beginning and 283.6MB in the end (delta: 18.4MB). Peak memory consumption was 95.0MB. Max. memory is 16.0GB. [2023-08-26 18:21:40,032 INFO L158 Benchmark]: TraceAbstraction took 53573.52ms. Allocated memory was 434.1MB in the beginning and 3.1GB in the end (delta: 2.7GB). Free memory was 282.6MB in the beginning and 1.4GB in the end (delta: -1.1GB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. [2023-08-26 18:21:40,033 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.10ms. Allocated memory is still 360.7MB. Free memory was 337.2MB in the beginning and 337.1MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 414.14ms. Allocated memory is still 360.7MB. Free memory was 332.5MB in the beginning and 307.0MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 59.46ms. Allocated memory is still 360.7MB. Free memory was 307.0MB in the beginning and 304.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 34.95ms. Allocated memory is still 360.7MB. Free memory was 304.3MB in the beginning and 302.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1018.78ms. Allocated memory was 360.7MB in the beginning and 434.1MB in the end (delta: 73.4MB). Free memory was 302.1MB in the beginning and 283.6MB in the end (delta: 18.4MB). Peak memory consumption was 95.0MB. Max. memory is 16.0GB. * TraceAbstraction took 53573.52ms. Allocated memory was 434.1MB in the beginning and 3.1GB in the end (delta: 2.7GB). Free memory was 282.6MB in the beginning and 1.4GB in the end (delta: -1.1GB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.4s, 193 PlacesBefore, 97 PlacesAfterwards, 186 TransitionsBefore, 88 TransitionsAfterwards, 8612 CoEnabledTransitionPairs, 8 FixpointIterations, 67 TrivialSequentialCompositions, 83 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 157 TotalNumberOfCompositions, 49859 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11608, independent: 10813, independent conditional: 0, independent unconditional: 10813, dependent: 795, dependent conditional: 0, dependent unconditional: 795, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3217, independent: 3098, independent conditional: 0, independent unconditional: 3098, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11608, independent: 7715, independent conditional: 0, independent unconditional: 7715, dependent: 676, dependent conditional: 0, dependent unconditional: 676, unknown: 3217, unknown conditional: 0, unknown unconditional: 3217] , Statistics on independence cache: Total cache size (in pairs): 503, Positive cache size: 440, Positive conditional cache size: 0, Positive unconditional cache size: 440, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L852] 0 pthread_t t1837; [L853] FCALL, FORK 0 pthread_create(&t1837, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1837, ((void *)0), P0, ((void *)0))=-1, t1837={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L854] 0 pthread_t t1838; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1837={6:0}, t1838={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L779] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L855] FCALL, FORK 0 pthread_create(&t1838, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1838, ((void *)0), P1, ((void *)0))=0, t1837={6:0}, t1838={7:0}, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L791] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L856] 0 pthread_t t1839; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1837={6:0}, t1838={7:0}, t1839={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L794] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 \read(y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L799] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L800] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L857] FCALL, FORK 0 pthread_create(&t1839, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1839, ((void *)0), P2, ((void *)0))=1, t1837={6:0}, t1838={7:0}, t1839={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 y$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(y) [L814] 3 y$mem_tmp = y [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] EXPR 3 \read(y) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L817] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L818] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L819] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L821] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 3 \read(y) [L822] 3 __unbuffered_p2_EAX = y [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] 3 y = y$flush_delayed ? y$mem_tmp : y [L824] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L827] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 \read(y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L832] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L833] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L834] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 3 return 0; [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L861] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L861] RET 0 assume_abort_if_not(main$tmp_guard0) [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 \read(y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L866] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1837={6:0}, t1838={7:0}, t1839={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 y$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(y) [L873] 0 y$mem_tmp = y [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] EXPR 0 \read(y) [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L876] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L877] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L878] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L880] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 \read(y) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] EXPR 0 \read(y) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe002_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 249 locations, 100 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: 53.3s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 26.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 16.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1140 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1140 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 305 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3157 IncrementalHoareTripleChecker+Invalid, 3462 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 305 mSolverCounterUnsat, 28 mSDtfsCounter, 3157 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4155occurred in iteration=17, InterpolantAutomatonStates: 134, 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.5s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 298 ConstructedInterpolants, 0 QuantifiedInterpolants, 3369 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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 proved your program to be incorrect! [2023-08-26 18:21:40,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...