/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/safe027_rmo.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:10:25,338 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:10:25,405 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:10:25,430 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:10:25,431 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:10:25,431 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:10:25,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:10:25,432 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:10:25,432 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:10:25,435 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:10:25,435 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:10:25,436 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:10:25,436 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:10:25,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:10:25,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:10:25,437 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:10:25,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:10:25,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:10:25,437 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:10:25,438 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:10:25,438 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:10:25,438 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:10:25,438 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:10:25,439 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:10:25,439 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:10:25,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:10:25,439 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:10:25,439 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:10:25,439 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:10:25,440 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:10:25,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:10:25,441 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:10:25,441 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:10:25,441 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:10:25,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:10:25,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:10:25,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:10:25,678 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:10:25,678 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:10:25,679 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe027_rmo.i [2023-12-05 21:10:26,654 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:10:26,815 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:10:26,816 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe027_rmo.i [2023-12-05 21:10:26,825 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb3c1f113/e295a1f3d8594b8e949c0a6cb1e48022/FLAG09c149fee [2023-12-05 21:10:26,836 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb3c1f113/e295a1f3d8594b8e949c0a6cb1e48022 [2023-12-05 21:10:26,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:10:26,839 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:10:26,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:10:26,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:10:26,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:10:26,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:10:26" (1/1) ... [2023-12-05 21:10:26,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74d9a6db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:26, skipping insertion in model container [2023-12-05 21:10:26,843 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:10:26" (1/1) ... [2023-12-05 21:10:26,878 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:10:27,171 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:10:27,188 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:10:27,248 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:10:27,288 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:10:27,288 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:10:27,295 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:10:27,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:27 WrapperNode [2023-12-05 21:10:27,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:10:27,297 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:10:27,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:10:27,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:10:27,302 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:10:27" (1/1) ... [2023-12-05 21:10:27,326 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:10:27" (1/1) ... [2023-12-05 21:10:27,346 INFO L138 Inliner]: procedures = 177, calls = 83, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 155 [2023-12-05 21:10:27,347 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:10:27,347 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:10:27,347 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:10:27,347 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:10:27,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:27" (1/1) ... [2023-12-05 21:10:27,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:27" (1/1) ... [2023-12-05 21:10:27,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:27" (1/1) ... [2023-12-05 21:10:27,360 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:27" (1/1) ... [2023-12-05 21:10:27,367 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:27" (1/1) ... [2023-12-05 21:10:27,368 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:27" (1/1) ... [2023-12-05 21:10:27,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:27" (1/1) ... [2023-12-05 21:10:27,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:27" (1/1) ... [2023-12-05 21:10:27,374 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:10:27,374 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:10:27,375 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:10:27,375 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:10:27,375 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:27" (1/1) ... [2023-12-05 21:10:27,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:10:27,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:10:27,436 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:10:27,442 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:10:27,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:10:27,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:10:27,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:10:27,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:10:27,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:10:27,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:10:27,459 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-05 21:10:27,459 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-05 21:10:27,460 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-05 21:10:27,460 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-05 21:10:27,460 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-05 21:10:27,460 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-05 21:10:27,460 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-12-05 21:10:27,460 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-12-05 21:10:27,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:10:27,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:10:27,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:10:27,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:10:27,462 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:10:27,617 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:10:27,624 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:10:28,030 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:10:28,289 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:10:28,289 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:10:28,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:10:28 BoogieIcfgContainer [2023-12-05 21:10:28,290 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:10:28,292 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:10:28,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:10:28,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:10:28,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:10:26" (1/3) ... [2023-12-05 21:10:28,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a750144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:10:28, skipping insertion in model container [2023-12-05 21:10:28,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:27" (2/3) ... [2023-12-05 21:10:28,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a750144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:10:28, skipping insertion in model container [2023-12-05 21:10:28,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:10:28" (3/3) ... [2023-12-05 21:10:28,296 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_rmo.i [2023-12-05 21:10:28,309 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:10:28,310 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2023-12-05 21:10:28,310 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:10:28,420 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:10:28,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 197 transitions, 410 flow [2023-12-05 21:10:28,530 INFO L124 PetriNetUnfolderBase]: 3/193 cut-off events. [2023-12-05 21:10:28,530 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:10:28,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 193 events. 3/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 291 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2023-12-05 21:10:28,536 INFO L82 GeneralOperation]: Start removeDead. Operand has 207 places, 197 transitions, 410 flow [2023-12-05 21:10:28,550 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 203 places, 193 transitions, 398 flow [2023-12-05 21:10:28,562 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:10:28,567 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;@3231888d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:10:28,567 INFO L363 AbstractCegarLoop]: Starting to check reachability of 78 error locations. [2023-12-05 21:10:28,582 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:10:28,582 INFO L124 PetriNetUnfolderBase]: 0/62 cut-off events. [2023-12-05 21:10:28,582 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:10:28,582 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:28,583 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] [2023-12-05 21:10:28,583 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:28,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:28,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1313002936, now seen corresponding path program 1 times [2023-12-05 21:10:28,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:28,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563017067] [2023-12-05 21:10:28,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:28,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:28,934 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:10:28,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:28,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563017067] [2023-12-05 21:10:28,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563017067] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:28,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:28,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:28,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297655197] [2023-12-05 21:10:28,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:28,945 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:28,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:28,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:28,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:28,972 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 197 [2023-12-05 21:10:28,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 193 transitions, 398 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 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:10:28,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:28,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 197 [2023-12-05 21:10:28,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:30,703 INFO L124 PetriNetUnfolderBase]: 5137/10242 cut-off events. [2023-12-05 21:10:30,704 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-12-05 21:10:30,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17699 conditions, 10242 events. 5137/10242 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 795. Compared 87339 event pairs, 3073 based on Foata normal form. 304/5686 useless extension candidates. Maximal degree in co-relation 17618. Up to 4468 conditions per place. [2023-12-05 21:10:30,797 INFO L140 encePairwiseOnDemand]: 171/197 looper letters, 61 selfloop transitions, 2 changer transitions 0/180 dead transitions. [2023-12-05 21:10:30,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 180 transitions, 498 flow [2023-12-05 21:10:30,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:30,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:30,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 476 transitions. [2023-12-05 21:10:30,807 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.805414551607445 [2023-12-05 21:10:30,808 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 476 transitions. [2023-12-05 21:10:30,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 476 transitions. [2023-12-05 21:10:30,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:30,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 476 transitions. [2023-12-05 21:10:30,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 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:10:30,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:10:30,820 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:10:30,823 INFO L308 CegarLoopForPetriNet]: 203 programPoint places, -22 predicate places. [2023-12-05 21:10:30,824 INFO L500 AbstractCegarLoop]: Abstraction has has 181 places, 180 transitions, 498 flow [2023-12-05 21:10:30,824 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 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:10:30,825 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:30,825 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] [2023-12-05 21:10:30,825 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:10:30,825 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:30,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:30,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1313002935, now seen corresponding path program 1 times [2023-12-05 21:10:30,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:30,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632313980] [2023-12-05 21:10:30,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:30,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:30,955 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:10:30,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:30,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632313980] [2023-12-05 21:10:30,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632313980] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:30,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:30,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:30,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411128740] [2023-12-05 21:10:30,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:30,957 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:30,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:30,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:30,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:30,959 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 197 [2023-12-05 21:10:30,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 180 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 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:10:30,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:30,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 197 [2023-12-05 21:10:30,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:32,474 INFO L124 PetriNetUnfolderBase]: 5167/10307 cut-off events. [2023-12-05 21:10:32,474 INFO L125 PetriNetUnfolderBase]: For 820/1984 co-relation queries the response was YES. [2023-12-05 21:10:32,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24791 conditions, 10307 events. 5167/10307 cut-off events. For 820/1984 co-relation queries the response was YES. Maximal size of possible extension queue 795. Compared 87957 event pairs, 3103 based on Foata normal form. 0/5446 useless extension candidates. Maximal degree in co-relation 24704. Up to 4985 conditions per place. [2023-12-05 21:10:32,555 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 70 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2023-12-05 21:10:32,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 193 transitions, 694 flow [2023-12-05 21:10:32,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:32,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:32,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2023-12-05 21:10:32,557 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7445008460236887 [2023-12-05 21:10:32,558 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2023-12-05 21:10:32,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2023-12-05 21:10:32,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:32,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2023-12-05 21:10:32,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 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:10:32,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:10:32,560 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:10:32,561 INFO L308 CegarLoopForPetriNet]: 203 programPoint places, -21 predicate places. [2023-12-05 21:10:32,561 INFO L500 AbstractCegarLoop]: Abstraction has has 182 places, 193 transitions, 694 flow [2023-12-05 21:10:32,561 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 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:10:32,561 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:32,562 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] [2023-12-05 21:10:32,562 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:10:32,562 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:32,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:32,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1402486417, now seen corresponding path program 1 times [2023-12-05 21:10:32,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:32,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450386239] [2023-12-05 21:10:32,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:32,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:32,675 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:10:32,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:32,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450386239] [2023-12-05 21:10:32,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450386239] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:32,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:32,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:10:32,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284619112] [2023-12-05 21:10:32,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:32,676 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:10:32,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:32,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:10:32,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:10:32,678 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 197 [2023-12-05 21:10:32,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 193 transitions, 694 flow. Second operand has 6 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:32,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:32,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 197 [2023-12-05 21:10:32,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:33,905 INFO L124 PetriNetUnfolderBase]: 3597/8393 cut-off events. [2023-12-05 21:10:33,905 INFO L125 PetriNetUnfolderBase]: For 1656/2446 co-relation queries the response was YES. [2023-12-05 21:10:33,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24205 conditions, 8393 events. 3597/8393 cut-off events. For 1656/2446 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 77745 event pairs, 876 based on Foata normal form. 0/5653 useless extension candidates. Maximal degree in co-relation 24107. Up to 4215 conditions per place. [2023-12-05 21:10:33,969 INFO L140 encePairwiseOnDemand]: 179/197 looper letters, 78 selfloop transitions, 16 changer transitions 0/209 dead transitions. [2023-12-05 21:10:33,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 209 transitions, 972 flow [2023-12-05 21:10:33,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:10:33,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:10:33,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 958 transitions. [2023-12-05 21:10:33,971 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6947063089195069 [2023-12-05 21:10:33,971 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 958 transitions. [2023-12-05 21:10:33,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 958 transitions. [2023-12-05 21:10:33,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:33,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 958 transitions. [2023-12-05 21:10:33,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.85714285714286) internal successors, (958), 7 states have internal predecessors, (958), 0 states have call successors, (0), 0 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:10:33,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 0 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:10:33,976 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 0 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:10:33,977 INFO L308 CegarLoopForPetriNet]: 203 programPoint places, -17 predicate places. [2023-12-05 21:10:33,977 INFO L500 AbstractCegarLoop]: Abstraction has has 186 places, 209 transitions, 972 flow [2023-12-05 21:10:33,977 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:33,977 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:33,977 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] [2023-12-05 21:10:33,978 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:10:33,978 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:33,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:33,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1402486416, now seen corresponding path program 1 times [2023-12-05 21:10:33,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:33,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811749069] [2023-12-05 21:10:33,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:33,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:34,116 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:10:34,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:34,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811749069] [2023-12-05 21:10:34,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811749069] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:34,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:34,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:10:34,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247796410] [2023-12-05 21:10:34,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:34,118 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:10:34,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:34,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:10:34,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:10:34,119 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 197 [2023-12-05 21:10:34,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 209 transitions, 972 flow. Second operand has 6 states, 6 states have (on average 119.83333333333333) internal successors, (719), 6 states have internal predecessors, (719), 0 states have call successors, (0), 0 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:10:34,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:34,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 197 [2023-12-05 21:10:34,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:34,507 INFO L124 PetriNetUnfolderBase]: 717/2063 cut-off events. [2023-12-05 21:10:34,507 INFO L125 PetriNetUnfolderBase]: For 731/1247 co-relation queries the response was YES. [2023-12-05 21:10:34,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6814 conditions, 2063 events. 717/2063 cut-off events. For 731/1247 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 14963 event pairs, 329 based on Foata normal form. 0/1733 useless extension candidates. Maximal degree in co-relation 6705. Up to 1018 conditions per place. [2023-12-05 21:10:34,520 INFO L140 encePairwiseOnDemand]: 180/197 looper letters, 66 selfloop transitions, 7 changer transitions 0/185 dead transitions. [2023-12-05 21:10:34,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 185 transitions, 926 flow [2023-12-05 21:10:34,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 21:10:34,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 21:10:34,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 787 transitions. [2023-12-05 21:10:34,522 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6658206429780034 [2023-12-05 21:10:34,522 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 787 transitions. [2023-12-05 21:10:34,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 787 transitions. [2023-12-05 21:10:34,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:34,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 787 transitions. [2023-12-05 21:10:34,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.16666666666666) internal successors, (787), 6 states have internal predecessors, (787), 0 states have call successors, (0), 0 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:10:34,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 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:10:34,526 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 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:10:34,527 INFO L308 CegarLoopForPetriNet]: 203 programPoint places, -19 predicate places. [2023-12-05 21:10:34,527 INFO L500 AbstractCegarLoop]: Abstraction has has 184 places, 185 transitions, 926 flow [2023-12-05 21:10:34,527 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.83333333333333) internal successors, (719), 6 states have internal predecessors, (719), 0 states have call successors, (0), 0 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:10:34,527 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:34,527 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] [2023-12-05 21:10:34,527 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:10:34,528 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:34,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:34,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1581866601, now seen corresponding path program 1 times [2023-12-05 21:10:34,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:34,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941599762] [2023-12-05 21:10:34,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:34,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:34,587 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:10:34,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:34,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941599762] [2023-12-05 21:10:34,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941599762] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:34,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:34,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:34,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248298258] [2023-12-05 21:10:34,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:34,588 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:34,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:34,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:34,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:34,589 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 197 [2023-12-05 21:10:34,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 185 transitions, 926 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 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:10:34,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:34,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 197 [2023-12-05 21:10:34,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:35,027 INFO L124 PetriNetUnfolderBase]: 867/2523 cut-off events. [2023-12-05 21:10:35,027 INFO L125 PetriNetUnfolderBase]: For 3054/3430 co-relation queries the response was YES. [2023-12-05 21:10:35,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9123 conditions, 2523 events. 867/2523 cut-off events. For 3054/3430 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 19884 event pairs, 91 based on Foata normal form. 2/2160 useless extension candidates. Maximal degree in co-relation 9006. Up to 1169 conditions per place. [2023-12-05 21:10:35,044 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 73 selfloop transitions, 2 changer transitions 0/198 dead transitions. [2023-12-05 21:10:35,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 198 transitions, 1210 flow [2023-12-05 21:10:35,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:35,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:35,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2023-12-05 21:10:35,046 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7208121827411168 [2023-12-05 21:10:35,046 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2023-12-05 21:10:35,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2023-12-05 21:10:35,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:35,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2023-12-05 21:10:35,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 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:10:35,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:10:35,048 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:10:35,049 INFO L308 CegarLoopForPetriNet]: 203 programPoint places, -18 predicate places. [2023-12-05 21:10:35,049 INFO L500 AbstractCegarLoop]: Abstraction has has 185 places, 198 transitions, 1210 flow [2023-12-05 21:10:35,049 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 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:10:35,049 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:35,049 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] [2023-12-05 21:10:35,050 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:10:35,050 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:35,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:35,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1581866600, now seen corresponding path program 1 times [2023-12-05 21:10:35,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:35,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755554350] [2023-12-05 21:10:35,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:35,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:35,120 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:10:35,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:35,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755554350] [2023-12-05 21:10:35,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755554350] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:35,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:35,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:35,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364198946] [2023-12-05 21:10:35,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:35,121 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:35,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:35,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:35,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:35,122 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 197 [2023-12-05 21:10:35,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 198 transitions, 1210 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:35,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:35,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 197 [2023-12-05 21:10:35,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:35,565 INFO L124 PetriNetUnfolderBase]: 866/2528 cut-off events. [2023-12-05 21:10:35,565 INFO L125 PetriNetUnfolderBase]: For 4005/4517 co-relation queries the response was YES. [2023-12-05 21:10:35,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10562 conditions, 2528 events. 866/2528 cut-off events. For 4005/4517 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 19949 event pairs, 91 based on Foata normal form. 2/2165 useless extension candidates. Maximal degree in co-relation 10436. Up to 1242 conditions per place. [2023-12-05 21:10:35,589 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 78 selfloop transitions, 2 changer transitions 0/197 dead transitions. [2023-12-05 21:10:35,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 197 transitions, 1360 flow [2023-12-05 21:10:35,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:35,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:35,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-12-05 21:10:35,591 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6971235194585449 [2023-12-05 21:10:35,591 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-12-05 21:10:35,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-12-05 21:10:35,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:35,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-12-05 21:10:35,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:10:35,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:10:35,593 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:10:35,594 INFO L308 CegarLoopForPetriNet]: 203 programPoint places, -17 predicate places. [2023-12-05 21:10:35,594 INFO L500 AbstractCegarLoop]: Abstraction has has 186 places, 197 transitions, 1360 flow [2023-12-05 21:10:35,594 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:35,594 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:35,594 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] [2023-12-05 21:10:35,594 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:10:35,594 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:35,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:35,595 INFO L85 PathProgramCache]: Analyzing trace with hash -524161302, now seen corresponding path program 1 times [2023-12-05 21:10:35,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:35,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612656581] [2023-12-05 21:10:35,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:35,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:35,636 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:10:35,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:35,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612656581] [2023-12-05 21:10:35,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612656581] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:35,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:35,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:35,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521475559] [2023-12-05 21:10:35,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:35,638 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:35,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:35,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:35,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:35,639 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 197 [2023-12-05 21:10:35,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 197 transitions, 1360 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:35,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:35,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 197 [2023-12-05 21:10:35,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:36,113 INFO L124 PetriNetUnfolderBase]: 1016/2741 cut-off events. [2023-12-05 21:10:36,113 INFO L125 PetriNetUnfolderBase]: For 7612/8260 co-relation queries the response was YES. [2023-12-05 21:10:36,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13264 conditions, 2741 events. 1016/2741 cut-off events. For 7612/8260 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 21413 event pairs, 129 based on Foata normal form. 2/2315 useless extension candidates. Maximal degree in co-relation 13129. Up to 1402 conditions per place. [2023-12-05 21:10:36,136 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 79 selfloop transitions, 2 changer transitions 0/197 dead transitions. [2023-12-05 21:10:36,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 197 transitions, 1526 flow [2023-12-05 21:10:36,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:36,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:36,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-12-05 21:10:36,138 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6971235194585449 [2023-12-05 21:10:36,138 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-12-05 21:10:36,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-12-05 21:10:36,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:36,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-12-05 21:10:36,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:10:36,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:10:36,140 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:10:36,141 INFO L308 CegarLoopForPetriNet]: 203 programPoint places, -16 predicate places. [2023-12-05 21:10:36,141 INFO L500 AbstractCegarLoop]: Abstraction has has 187 places, 197 transitions, 1526 flow [2023-12-05 21:10:36,141 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:36,141 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:36,141 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] [2023-12-05 21:10:36,141 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:10:36,142 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:36,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:36,142 INFO L85 PathProgramCache]: Analyzing trace with hash -524161301, now seen corresponding path program 1 times [2023-12-05 21:10:36,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:36,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420776157] [2023-12-05 21:10:36,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:36,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:36,202 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:10:36,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:36,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420776157] [2023-12-05 21:10:36,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420776157] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:36,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:36,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:36,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65767141] [2023-12-05 21:10:36,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:36,203 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:36,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:36,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:36,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:36,204 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 197 [2023-12-05 21:10:36,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 197 transitions, 1526 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 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:10:36,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:36,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 197 [2023-12-05 21:10:36,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:36,622 INFO L124 PetriNetUnfolderBase]: 1015/2703 cut-off events. [2023-12-05 21:10:36,623 INFO L125 PetriNetUnfolderBase]: For 10140/10924 co-relation queries the response was YES. [2023-12-05 21:10:36,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14677 conditions, 2703 events. 1015/2703 cut-off events. For 10140/10924 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 20899 event pairs, 91 based on Foata normal form. 2/2277 useless extension candidates. Maximal degree in co-relation 14534. Up to 1402 conditions per place. [2023-12-05 21:10:36,652 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 85 selfloop transitions, 2 changer transitions 0/209 dead transitions. [2023-12-05 21:10:36,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 209 transitions, 1898 flow [2023-12-05 21:10:36,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:36,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:36,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-12-05 21:10:36,653 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7174280879864636 [2023-12-05 21:10:36,654 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-12-05 21:10:36,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-12-05 21:10:36,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:36,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-12-05 21:10:36,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:36,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:10:36,656 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:10:36,672 INFO L308 CegarLoopForPetriNet]: 203 programPoint places, -15 predicate places. [2023-12-05 21:10:36,673 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 209 transitions, 1898 flow [2023-12-05 21:10:36,673 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 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:10:36,673 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:36,673 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] [2023-12-05 21:10:36,673 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:10:36,673 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:36,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:36,674 INFO L85 PathProgramCache]: Analyzing trace with hash -208311126, now seen corresponding path program 1 times [2023-12-05 21:10:36,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:36,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553001842] [2023-12-05 21:10:36,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:36,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:36,742 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:10:36,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:36,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553001842] [2023-12-05 21:10:36,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553001842] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:36,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:36,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:36,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713396612] [2023-12-05 21:10:36,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:36,743 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:36,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:36,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:36,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:36,744 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 197 [2023-12-05 21:10:36,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 209 transitions, 1898 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 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:10:36,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:36,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 197 [2023-12-05 21:10:36,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:37,287 INFO L124 PetriNetUnfolderBase]: 1162/2812 cut-off events. [2023-12-05 21:10:37,287 INFO L125 PetriNetUnfolderBase]: For 16324/16516 co-relation queries the response was YES. [2023-12-05 21:10:37,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17559 conditions, 2812 events. 1162/2812 cut-off events. For 16324/16516 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 21497 event pairs, 53 based on Foata normal form. 4/2327 useless extension candidates. Maximal degree in co-relation 17408. Up to 1553 conditions per place. [2023-12-05 21:10:37,320 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 100 selfloop transitions, 2 changer transitions 0/223 dead transitions. [2023-12-05 21:10:37,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 223 transitions, 2362 flow [2023-12-05 21:10:37,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:37,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:37,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-12-05 21:10:37,322 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7174280879864636 [2023-12-05 21:10:37,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-12-05 21:10:37,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-12-05 21:10:37,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:37,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-12-05 21:10:37,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:37,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:10:37,324 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:10:37,325 INFO L308 CegarLoopForPetriNet]: 203 programPoint places, -14 predicate places. [2023-12-05 21:10:37,325 INFO L500 AbstractCegarLoop]: Abstraction has has 189 places, 223 transitions, 2362 flow [2023-12-05 21:10:37,325 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 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:10:37,325 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:37,325 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] [2023-12-05 21:10:37,325 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:10:37,326 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:37,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:37,326 INFO L85 PathProgramCache]: Analyzing trace with hash -208311127, now seen corresponding path program 1 times [2023-12-05 21:10:37,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:37,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322073772] [2023-12-05 21:10:37,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:37,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:37,373 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:10:37,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:37,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322073772] [2023-12-05 21:10:37,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322073772] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:37,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:37,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:37,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663825885] [2023-12-05 21:10:37,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:37,374 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:37,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:37,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:37,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:37,375 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 197 [2023-12-05 21:10:37,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 223 transitions, 2362 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 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:10:37,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:37,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 197 [2023-12-05 21:10:37,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:37,959 INFO L124 PetriNetUnfolderBase]: 1158/2817 cut-off events. [2023-12-05 21:10:37,959 INFO L125 PetriNetUnfolderBase]: For 19785/20001 co-relation queries the response was YES. [2023-12-05 21:10:37,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19237 conditions, 2817 events. 1158/2817 cut-off events. For 19785/20001 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 21669 event pairs, 53 based on Foata normal form. 4/2332 useless extension candidates. Maximal degree in co-relation 19077. Up to 1565 conditions per place. [2023-12-05 21:10:37,992 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 105 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2023-12-05 21:10:37,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 222 transitions, 2562 flow [2023-12-05 21:10:37,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:37,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:37,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-12-05 21:10:37,994 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6937394247038917 [2023-12-05 21:10:37,994 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-12-05 21:10:37,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-12-05 21:10:37,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:37,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-12-05 21:10:37,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 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:10:37,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:10:37,998 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:10:37,998 INFO L308 CegarLoopForPetriNet]: 203 programPoint places, -13 predicate places. [2023-12-05 21:10:37,999 INFO L500 AbstractCegarLoop]: Abstraction has has 190 places, 222 transitions, 2562 flow [2023-12-05 21:10:37,999 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 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:10:37,999 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:37,999 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] [2023-12-05 21:10:38,000 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:10:38,000 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:38,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:38,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2111790254, now seen corresponding path program 1 times [2023-12-05 21:10:38,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:38,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588867881] [2023-12-05 21:10:38,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:38,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:38,107 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:10:38,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:38,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588867881] [2023-12-05 21:10:38,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588867881] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:38,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:38,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:38,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445547751] [2023-12-05 21:10:38,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:38,108 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:38,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:38,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:38,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:38,109 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 197 [2023-12-05 21:10:38,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 222 transitions, 2562 flow. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 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:10:38,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:38,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 197 [2023-12-05 21:10:38,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:38,607 INFO L124 PetriNetUnfolderBase]: 1132/2776 cut-off events. [2023-12-05 21:10:38,607 INFO L125 PetriNetUnfolderBase]: For 23383/23623 co-relation queries the response was YES. [2023-12-05 21:10:38,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20086 conditions, 2776 events. 1132/2776 cut-off events. For 23383/23623 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 21304 event pairs, 45 based on Foata normal form. 0/2299 useless extension candidates. Maximal degree in co-relation 19923. Up to 1565 conditions per place. [2023-12-05 21:10:38,634 INFO L140 encePairwiseOnDemand]: 193/197 looper letters, 129 selfloop transitions, 17 changer transitions 0/283 dead transitions. [2023-12-05 21:10:38,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 283 transitions, 4205 flow [2023-12-05 21:10:38,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:38,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:38,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2023-12-05 21:10:38,636 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7952622673434856 [2023-12-05 21:10:38,636 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 470 transitions. [2023-12-05 21:10:38,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 470 transitions. [2023-12-05 21:10:38,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:38,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 470 transitions. [2023-12-05 21:10:38,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 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:10:38,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:10:38,638 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:10:38,639 INFO L308 CegarLoopForPetriNet]: 203 programPoint places, -11 predicate places. [2023-12-05 21:10:38,639 INFO L500 AbstractCegarLoop]: Abstraction has has 192 places, 283 transitions, 4205 flow [2023-12-05 21:10:38,639 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 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:10:38,639 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:38,639 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, 1] [2023-12-05 21:10:38,639 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:10:38,639 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:38,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:38,639 INFO L85 PathProgramCache]: Analyzing trace with hash 905283643, now seen corresponding path program 1 times [2023-12-05 21:10:38,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:38,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267901339] [2023-12-05 21:10:38,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:38,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:38,805 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:10:38,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:38,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267901339] [2023-12-05 21:10:38,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267901339] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:38,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:38,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:10:38,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113308914] [2023-12-05 21:10:38,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:38,806 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:10:38,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:38,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:10:38,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:10:38,807 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 197 [2023-12-05 21:10:38,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 283 transitions, 4205 flow. Second operand has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 0 states have call successors, (0), 0 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:10:38,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:38,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 197 [2023-12-05 21:10:38,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:39,324 INFO L124 PetriNetUnfolderBase]: 1125/2767 cut-off events. [2023-12-05 21:10:39,324 INFO L125 PetriNetUnfolderBase]: For 27470/27734 co-relation queries the response was YES. [2023-12-05 21:10:39,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21214 conditions, 2767 events. 1125/2767 cut-off events. For 27470/27734 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 21378 event pairs, 41 based on Foata normal form. 0/2296 useless extension candidates. Maximal degree in co-relation 21041. Up to 1565 conditions per place. [2023-12-05 21:10:39,354 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 147 selfloop transitions, 17 changer transitions 0/288 dead transitions. [2023-12-05 21:10:39,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 288 transitions, 4641 flow [2023-12-05 21:10:39,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:10:39,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:10:39,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 565 transitions. [2023-12-05 21:10:39,356 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7170050761421319 [2023-12-05 21:10:39,356 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 565 transitions. [2023-12-05 21:10:39,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 565 transitions. [2023-12-05 21:10:39,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:39,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 565 transitions. [2023-12-05 21:10:39,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 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:10:39,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 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:10:39,359 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 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:10:39,359 INFO L308 CegarLoopForPetriNet]: 203 programPoint places, -9 predicate places. [2023-12-05 21:10:39,359 INFO L500 AbstractCegarLoop]: Abstraction has has 194 places, 288 transitions, 4641 flow [2023-12-05 21:10:39,359 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 0 states have call successors, (0), 0 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:10:39,359 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:39,359 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, 1] [2023-12-05 21:10:39,360 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:10:39,360 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:39,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:39,360 INFO L85 PathProgramCache]: Analyzing trace with hash 905283642, now seen corresponding path program 1 times [2023-12-05 21:10:39,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:39,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004355209] [2023-12-05 21:10:39,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:39,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:39,424 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:10:39,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:39,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004355209] [2023-12-05 21:10:39,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004355209] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:39,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:39,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:10:39,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299300788] [2023-12-05 21:10:39,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:39,425 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:10:39,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:39,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:10:39,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:10:39,426 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 197 [2023-12-05 21:10:39,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 288 transitions, 4641 flow. Second operand has 5 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:39,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:39,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 197 [2023-12-05 21:10:39,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:39,942 INFO L124 PetriNetUnfolderBase]: 1118/2759 cut-off events. [2023-12-05 21:10:39,942 INFO L125 PetriNetUnfolderBase]: For 32198/32486 co-relation queries the response was YES. [2023-12-05 21:10:39,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22537 conditions, 2759 events. 1118/2759 cut-off events. For 32198/32486 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 21188 event pairs, 37 based on Foata normal form. 0/2294 useless extension candidates. Maximal degree in co-relation 22353. Up to 1565 conditions per place. [2023-12-05 21:10:39,973 INFO L140 encePairwiseOnDemand]: 188/197 looper letters, 140 selfloop transitions, 38 changer transitions 0/294 dead transitions. [2023-12-05 21:10:39,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 294 transitions, 5083 flow [2023-12-05 21:10:39,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:10:39,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:10:39,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 559 transitions. [2023-12-05 21:10:39,975 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7093908629441624 [2023-12-05 21:10:39,975 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 559 transitions. [2023-12-05 21:10:39,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 559 transitions. [2023-12-05 21:10:39,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:39,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 559 transitions. [2023-12-05 21:10:39,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 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:10:39,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 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:10:39,977 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 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:10:39,978 INFO L308 CegarLoopForPetriNet]: 203 programPoint places, -7 predicate places. [2023-12-05 21:10:39,978 INFO L500 AbstractCegarLoop]: Abstraction has has 196 places, 294 transitions, 5083 flow [2023-12-05 21:10:39,978 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:39,978 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:39,978 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:39,979 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:10:39,979 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:39,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:39,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1775060664, now seen corresponding path program 1 times [2023-12-05 21:10:39,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:39,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181060061] [2023-12-05 21:10:39,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:39,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:40,205 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:10:40,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:40,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181060061] [2023-12-05 21:10:40,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181060061] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:40,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:40,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-05 21:10:40,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356894008] [2023-12-05 21:10:40,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:40,206 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-05 21:10:40,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:40,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-05 21:10:40,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-05 21:10:40,207 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 197 [2023-12-05 21:10:40,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 294 transitions, 5083 flow. Second operand has 9 states, 9 states have (on average 121.77777777777777) internal successors, (1096), 9 states have internal predecessors, (1096), 0 states have call successors, (0), 0 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:10:40,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:40,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 197 [2023-12-05 21:10:40,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:40,693 INFO L124 PetriNetUnfolderBase]: 890/2303 cut-off events. [2023-12-05 21:10:40,693 INFO L125 PetriNetUnfolderBase]: For 31106/31418 co-relation queries the response was YES. [2023-12-05 21:10:40,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19755 conditions, 2303 events. 890/2303 cut-off events. For 31106/31418 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 17005 event pairs, 37 based on Foata normal form. 0/1964 useless extension candidates. Maximal degree in co-relation 19560. Up to 1268 conditions per place. [2023-12-05 21:10:40,718 INFO L140 encePairwiseOnDemand]: 180/197 looper letters, 153 selfloop transitions, 35 changer transitions 0/299 dead transitions. [2023-12-05 21:10:40,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 299 transitions, 5599 flow [2023-12-05 21:10:40,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:10:40,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:10:40,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1018 transitions. [2023-12-05 21:10:40,721 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6459390862944162 [2023-12-05 21:10:40,721 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1018 transitions. [2023-12-05 21:10:40,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1018 transitions. [2023-12-05 21:10:40,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:40,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1018 transitions. [2023-12-05 21:10:40,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.25) internal successors, (1018), 8 states have internal predecessors, (1018), 0 states have call successors, (0), 0 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:10:40,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 197.0) internal successors, (1773), 9 states have internal predecessors, (1773), 0 states have call successors, (0), 0 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:10:40,725 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 197.0) internal successors, (1773), 9 states have internal predecessors, (1773), 0 states have call successors, (0), 0 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:10:40,726 INFO L308 CegarLoopForPetriNet]: 203 programPoint places, 0 predicate places. [2023-12-05 21:10:40,726 INFO L500 AbstractCegarLoop]: Abstraction has has 203 places, 299 transitions, 5599 flow [2023-12-05 21:10:40,727 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 121.77777777777777) internal successors, (1096), 9 states have internal predecessors, (1096), 0 states have call successors, (0), 0 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:10:40,727 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:40,727 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:40,727 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:10:40,728 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:40,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:40,728 INFO L85 PathProgramCache]: Analyzing trace with hash -736621510, now seen corresponding path program 1 times [2023-12-05 21:10:40,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:40,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583104148] [2023-12-05 21:10:40,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:40,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:41,047 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:10:41,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:41,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583104148] [2023-12-05 21:10:41,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583104148] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:41,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:41,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-05 21:10:41,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066037507] [2023-12-05 21:10:41,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:41,048 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:10:41,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:41,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:10:41,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:10:41,050 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 197 [2023-12-05 21:10:41,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 299 transitions, 5599 flow. Second operand has 11 states, 11 states have (on average 119.45454545454545) internal successors, (1314), 11 states have internal predecessors, (1314), 0 states have call successors, (0), 0 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:10:41,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:41,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 197 [2023-12-05 21:10:41,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:41,548 INFO L124 PetriNetUnfolderBase]: 662/1842 cut-off events. [2023-12-05 21:10:41,548 INFO L125 PetriNetUnfolderBase]: For 27548/27884 co-relation queries the response was YES. [2023-12-05 21:10:41,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16397 conditions, 1842 events. 662/1842 cut-off events. For 27548/27884 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 12769 event pairs, 37 based on Foata normal form. 0/1629 useless extension candidates. Maximal degree in co-relation 16191. Up to 971 conditions per place. [2023-12-05 21:10:41,569 INFO L140 encePairwiseOnDemand]: 179/197 looper letters, 165 selfloop transitions, 29 changer transitions 0/304 dead transitions. [2023-12-05 21:10:41,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 304 transitions, 6137 flow [2023-12-05 21:10:41,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:10:41,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:10:41,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1241 transitions. [2023-12-05 21:10:41,571 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6299492385786802 [2023-12-05 21:10:41,571 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1241 transitions. [2023-12-05 21:10:41,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1241 transitions. [2023-12-05 21:10:41,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:41,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1241 transitions. [2023-12-05 21:10:41,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 124.1) internal successors, (1241), 10 states have internal predecessors, (1241), 0 states have call successors, (0), 0 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:10:41,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 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:10:41,576 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 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:10:41,577 INFO L308 CegarLoopForPetriNet]: 203 programPoint places, 9 predicate places. [2023-12-05 21:10:41,577 INFO L500 AbstractCegarLoop]: Abstraction has has 212 places, 304 transitions, 6137 flow [2023-12-05 21:10:41,577 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 119.45454545454545) internal successors, (1314), 11 states have internal predecessors, (1314), 0 states have call successors, (0), 0 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:10:41,577 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:41,577 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:41,577 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-05 21:10:41,578 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:41,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:41,578 INFO L85 PathProgramCache]: Analyzing trace with hash 773412610, now seen corresponding path program 1 times [2023-12-05 21:10:41,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:41,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450868471] [2023-12-05 21:10:41,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:41,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:42,229 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:10:42,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:42,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450868471] [2023-12-05 21:10:42,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450868471] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:42,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:42,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-05 21:10:42,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776976840] [2023-12-05 21:10:42,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:42,232 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-05 21:10:42,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:42,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-05 21:10:42,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-12-05 21:10:42,233 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 197 [2023-12-05 21:10:42,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 304 transitions, 6137 flow. Second operand has 15 states, 15 states have (on average 115.0) internal successors, (1725), 15 states have internal predecessors, (1725), 0 states have call successors, (0), 0 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:10:42,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:42,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 197 [2023-12-05 21:10:42,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:43,411 INFO L124 PetriNetUnfolderBase]: 1290/3700 cut-off events. [2023-12-05 21:10:43,412 INFO L125 PetriNetUnfolderBase]: For 45385/47709 co-relation queries the response was YES. [2023-12-05 21:10:43,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31430 conditions, 3700 events. 1290/3700 cut-off events. For 45385/47709 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 29517 event pairs, 83 based on Foata normal form. 2/3442 useless extension candidates. Maximal degree in co-relation 31212. Up to 1565 conditions per place. [2023-12-05 21:10:43,449 INFO L140 encePairwiseOnDemand]: 171/197 looper letters, 141 selfloop transitions, 89 changer transitions 251/588 dead transitions. [2023-12-05 21:10:43,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 588 transitions, 15371 flow [2023-12-05 21:10:43,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-05 21:10:43,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-12-05 21:10:43,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2645 transitions. [2023-12-05 21:10:43,471 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6102907245039225 [2023-12-05 21:10:43,471 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2645 transitions. [2023-12-05 21:10:43,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2645 transitions. [2023-12-05 21:10:43,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:43,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2645 transitions. [2023-12-05 21:10:43,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 120.22727272727273) internal successors, (2645), 22 states have internal predecessors, (2645), 0 states have call successors, (0), 0 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:10:43,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 197.0) internal successors, (4531), 23 states have internal predecessors, (4531), 0 states have call successors, (0), 0 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:10:43,508 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 197.0) internal successors, (4531), 23 states have internal predecessors, (4531), 0 states have call successors, (0), 0 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:10:43,509 INFO L308 CegarLoopForPetriNet]: 203 programPoint places, 30 predicate places. [2023-12-05 21:10:43,509 INFO L500 AbstractCegarLoop]: Abstraction has has 233 places, 588 transitions, 15371 flow [2023-12-05 21:10:43,510 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 115.0) internal successors, (1725), 15 states have internal predecessors, (1725), 0 states have call successors, (0), 0 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:10:43,510 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:43,510 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:43,510 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-05 21:10:43,510 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:43,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:43,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1649804335, now seen corresponding path program 1 times [2023-12-05 21:10:43,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:43,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100108968] [2023-12-05 21:10:43,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:43,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:43,913 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:10:43,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:43,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100108968] [2023-12-05 21:10:43,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100108968] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:43,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:43,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-05 21:10:43,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133017296] [2023-12-05 21:10:43,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:43,914 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-05 21:10:43,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:43,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-05 21:10:43,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-12-05 21:10:43,916 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 197 [2023-12-05 21:10:43,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 588 transitions, 15371 flow. Second operand has 13 states, 13 states have (on average 117.23076923076923) internal successors, (1524), 13 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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:10:43,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:43,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 197 [2023-12-05 21:10:43,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:44,729 INFO L124 PetriNetUnfolderBase]: 1017/2761 cut-off events. [2023-12-05 21:10:44,730 INFO L125 PetriNetUnfolderBase]: For 48543/51656 co-relation queries the response was YES. [2023-12-05 21:10:44,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25465 conditions, 2761 events. 1017/2761 cut-off events. For 48543/51656 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 19783 event pairs, 40 based on Foata normal form. 0/2696 useless extension candidates. Maximal degree in co-relation 25236. Up to 1085 conditions per place. [2023-12-05 21:10:44,747 INFO L140 encePairwiseOnDemand]: 182/197 looper letters, 0 selfloop transitions, 0 changer transitions 570/570 dead transitions. [2023-12-05 21:10:44,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 570 transitions, 15667 flow [2023-12-05 21:10:44,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-05 21:10:44,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-05 21:10:44,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1329 transitions. [2023-12-05 21:10:44,750 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.613290263036456 [2023-12-05 21:10:44,750 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1329 transitions. [2023-12-05 21:10:44,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1329 transitions. [2023-12-05 21:10:44,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:44,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1329 transitions. [2023-12-05 21:10:44,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 120.81818181818181) internal successors, (1329), 11 states have internal predecessors, (1329), 0 states have call successors, (0), 0 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:10:44,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 197.0) internal successors, (2364), 12 states have internal predecessors, (2364), 0 states have call successors, (0), 0 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:10:44,755 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 197.0) internal successors, (2364), 12 states have internal predecessors, (2364), 0 states have call successors, (0), 0 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:10:44,755 INFO L308 CegarLoopForPetriNet]: 203 programPoint places, 35 predicate places. [2023-12-05 21:10:44,755 INFO L500 AbstractCegarLoop]: Abstraction has has 238 places, 570 transitions, 15667 flow [2023-12-05 21:10:44,756 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 117.23076923076923) internal successors, (1524), 13 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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:10:44,767 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe027_rmo.i_BEv2_AllErrorsAtOnce [2023-12-05 21:10:44,830 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 78 remaining) [2023-12-05 21:10:44,831 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 78 remaining) [2023-12-05 21:10:44,831 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 78 remaining) [2023-12-05 21:10:44,832 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 78 remaining) [2023-12-05 21:10:44,832 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 78 remaining) [2023-12-05 21:10:44,832 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 78 remaining) [2023-12-05 21:10:44,832 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 78 remaining) [2023-12-05 21:10:44,832 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 78 remaining) [2023-12-05 21:10:44,832 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 78 remaining) [2023-12-05 21:10:44,832 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 78 remaining) [2023-12-05 21:10:44,832 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 78 remaining) [2023-12-05 21:10:44,832 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 78 remaining) [2023-12-05 21:10:44,832 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 78 remaining) [2023-12-05 21:10:44,832 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 78 remaining) [2023-12-05 21:10:44,832 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 78 remaining) [2023-12-05 21:10:44,833 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 78 remaining) [2023-12-05 21:10:44,833 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 78 remaining) [2023-12-05 21:10:44,833 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 78 remaining) [2023-12-05 21:10:44,833 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 78 remaining) [2023-12-05 21:10:44,833 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 78 remaining) [2023-12-05 21:10:44,833 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 78 remaining) [2023-12-05 21:10:44,833 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 78 remaining) [2023-12-05 21:10:44,833 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 78 remaining) [2023-12-05 21:10:44,833 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 78 remaining) [2023-12-05 21:10:44,833 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 78 remaining) [2023-12-05 21:10:44,833 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 78 remaining) [2023-12-05 21:10:44,833 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 78 remaining) [2023-12-05 21:10:44,833 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 78 remaining) [2023-12-05 21:10:44,834 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 78 remaining) [2023-12-05 21:10:44,834 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 78 remaining) [2023-12-05 21:10:44,834 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 78 remaining) [2023-12-05 21:10:44,834 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 78 remaining) [2023-12-05 21:10:44,834 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 78 remaining) [2023-12-05 21:10:44,834 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 78 remaining) [2023-12-05 21:10:44,834 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 78 remaining) [2023-12-05 21:10:44,834 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 78 remaining) [2023-12-05 21:10:44,835 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 78 remaining) [2023-12-05 21:10:44,835 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 78 remaining) [2023-12-05 21:10:44,835 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 78 remaining) [2023-12-05 21:10:44,835 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 78 remaining) [2023-12-05 21:10:44,835 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 78 remaining) [2023-12-05 21:10:44,835 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 78 remaining) [2023-12-05 21:10:44,836 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 78 remaining) [2023-12-05 21:10:44,836 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 78 remaining) [2023-12-05 21:10:44,836 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 78 remaining) [2023-12-05 21:10:44,836 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 78 remaining) [2023-12-05 21:10:44,836 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 78 remaining) [2023-12-05 21:10:44,836 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 78 remaining) [2023-12-05 21:10:44,836 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 78 remaining) [2023-12-05 21:10:44,836 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 78 remaining) [2023-12-05 21:10:44,836 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 78 remaining) [2023-12-05 21:10:44,836 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 78 remaining) [2023-12-05 21:10:44,836 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 78 remaining) [2023-12-05 21:10:44,836 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 78 remaining) [2023-12-05 21:10:44,837 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 78 remaining) [2023-12-05 21:10:44,837 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 78 remaining) [2023-12-05 21:10:44,837 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 78 remaining) [2023-12-05 21:10:44,837 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 78 remaining) [2023-12-05 21:10:44,837 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 78 remaining) [2023-12-05 21:10:44,837 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 78 remaining) [2023-12-05 21:10:44,837 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 78 remaining) [2023-12-05 21:10:44,837 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 78 remaining) [2023-12-05 21:10:44,837 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 78 remaining) [2023-12-05 21:10:44,837 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 78 remaining) [2023-12-05 21:10:44,837 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 78 remaining) [2023-12-05 21:10:44,837 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 78 remaining) [2023-12-05 21:10:44,837 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 78 remaining) [2023-12-05 21:10:44,837 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 78 remaining) [2023-12-05 21:10:44,837 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 78 remaining) [2023-12-05 21:10:44,837 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 78 remaining) [2023-12-05 21:10:44,838 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 78 remaining) [2023-12-05 21:10:44,838 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 78 remaining) [2023-12-05 21:10:44,838 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 78 remaining) [2023-12-05 21:10:44,838 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 78 remaining) [2023-12-05 21:10:44,838 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 78 remaining) [2023-12-05 21:10:44,838 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 78 remaining) [2023-12-05 21:10:44,838 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 78 remaining) [2023-12-05 21:10:44,838 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 78 remaining) [2023-12-05 21:10:44,838 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-05 21:10:44,838 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:44,843 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:10:44,843 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:10:44,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:10:44 BasicIcfg [2023-12-05 21:10:44,849 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:10:44,849 INFO L158 Benchmark]: Toolchain (without parser) took 18010.38ms. Allocated memory was 274.7MB in the beginning and 3.1GB in the end (delta: 2.8GB). Free memory was 228.2MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2023-12-05 21:10:44,849 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 189.8MB. Free memory was 140.2MB in the beginning and 140.1MB in the end (delta: 91.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:10:44,849 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.90ms. Allocated memory is still 274.7MB. Free memory was 228.2MB in the beginning and 203.4MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-12-05 21:10:44,849 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.70ms. Allocated memory is still 274.7MB. Free memory was 203.4MB in the beginning and 200.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:10:44,850 INFO L158 Benchmark]: Boogie Preprocessor took 26.73ms. Allocated memory is still 274.7MB. Free memory was 200.9MB in the beginning and 198.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:10:44,850 INFO L158 Benchmark]: RCFGBuilder took 916.03ms. Allocated memory is still 274.7MB. Free memory was 198.6MB in the beginning and 156.7MB in the end (delta: 41.9MB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. [2023-12-05 21:10:44,850 INFO L158 Benchmark]: TraceAbstraction took 16556.54ms. Allocated memory was 274.7MB in the beginning and 3.1GB in the end (delta: 2.8GB). Free memory was 156.1MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2023-12-05 21:10:44,852 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 189.8MB. Free memory was 140.2MB in the beginning and 140.1MB in the end (delta: 91.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 456.90ms. Allocated memory is still 274.7MB. Free memory was 228.2MB in the beginning and 203.4MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.70ms. Allocated memory is still 274.7MB. Free memory was 203.4MB in the beginning and 200.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.73ms. Allocated memory is still 274.7MB. Free memory was 200.9MB in the beginning and 198.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 916.03ms. Allocated memory is still 274.7MB. Free memory was 198.6MB in the beginning and 156.7MB in the end (delta: 41.9MB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. * TraceAbstraction took 16556.54ms. Allocated memory was 274.7MB in the beginning and 3.1GB in the end (delta: 2.8GB). Free memory was 156.1MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.4GB. 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 259 locations, 78 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: 16.4s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 874 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 874 mSDsluCounter, 316 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 112 mSDsCounter, 270 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1850 IncrementalHoareTripleChecker+Invalid, 2120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 270 mSolverCounterUnsat, 204 mSDtfsCounter, 1850 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15667occurred in iteration=17, InterpolantAutomatonStates: 99, 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.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1438 NumberOfCodeBlocks, 1438 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1421 ConstructedInterpolants, 0 QuantifiedInterpolants, 7619 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 44 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:10:44,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...