/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --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/safe001_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:08:32,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:08:32,965 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-NoLbe.epf [2023-12-05 21:08:32,995 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:08:32,997 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:08:32,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:08:32,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:08:32,998 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:08:32,998 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:08:33,001 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:08:33,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:08:33,002 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:08:33,002 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:08:33,003 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:08:33,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:08:33,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:08:33,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:08:33,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:08:33,004 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:08:33,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:08:33,004 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:08:33,005 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:08:33,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:08:33,005 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:08:33,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:08:33,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:08:33,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:08:33,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:08:33,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:08:33,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:08:33,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:08:33,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:08:33,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:08:33,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true 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-12-05 21:08:33,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:08:33,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:08:33,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:08:33,203 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:08:33,204 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:08:33,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_rmo.oepc.i [2023-12-05 21:08:34,254 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:08:34,441 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:08:34,442 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_rmo.oepc.i [2023-12-05 21:08:34,457 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/509003e3a/605d5cdf2851490e88d860cc9d0f5003/FLAG7e40f9aa9 [2023-12-05 21:08:34,468 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/509003e3a/605d5cdf2851490e88d860cc9d0f5003 [2023-12-05 21:08:34,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:08:34,471 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:08:34,472 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:08:34,472 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:08:34,476 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:08:34,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:08:34" (1/1) ... [2023-12-05 21:08:34,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f181f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:34, skipping insertion in model container [2023-12-05 21:08:34,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:08:34" (1/1) ... [2023-12-05 21:08:34,522 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:08:34,834 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:08:34,848 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:08:34,915 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:08:34,937 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:08:34,937 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:08:34,942 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:08:34,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:34 WrapperNode [2023-12-05 21:08:34,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:08:34,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:08:34,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:08:34,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:08:34,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:34" (1/1) ... [2023-12-05 21:08:34,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:34" (1/1) ... [2023-12-05 21:08:34,996 INFO L138 Inliner]: procedures = 176, calls = 83, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 175 [2023-12-05 21:08:34,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:08:34,997 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:08:34,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:08:34,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:08:35,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:34" (1/1) ... [2023-12-05 21:08:35,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:34" (1/1) ... [2023-12-05 21:08:35,009 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:34" (1/1) ... [2023-12-05 21:08:35,016 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:34" (1/1) ... [2023-12-05 21:08:35,023 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:34" (1/1) ... [2023-12-05 21:08:35,025 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:34" (1/1) ... [2023-12-05 21:08:35,027 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:34" (1/1) ... [2023-12-05 21:08:35,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:34" (1/1) ... [2023-12-05 21:08:35,047 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:08:35,048 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:08:35,048 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:08:35,048 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:08:35,052 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:34" (1/1) ... [2023-12-05 21:08:35,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:08:35,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:08:35,077 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-12-05 21:08:35,096 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-12-05 21:08:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:08:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:08:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:08:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:08:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:08:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:08:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-05 21:08:35,117 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-05 21:08:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-05 21:08:35,117 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-05 21:08:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-05 21:08:35,117 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-05 21:08:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:08:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:08:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:08:35,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:08:35,119 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:08:35,272 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:08:35,274 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:08:35,732 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:08:36,154 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:08:36,154 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:08:36,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:08:36 BoogieIcfgContainer [2023-12-05 21:08:36,155 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:08:36,157 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:08:36,157 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:08:36,159 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:08:36,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:08:34" (1/3) ... [2023-12-05 21:08:36,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e77f6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:08:36, skipping insertion in model container [2023-12-05 21:08:36,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:34" (2/3) ... [2023-12-05 21:08:36,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e77f6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:08:36, skipping insertion in model container [2023-12-05 21:08:36,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:08:36" (3/3) ... [2023-12-05 21:08:36,162 INFO L112 eAbstractionObserver]: Analyzing ICFG safe001_rmo.oepc.i [2023-12-05 21:08:36,175 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:08:36,175 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2023-12-05 21:08:36,175 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:08:36,269 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:08:36,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 192 transitions, 396 flow [2023-12-05 21:08:36,382 INFO L124 PetriNetUnfolderBase]: 3/189 cut-off events. [2023-12-05 21:08:36,382 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:08:36,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 3/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 325 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2023-12-05 21:08:36,391 INFO L82 GeneralOperation]: Start removeDead. Operand has 199 places, 192 transitions, 396 flow [2023-12-05 21:08:36,395 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 196 places, 189 transitions, 387 flow [2023-12-05 21:08:36,406 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:08:36,412 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@2b9c9d2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:08:36,412 INFO L363 AbstractCegarLoop]: Starting to check reachability of 99 error locations. [2023-12-05 21:08:36,422 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:08:36,422 INFO L124 PetriNetUnfolderBase]: 0/56 cut-off events. [2023-12-05 21:08:36,423 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:08:36,423 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:36,423 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:36,424 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-12-05 21:08:36,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:36,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1548699196, now seen corresponding path program 1 times [2023-12-05 21:08:36,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:36,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450729002] [2023-12-05 21:08:36,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:36,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:36,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:36,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:36,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450729002] [2023-12-05 21:08:36,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450729002] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:36,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:36,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:36,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546929189] [2023-12-05 21:08:36,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:36,711 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:36,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:36,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:36,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:36,742 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 192 [2023-12-05 21:08:36,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 189 transitions, 387 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:36,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:36,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 192 [2023-12-05 21:08:36,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:41,065 INFO L124 PetriNetUnfolderBase]: 17481/31804 cut-off events. [2023-12-05 21:08:41,065 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-12-05 21:08:41,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56452 conditions, 31804 events. 17481/31804 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 2518. Compared 298999 event pairs, 11961 based on Foata normal form. 900/15492 useless extension candidates. Maximal degree in co-relation 56378. Up to 16876 conditions per place. [2023-12-05 21:08:41,314 INFO L140 encePairwiseOnDemand]: 156/192 looper letters, 74 selfloop transitions, 2 changer transitions 0/174 dead transitions. [2023-12-05 21:08:41,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 174 transitions, 509 flow [2023-12-05 21:08:41,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:41,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:41,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2023-12-05 21:08:41,324 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7621527777777778 [2023-12-05 21:08:41,325 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2023-12-05 21:08:41,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2023-12-05 21:08:41,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:41,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2023-12-05 21:08:41,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:41,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:41,335 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:41,337 INFO L308 CegarLoopForPetriNet]: 196 programPoint places, -32 predicate places. [2023-12-05 21:08:41,337 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 174 transitions, 509 flow [2023-12-05 21:08:41,338 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:41,338 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:41,338 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:41,338 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:08:41,338 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-12-05 21:08:41,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:41,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1548699197, now seen corresponding path program 1 times [2023-12-05 21:08:41,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:41,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868226796] [2023-12-05 21:08:41,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:41,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:41,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:41,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:41,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868226796] [2023-12-05 21:08:41,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868226796] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:41,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:41,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:41,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390740238] [2023-12-05 21:08:41,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:41,492 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:41,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:41,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:41,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:41,494 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 192 [2023-12-05 21:08:41,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 174 transitions, 509 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:41,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:41,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 192 [2023-12-05 21:08:41,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:45,328 INFO L124 PetriNetUnfolderBase]: 17543/31917 cut-off events. [2023-12-05 21:08:45,328 INFO L125 PetriNetUnfolderBase]: For 2026/6790 co-relation queries the response was YES. [2023-12-05 21:08:45,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80384 conditions, 31917 events. 17543/31917 cut-off events. For 2026/6790 co-relation queries the response was YES. Maximal size of possible extension queue 2518. Compared 299803 event pairs, 12023 based on Foata normal form. 0/14696 useless extension candidates. Maximal degree in co-relation 80304. Up to 18473 conditions per place. [2023-12-05 21:08:45,559 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 92 selfloop transitions, 2 changer transitions 0/195 dead transitions. [2023-12-05 21:08:45,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 195 transitions, 781 flow [2023-12-05 21:08:45,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:45,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:45,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2023-12-05 21:08:45,562 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6788194444444444 [2023-12-05 21:08:45,562 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 391 transitions. [2023-12-05 21:08:45,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 391 transitions. [2023-12-05 21:08:45,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:45,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 391 transitions. [2023-12-05 21:08:45,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:45,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:45,565 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:45,566 INFO L308 CegarLoopForPetriNet]: 196 programPoint places, -31 predicate places. [2023-12-05 21:08:45,566 INFO L500 AbstractCegarLoop]: Abstraction has has 165 places, 195 transitions, 781 flow [2023-12-05 21:08:45,566 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:45,567 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:45,567 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:45,567 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:08:45,567 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-12-05 21:08:45,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:45,568 INFO L85 PathProgramCache]: Analyzing trace with hash 760053492, now seen corresponding path program 1 times [2023-12-05 21:08:45,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:45,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265396554] [2023-12-05 21:08:45,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:45,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:45,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:45,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:45,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265396554] [2023-12-05 21:08:45,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265396554] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:45,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:45,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:08:45,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770142893] [2023-12-05 21:08:45,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:45,757 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:08:45,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:45,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:08:45,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:08:45,759 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 192 [2023-12-05 21:08:45,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 195 transitions, 781 flow. Second operand has 6 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:45,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:45,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 192 [2023-12-05 21:08:45,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:48,576 INFO L124 PetriNetUnfolderBase]: 10538/21046 cut-off events. [2023-12-05 21:08:48,576 INFO L125 PetriNetUnfolderBase]: For 4072/7510 co-relation queries the response was YES. [2023-12-05 21:08:48,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66503 conditions, 21046 events. 10538/21046 cut-off events. For 4072/7510 co-relation queries the response was YES. Maximal size of possible extension queue 1240. Compared 202753 event pairs, 2846 based on Foata normal form. 0/12710 useless extension candidates. Maximal degree in co-relation 66412. Up to 11676 conditions per place. [2023-12-05 21:08:48,744 INFO L140 encePairwiseOnDemand]: 169/192 looper letters, 101 selfloop transitions, 19 changer transitions 0/216 dead transitions. [2023-12-05 21:08:48,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 216 transitions, 1143 flow [2023-12-05 21:08:48,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:08:48,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:08:48,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 854 transitions. [2023-12-05 21:08:48,746 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6354166666666666 [2023-12-05 21:08:48,746 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 854 transitions. [2023-12-05 21:08:48,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 854 transitions. [2023-12-05 21:08:48,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:48,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 854 transitions. [2023-12-05 21:08:48,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:48,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:48,751 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:48,752 INFO L308 CegarLoopForPetriNet]: 196 programPoint places, -28 predicate places. [2023-12-05 21:08:48,752 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 216 transitions, 1143 flow [2023-12-05 21:08:48,753 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:48,753 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:48,753 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:48,753 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:08:48,753 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-12-05 21:08:48,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:48,754 INFO L85 PathProgramCache]: Analyzing trace with hash 760053493, now seen corresponding path program 1 times [2023-12-05 21:08:48,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:48,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129616320] [2023-12-05 21:08:48,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:48,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:48,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:48,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129616320] [2023-12-05 21:08:48,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129616320] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:48,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:48,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:08:48,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512805431] [2023-12-05 21:08:48,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:48,909 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:08:48,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:48,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:08:48,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:08:48,913 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 192 [2023-12-05 21:08:48,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 216 transitions, 1143 flow. Second operand has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:48,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:48,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 192 [2023-12-05 21:08:48,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:49,689 INFO L124 PetriNetUnfolderBase]: 2293/5639 cut-off events. [2023-12-05 21:08:49,689 INFO L125 PetriNetUnfolderBase]: For 2600/3210 co-relation queries the response was YES. [2023-12-05 21:08:49,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18922 conditions, 5639 events. 2293/5639 cut-off events. For 2600/3210 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 51128 event pairs, 319 based on Foata normal form. 0/4573 useless extension candidates. Maximal degree in co-relation 18822. Up to 3292 conditions per place. [2023-12-05 21:08:49,723 INFO L140 encePairwiseOnDemand]: 179/192 looper letters, 64 selfloop transitions, 2 changer transitions 0/173 dead transitions. [2023-12-05 21:08:49,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 173 transitions, 931 flow [2023-12-05 21:08:49,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:08:49,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:08:49,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2023-12-05 21:08:49,725 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6263020833333334 [2023-12-05 21:08:49,725 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2023-12-05 21:08:49,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2023-12-05 21:08:49,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:49,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2023-12-05 21:08:49,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:49,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:49,728 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:49,728 INFO L308 CegarLoopForPetriNet]: 196 programPoint places, -36 predicate places. [2023-12-05 21:08:49,728 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 173 transitions, 931 flow [2023-12-05 21:08:49,729 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:49,729 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:49,729 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:49,729 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:08:49,729 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-12-05 21:08:49,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:49,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2097143854, now seen corresponding path program 1 times [2023-12-05 21:08:49,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:49,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322486302] [2023-12-05 21:08:49,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:49,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:49,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:49,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:49,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322486302] [2023-12-05 21:08:49,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322486302] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:49,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:49,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:49,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307700408] [2023-12-05 21:08:49,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:49,830 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:49,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:49,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:49,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:49,832 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 192 [2023-12-05 21:08:49,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 173 transitions, 931 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:49,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:49,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 192 [2023-12-05 21:08:49,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:50,609 INFO L124 PetriNetUnfolderBase]: 2746/6176 cut-off events. [2023-12-05 21:08:50,609 INFO L125 PetriNetUnfolderBase]: For 7038/7902 co-relation queries the response was YES. [2023-12-05 21:08:50,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25140 conditions, 6176 events. 2746/6176 cut-off events. For 7038/7902 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 53896 event pairs, 240 based on Foata normal form. 2/4923 useless extension candidates. Maximal degree in co-relation 25032. Up to 3746 conditions per place. [2023-12-05 21:08:50,655 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 89 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2023-12-05 21:08:50,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 193 transitions, 1317 flow [2023-12-05 21:08:50,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:50,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:50,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-12-05 21:08:50,657 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.640625 [2023-12-05 21:08:50,657 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-12-05 21:08:50,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-12-05 21:08:50,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:50,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-12-05 21:08:50,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:50,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:50,659 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:50,660 INFO L308 CegarLoopForPetriNet]: 196 programPoint places, -35 predicate places. [2023-12-05 21:08:50,660 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 193 transitions, 1317 flow [2023-12-05 21:08:50,660 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:50,660 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:50,660 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:50,660 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:08:50,660 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-12-05 21:08:50,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:50,661 INFO L85 PathProgramCache]: Analyzing trace with hash 2097143853, now seen corresponding path program 1 times [2023-12-05 21:08:50,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:50,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043305627] [2023-12-05 21:08:50,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:50,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:50,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:50,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:50,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043305627] [2023-12-05 21:08:50,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043305627] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:50,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:50,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:50,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586599134] [2023-12-05 21:08:50,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:50,693 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:50,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:50,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:50,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:50,693 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 192 [2023-12-05 21:08:50,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 193 transitions, 1317 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:50,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:50,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 192 [2023-12-05 21:08:50,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:51,583 INFO L124 PetriNetUnfolderBase]: 2745/6268 cut-off events. [2023-12-05 21:08:51,583 INFO L125 PetriNetUnfolderBase]: For 8929/10249 co-relation queries the response was YES. [2023-12-05 21:08:51,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29364 conditions, 6268 events. 2745/6268 cut-off events. For 8929/10249 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 55109 event pairs, 240 based on Foata normal form. 2/5015 useless extension candidates. Maximal degree in co-relation 29247. Up to 3750 conditions per place. [2023-12-05 21:08:51,627 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 92 selfloop transitions, 2 changer transitions 0/192 dead transitions. [2023-12-05 21:08:51,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 192 transitions, 1497 flow [2023-12-05 21:08:51,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:51,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:51,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-12-05 21:08:51,628 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2023-12-05 21:08:51,628 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-12-05 21:08:51,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-12-05 21:08:51,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:51,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-12-05 21:08:51,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:51,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:51,630 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:51,631 INFO L308 CegarLoopForPetriNet]: 196 programPoint places, -34 predicate places. [2023-12-05 21:08:51,631 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 192 transitions, 1497 flow [2023-12-05 21:08:51,631 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:51,631 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:51,631 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:51,631 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:08:51,631 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-12-05 21:08:51,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:51,632 INFO L85 PathProgramCache]: Analyzing trace with hash 193150880, now seen corresponding path program 1 times [2023-12-05 21:08:51,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:51,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124574792] [2023-12-05 21:08:51,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:51,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:51,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-12-05 21:08:51,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:51,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124574792] [2023-12-05 21:08:51,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124574792] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:51,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:51,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:51,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420133583] [2023-12-05 21:08:51,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:51,680 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:51,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:51,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:51,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:51,683 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 192 [2023-12-05 21:08:51,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 192 transitions, 1497 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:51,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:51,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 192 [2023-12-05 21:08:51,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:52,521 INFO L124 PetriNetUnfolderBase]: 3192/6949 cut-off events. [2023-12-05 21:08:52,521 INFO L125 PetriNetUnfolderBase]: For 17406/18090 co-relation queries the response was YES. [2023-12-05 21:08:52,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37299 conditions, 6949 events. 3192/6949 cut-off events. For 17406/18090 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 60386 event pairs, 248 based on Foata normal form. 6/5515 useless extension candidates. Maximal degree in co-relation 37173. Up to 4219 conditions per place. [2023-12-05 21:08:52,571 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 95 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2023-12-05 21:08:52,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 194 transitions, 1725 flow [2023-12-05 21:08:52,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:52,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-12-05 21:08:52,573 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2023-12-05 21:08:52,573 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-12-05 21:08:52,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-12-05 21:08:52,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:52,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-12-05 21:08:52,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:52,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:52,575 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:52,575 INFO L308 CegarLoopForPetriNet]: 196 programPoint places, -33 predicate places. [2023-12-05 21:08:52,575 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 194 transitions, 1725 flow [2023-12-05 21:08:52,575 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:52,575 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:52,576 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:52,576 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:08:52,576 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-12-05 21:08:52,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:52,576 INFO L85 PathProgramCache]: Analyzing trace with hash 193150881, now seen corresponding path program 1 times [2023-12-05 21:08:52,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:52,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897841146] [2023-12-05 21:08:52,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:52,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:52,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:52,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:52,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897841146] [2023-12-05 21:08:52,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897841146] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:52,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:52,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:52,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805104503] [2023-12-05 21:08:52,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:52,630 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:52,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:52,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:52,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:52,631 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 192 [2023-12-05 21:08:52,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 194 transitions, 1725 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:52,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:52,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 192 [2023-12-05 21:08:52,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:53,562 INFO L124 PetriNetUnfolderBase]: 3185/6793 cut-off events. [2023-12-05 21:08:53,565 INFO L125 PetriNetUnfolderBase]: For 24385/24889 co-relation queries the response was YES. [2023-12-05 21:08:53,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41374 conditions, 6793 events. 3185/6793 cut-off events. For 24385/24889 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 58774 event pairs, 144 based on Foata normal form. 6/5359 useless extension candidates. Maximal degree in co-relation 41240. Up to 4219 conditions per place. [2023-12-05 21:08:53,637 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 110 selfloop transitions, 2 changer transitions 0/213 dead transitions. [2023-12-05 21:08:53,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 213 transitions, 2259 flow [2023-12-05 21:08:53,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:53,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-12-05 21:08:53,638 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6371527777777778 [2023-12-05 21:08:53,638 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-12-05 21:08:53,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-12-05 21:08:53,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:53,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-12-05 21:08:53,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:53,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:53,641 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:53,641 INFO L308 CegarLoopForPetriNet]: 196 programPoint places, -32 predicate places. [2023-12-05 21:08:53,641 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 213 transitions, 2259 flow [2023-12-05 21:08:53,641 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:53,641 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:53,642 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:53,642 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:08:53,642 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-12-05 21:08:53,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:53,642 INFO L85 PathProgramCache]: Analyzing trace with hash -2105470659, now seen corresponding path program 1 times [2023-12-05 21:08:53,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:53,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958623840] [2023-12-05 21:08:53,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:53,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:53,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:53,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958623840] [2023-12-05 21:08:53,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958623840] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:53,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:53,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:53,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170405012] [2023-12-05 21:08:53,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:53,742 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:53,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:53,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:53,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:53,743 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 192 [2023-12-05 21:08:53,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 213 transitions, 2259 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:53,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:53,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 192 [2023-12-05 21:08:53,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:55,000 INFO L124 PetriNetUnfolderBase]: 3127/6727 cut-off events. [2023-12-05 21:08:55,000 INFO L125 PetriNetUnfolderBase]: For 31057/31633 co-relation queries the response was YES. [2023-12-05 21:08:55,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44109 conditions, 6727 events. 3127/6727 cut-off events. For 31057/31633 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 58492 event pairs, 126 based on Foata normal form. 0/5311 useless extension candidates. Maximal degree in co-relation 43972. Up to 4219 conditions per place. [2023-12-05 21:08:55,062 INFO L140 encePairwiseOnDemand]: 188/192 looper letters, 165 selfloop transitions, 12 changer transitions 0/292 dead transitions. [2023-12-05 21:08:55,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 292 transitions, 4041 flow [2023-12-05 21:08:55,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:55,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-12-05 21:08:55,064 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7048611111111112 [2023-12-05 21:08:55,064 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-12-05 21:08:55,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-12-05 21:08:55,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:55,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-12-05 21:08:55,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:55,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:55,066 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:55,067 INFO L308 CegarLoopForPetriNet]: 196 programPoint places, -30 predicate places. [2023-12-05 21:08:55,067 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 292 transitions, 4041 flow [2023-12-05 21:08:55,067 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:55,067 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:55,067 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:55,067 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:08:55,067 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-12-05 21:08:55,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:55,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1594804240, now seen corresponding path program 1 times [2023-12-05 21:08:55,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:55,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430492710] [2023-12-05 21:08:55,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:55,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:55,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:55,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:55,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430492710] [2023-12-05 21:08:55,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430492710] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:55,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:55,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:08:55,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476196558] [2023-12-05 21:08:55,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:55,162 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:08:55,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:55,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:08:55,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:08:55,164 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 192 [2023-12-05 21:08:55,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 292 transitions, 4041 flow. Second operand has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:55,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:55,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 192 [2023-12-05 21:08:55,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:56,323 INFO L124 PetriNetUnfolderBase]: 3110/6698 cut-off events. [2023-12-05 21:08:56,323 INFO L125 PetriNetUnfolderBase]: For 39014/39662 co-relation queries the response was YES. [2023-12-05 21:08:56,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47791 conditions, 6698 events. 3110/6698 cut-off events. For 39014/39662 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 58155 event pairs, 117 based on Foata normal form. 0/5294 useless extension candidates. Maximal degree in co-relation 47643. Up to 4219 conditions per place. [2023-12-05 21:08:56,377 INFO L140 encePairwiseOnDemand]: 182/192 looper letters, 168 selfloop transitions, 34 changer transitions 0/300 dead transitions. [2023-12-05 21:08:56,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 300 transitions, 4557 flow [2023-12-05 21:08:56,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:08:56,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:08:56,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2023-12-05 21:08:56,378 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.62890625 [2023-12-05 21:08:56,378 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2023-12-05 21:08:56,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2023-12-05 21:08:56,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:56,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2023-12-05 21:08:56,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:56,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:56,381 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:56,381 INFO L308 CegarLoopForPetriNet]: 196 programPoint places, -28 predicate places. [2023-12-05 21:08:56,381 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 300 transitions, 4557 flow [2023-12-05 21:08:56,381 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:56,381 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:56,381 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:56,382 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:08:56,382 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-12-05 21:08:56,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:56,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1594804241, now seen corresponding path program 1 times [2023-12-05 21:08:56,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:56,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209883591] [2023-12-05 21:08:56,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:56,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:56,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:56,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:56,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209883591] [2023-12-05 21:08:56,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209883591] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:56,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:56,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:08:56,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637789992] [2023-12-05 21:08:56,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:56,593 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:08:56,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:56,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:08:56,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:08:56,594 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 192 [2023-12-05 21:08:56,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 300 transitions, 4557 flow. Second operand has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:56,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:56,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 192 [2023-12-05 21:08:56,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:57,527 INFO L124 PetriNetUnfolderBase]: 3093/6669 cut-off events. [2023-12-05 21:08:57,527 INFO L125 PetriNetUnfolderBase]: For 48132/48852 co-relation queries the response was YES. [2023-12-05 21:08:57,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50894 conditions, 6669 events. 3093/6669 cut-off events. For 48132/48852 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 58098 event pairs, 108 based on Foata normal form. 0/5277 useless extension candidates. Maximal degree in co-relation 50736. Up to 4219 conditions per place. [2023-12-05 21:08:57,597 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 178 selfloop transitions, 12 changer transitions 0/299 dead transitions. [2023-12-05 21:08:57,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 299 transitions, 4915 flow [2023-12-05 21:08:57,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:08:57,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:08:57,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 484 transitions. [2023-12-05 21:08:57,598 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6302083333333334 [2023-12-05 21:08:57,598 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 484 transitions. [2023-12-05 21:08:57,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 484 transitions. [2023-12-05 21:08:57,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:57,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 484 transitions. [2023-12-05 21:08:57,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:57,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:57,600 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:57,601 INFO L308 CegarLoopForPetriNet]: 196 programPoint places, -26 predicate places. [2023-12-05 21:08:57,601 INFO L500 AbstractCegarLoop]: Abstraction has has 170 places, 299 transitions, 4915 flow [2023-12-05 21:08:57,601 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:57,601 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:57,601 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:57,601 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:08:57,601 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-12-05 21:08:57,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:57,602 INFO L85 PathProgramCache]: Analyzing trace with hash -86230109, now seen corresponding path program 1 times [2023-12-05 21:08:57,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:57,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240699446] [2023-12-05 21:08:57,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:57,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:57,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:57,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240699446] [2023-12-05 21:08:57,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240699446] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:57,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:57,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:08:57,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303159341] [2023-12-05 21:08:57,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:57,733 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:08:57,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:57,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:08:57,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:08:57,734 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 192 [2023-12-05 21:08:57,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 299 transitions, 4915 flow. Second operand has 7 states, 7 states have (on average 103.85714285714286) internal successors, (727), 7 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:57,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:57,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 192 [2023-12-05 21:08:57,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:58,584 INFO L124 PetriNetUnfolderBase]: 2363/5197 cut-off events. [2023-12-05 21:08:58,585 INFO L125 PetriNetUnfolderBase]: For 50988/51780 co-relation queries the response was YES. [2023-12-05 21:08:58,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42890 conditions, 5197 events. 2363/5197 cut-off events. For 50988/51780 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 43513 event pairs, 108 based on Foata normal form. 0/4189 useless extension candidates. Maximal degree in co-relation 42721. Up to 3288 conditions per place. [2023-12-05 21:08:58,638 INFO L140 encePairwiseOnDemand]: 172/192 looper letters, 168 selfloop transitions, 44 changer transitions 0/306 dead transitions. [2023-12-05 21:08:58,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 306 transitions, 5507 flow [2023-12-05 21:08:58,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 21:08:58,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 21:08:58,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 679 transitions. [2023-12-05 21:08:58,640 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5894097222222222 [2023-12-05 21:08:58,640 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 679 transitions. [2023-12-05 21:08:58,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 679 transitions. [2023-12-05 21:08:58,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:58,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 679 transitions. [2023-12-05 21:08:58,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:58,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:58,643 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:58,645 INFO L308 CegarLoopForPetriNet]: 196 programPoint places, -21 predicate places. [2023-12-05 21:08:58,645 INFO L500 AbstractCegarLoop]: Abstraction has has 175 places, 306 transitions, 5507 flow [2023-12-05 21:08:58,646 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 103.85714285714286) internal successors, (727), 7 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:58,646 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:58,646 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:58,646 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:08:58,646 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-12-05 21:08:58,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:58,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1265507820, now seen corresponding path program 1 times [2023-12-05 21:08:58,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:58,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27301657] [2023-12-05 21:08:58,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:58,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:58,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:58,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27301657] [2023-12-05 21:08:58,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27301657] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:58,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:58,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-05 21:08:58,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808645177] [2023-12-05 21:08:58,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:58,928 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-05 21:08:58,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:58,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-05 21:08:58,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-05 21:08:58,930 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 192 [2023-12-05 21:08:58,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 306 transitions, 5507 flow. Second operand has 9 states, 9 states have (on average 101.44444444444444) internal successors, (913), 9 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:58,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:58,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 192 [2023-12-05 21:08:58,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:59,662 INFO L124 PetriNetUnfolderBase]: 1633/3939 cut-off events. [2023-12-05 21:08:59,662 INFO L125 PetriNetUnfolderBase]: For 42331/43195 co-relation queries the response was YES. [2023-12-05 21:08:59,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33486 conditions, 3939 events. 1633/3939 cut-off events. For 42331/43195 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 32183 event pairs, 108 based on Foata normal form. 0/3315 useless extension candidates. Maximal degree in co-relation 33306. Up to 2357 conditions per place. [2023-12-05 21:08:59,700 INFO L140 encePairwiseOnDemand]: 171/192 looper letters, 186 selfloop transitions, 34 changer transitions 0/313 dead transitions. [2023-12-05 21:08:59,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 313 transitions, 6129 flow [2023-12-05 21:08:59,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:08:59,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:08:59,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 872 transitions. [2023-12-05 21:08:59,702 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5677083333333334 [2023-12-05 21:08:59,702 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 872 transitions. [2023-12-05 21:08:59,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 872 transitions. [2023-12-05 21:08:59,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:59,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 872 transitions. [2023-12-05 21:08:59,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:59,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 192.0) internal successors, (1728), 9 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:59,705 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 192.0) internal successors, (1728), 9 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:59,706 INFO L308 CegarLoopForPetriNet]: 196 programPoint places, -14 predicate places. [2023-12-05 21:08:59,706 INFO L500 AbstractCegarLoop]: Abstraction has has 182 places, 313 transitions, 6129 flow [2023-12-05 21:08:59,706 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 101.44444444444444) internal successors, (913), 9 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:59,706 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:59,706 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:59,706 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:08:59,706 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-12-05 21:08:59,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:59,707 INFO L85 PathProgramCache]: Analyzing trace with hash -413586379, now seen corresponding path program 1 times [2023-12-05 21:08:59,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:59,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164521777] [2023-12-05 21:08:59,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:59,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:59,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:59,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:59,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164521777] [2023-12-05 21:08:59,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164521777] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:59,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:59,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-05 21:08:59,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367277606] [2023-12-05 21:08:59,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:59,984 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:08:59,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:59,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:08:59,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:08:59,985 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 192 [2023-12-05 21:08:59,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 313 transitions, 6129 flow. Second operand has 11 states, 11 states have (on average 99.18181818181819) internal successors, (1091), 11 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:59,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:59,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 192 [2023-12-05 21:08:59,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:00,476 INFO L124 PetriNetUnfolderBase]: 739/1818 cut-off events. [2023-12-05 21:09:00,477 INFO L125 PetriNetUnfolderBase]: For 23808/24744 co-relation queries the response was YES. [2023-12-05 21:09:00,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16093 conditions, 1818 events. 739/1818 cut-off events. For 23808/24744 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 10980 event pairs, 36 based on Foata normal form. 0/1770 useless extension candidates. Maximal degree in co-relation 15902. Up to 862 conditions per place. [2023-12-05 21:09:00,487 INFO L140 encePairwiseOnDemand]: 176/192 looper letters, 0 selfloop transitions, 0 changer transitions 283/283 dead transitions. [2023-12-05 21:09:00,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 283 transitions, 5671 flow [2023-12-05 21:09:00,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 21:09:00,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 21:09:00,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 942 transitions. [2023-12-05 21:09:00,489 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5451388888888888 [2023-12-05 21:09:00,489 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 942 transitions. [2023-12-05 21:09:00,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 942 transitions. [2023-12-05 21:09:00,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:00,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 942 transitions. [2023-12-05 21:09:00,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 104.66666666666667) internal successors, (942), 9 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:00,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 192.0) internal successors, (1920), 10 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:00,493 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 192.0) internal successors, (1920), 10 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:00,494 INFO L308 CegarLoopForPetriNet]: 196 programPoint places, -14 predicate places. [2023-12-05 21:09:00,494 INFO L500 AbstractCegarLoop]: Abstraction has has 182 places, 283 transitions, 5671 flow [2023-12-05 21:09:00,494 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 99.18181818181819) internal successors, (1091), 11 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:00,507 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe001_rmo.oepc.i_BEv2_AllErrorsAtOnce [2023-12-05 21:09:00,547 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 99 remaining) [2023-12-05 21:09:00,548 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 99 remaining) [2023-12-05 21:09:00,549 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 99 remaining) [2023-12-05 21:09:00,550 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 99 remaining) [2023-12-05 21:09:00,550 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 99 remaining) [2023-12-05 21:09:00,550 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 99 remaining) [2023-12-05 21:09:00,550 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 99 remaining) [2023-12-05 21:09:00,551 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 99 remaining) [2023-12-05 21:09:00,551 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 99 remaining) [2023-12-05 21:09:00,551 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 99 remaining) [2023-12-05 21:09:00,551 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 99 remaining) [2023-12-05 21:09:00,551 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 99 remaining) [2023-12-05 21:09:00,551 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 99 remaining) [2023-12-05 21:09:00,551 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 99 remaining) [2023-12-05 21:09:00,551 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 99 remaining) [2023-12-05 21:09:00,551 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 99 remaining) [2023-12-05 21:09:00,551 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 99 remaining) [2023-12-05 21:09:00,552 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 99 remaining) [2023-12-05 21:09:00,552 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 99 remaining) [2023-12-05 21:09:00,552 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 99 remaining) [2023-12-05 21:09:00,552 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 99 remaining) [2023-12-05 21:09:00,552 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 99 remaining) [2023-12-05 21:09:00,552 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 99 remaining) [2023-12-05 21:09:00,552 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 99 remaining) [2023-12-05 21:09:00,552 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 99 remaining) [2023-12-05 21:09:00,553 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 99 remaining) [2023-12-05 21:09:00,553 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 99 remaining) [2023-12-05 21:09:00,553 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 99 remaining) [2023-12-05 21:09:00,553 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 99 remaining) [2023-12-05 21:09:00,553 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 99 remaining) [2023-12-05 21:09:00,553 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 99 remaining) [2023-12-05 21:09:00,554 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 99 remaining) [2023-12-05 21:09:00,554 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 99 remaining) [2023-12-05 21:09:00,554 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 99 remaining) [2023-12-05 21:09:00,554 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 99 remaining) [2023-12-05 21:09:00,554 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 99 remaining) [2023-12-05 21:09:00,554 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 99 remaining) [2023-12-05 21:09:00,554 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 99 remaining) [2023-12-05 21:09:00,554 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 99 remaining) [2023-12-05 21:09:00,554 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 99 remaining) [2023-12-05 21:09:00,554 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 99 remaining) [2023-12-05 21:09:00,554 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 99 remaining) [2023-12-05 21:09:00,555 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 99 remaining) [2023-12-05 21:09:00,555 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 99 remaining) [2023-12-05 21:09:00,555 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 99 remaining) [2023-12-05 21:09:00,555 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 99 remaining) [2023-12-05 21:09:00,555 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 99 remaining) [2023-12-05 21:09:00,555 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 99 remaining) [2023-12-05 21:09:00,555 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 99 remaining) [2023-12-05 21:09:00,555 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 99 remaining) [2023-12-05 21:09:00,555 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 99 remaining) [2023-12-05 21:09:00,555 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 99 remaining) [2023-12-05 21:09:00,555 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 99 remaining) [2023-12-05 21:09:00,556 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 99 remaining) [2023-12-05 21:09:00,556 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 99 remaining) [2023-12-05 21:09:00,556 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 99 remaining) [2023-12-05 21:09:00,556 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 99 remaining) [2023-12-05 21:09:00,556 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 99 remaining) [2023-12-05 21:09:00,556 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 99 remaining) [2023-12-05 21:09:00,556 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 99 remaining) [2023-12-05 21:09:00,556 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 99 remaining) [2023-12-05 21:09:00,556 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 99 remaining) [2023-12-05 21:09:00,556 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 99 remaining) [2023-12-05 21:09:00,556 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 99 remaining) [2023-12-05 21:09:00,557 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 99 remaining) [2023-12-05 21:09:00,557 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 99 remaining) [2023-12-05 21:09:00,557 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 99 remaining) [2023-12-05 21:09:00,557 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 99 remaining) [2023-12-05 21:09:00,557 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 99 remaining) [2023-12-05 21:09:00,557 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 99 remaining) [2023-12-05 21:09:00,557 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 99 remaining) [2023-12-05 21:09:00,557 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 99 remaining) [2023-12-05 21:09:00,557 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 99 remaining) [2023-12-05 21:09:00,557 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 99 remaining) [2023-12-05 21:09:00,557 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 99 remaining) [2023-12-05 21:09:00,557 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 99 remaining) [2023-12-05 21:09:00,557 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 99 remaining) [2023-12-05 21:09:00,557 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 99 remaining) [2023-12-05 21:09:00,558 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 99 remaining) [2023-12-05 21:09:00,558 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 99 remaining) [2023-12-05 21:09:00,558 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 99 remaining) [2023-12-05 21:09:00,558 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 99 remaining) [2023-12-05 21:09:00,558 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 99 remaining) [2023-12-05 21:09:00,558 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 99 remaining) [2023-12-05 21:09:00,558 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 99 remaining) [2023-12-05 21:09:00,558 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 99 remaining) [2023-12-05 21:09:00,558 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 99 remaining) [2023-12-05 21:09:00,558 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 99 remaining) [2023-12-05 21:09:00,559 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 99 remaining) [2023-12-05 21:09:00,559 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 99 remaining) [2023-12-05 21:09:00,559 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 99 remaining) [2023-12-05 21:09:00,559 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 99 remaining) [2023-12-05 21:09:00,559 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 99 remaining) [2023-12-05 21:09:00,559 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 99 remaining) [2023-12-05 21:09:00,560 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 99 remaining) [2023-12-05 21:09:00,561 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 99 remaining) [2023-12-05 21:09:00,561 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 99 remaining) [2023-12-05 21:09:00,561 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 99 remaining) [2023-12-05 21:09:00,561 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 99 remaining) [2023-12-05 21:09:00,561 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:09:00,562 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:00,566 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:09:00,566 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:09:00,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:09:00 BasicIcfg [2023-12-05 21:09:00,573 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:09:00,574 INFO L158 Benchmark]: Toolchain (without parser) took 26102.87ms. Allocated memory was 305.1MB in the beginning and 5.1GB in the end (delta: 4.8GB). Free memory was 250.9MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2023-12-05 21:09:00,574 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 226.5MB. Free memory was 175.8MB in the beginning and 175.6MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:09:00,574 INFO L158 Benchmark]: CACSL2BoogieTranslator took 471.41ms. Allocated memory is still 305.1MB. Free memory was 250.5MB in the beginning and 224.6MB in the end (delta: 25.8MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-12-05 21:09:00,574 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.77ms. Allocated memory is still 305.1MB. Free memory was 224.6MB in the beginning and 221.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:09:00,574 INFO L158 Benchmark]: Boogie Preprocessor took 50.29ms. Allocated memory is still 305.1MB. Free memory was 221.9MB in the beginning and 219.4MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-05 21:09:00,575 INFO L158 Benchmark]: RCFGBuilder took 1107.46ms. Allocated memory is still 305.1MB. Free memory was 219.4MB in the beginning and 255.1MB in the end (delta: -35.7MB). Peak memory consumption was 78.5MB. Max. memory is 8.0GB. [2023-12-05 21:09:00,575 INFO L158 Benchmark]: TraceAbstraction took 24416.10ms. Allocated memory was 305.1MB in the beginning and 5.1GB in the end (delta: 4.8GB). Free memory was 254.6MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2023-12-05 21:09:00,575 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 226.5MB. Free memory was 175.8MB in the beginning and 175.6MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 471.41ms. Allocated memory is still 305.1MB. Free memory was 250.5MB in the beginning and 224.6MB in the end (delta: 25.8MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.77ms. Allocated memory is still 305.1MB. Free memory was 224.6MB in the beginning and 221.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.29ms. Allocated memory is still 305.1MB. Free memory was 221.9MB in the beginning and 219.4MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1107.46ms. Allocated memory is still 305.1MB. Free memory was 219.4MB in the beginning and 255.1MB in the end (delta: -35.7MB). Peak memory consumption was 78.5MB. Max. memory is 8.0GB. * TraceAbstraction took 24416.10ms. Allocated memory was 305.1MB in the beginning and 5.1GB in the end (delta: 4.8GB). Free memory was 254.6MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 253 locations, 99 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: 24.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 660 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 660 mSDsluCounter, 174 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 191 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1201 IncrementalHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 191 mSolverCounterUnsat, 139 mSDtfsCounter, 1201 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6129occurred in iteration=13, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1028 NumberOfCodeBlocks, 1028 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1014 ConstructedInterpolants, 0 QuantifiedInterpolants, 4203 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 - AllSpecificationsHoldResult: All specifications hold 60 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:09:00,596 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...