/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -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_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:51:22,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:51:22,297 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-11-30 04:51:22,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:51:22,328 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:51:22,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:51:22,329 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:51:22,329 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:51:22,330 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:51:22,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:51:22,334 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:51:22,334 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:51:22,334 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:51:22,335 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:51:22,335 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:51:22,335 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:51:22,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:51:22,336 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:51:22,336 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:51:22,336 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:51:22,336 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:51:22,337 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:51:22,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:51:22,337 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:51:22,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:51:22,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:51:22,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:51:22,338 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:51:22,338 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:51:22,339 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:51:22,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:51:22,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:51:22,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:51:22,340 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-11-30 04:51:22,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:51:22,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:51:22,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:51:22,584 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:51:22,586 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:51:22,587 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i [2023-11-30 04:51:23,747 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:51:24,018 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:51:24,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i [2023-11-30 04:51:24,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1034f2844/23f45866735240ce8c930748a8631307/FLAG3c72e8b97 [2023-11-30 04:51:24,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1034f2844/23f45866735240ce8c930748a8631307 [2023-11-30 04:51:24,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:51:24,049 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:51:24,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:51:24,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:51:24,054 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:51:24,054 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:51:24" (1/1) ... [2023-11-30 04:51:24,055 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33b3c7e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:24, skipping insertion in model container [2023-11-30 04:51:24,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:51:24" (1/1) ... [2023-11-30 04:51:24,102 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:51:24,416 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:51:24,429 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:51:24,490 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:51:24,516 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:51:24,517 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:51:24,523 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:51:24,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:24 WrapperNode [2023-11-30 04:51:24,524 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:51:24,524 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:51:24,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:51:24,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:51:24,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:24" (1/1) ... [2023-11-30 04:51:24,545 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:24" (1/1) ... [2023-11-30 04:51:24,570 INFO L138 Inliner]: procedures = 177, calls = 89, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 200 [2023-11-30 04:51:24,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:51:24,571 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:51:24,571 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:51:24,571 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:51:24,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:24" (1/1) ... [2023-11-30 04:51:24,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:24" (1/1) ... [2023-11-30 04:51:24,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:24" (1/1) ... [2023-11-30 04:51:24,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:24" (1/1) ... [2023-11-30 04:51:24,609 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:24" (1/1) ... [2023-11-30 04:51:24,611 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:24" (1/1) ... [2023-11-30 04:51:24,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:24" (1/1) ... [2023-11-30 04:51:24,616 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:24" (1/1) ... [2023-11-30 04:51:24,635 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:51:24,635 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:51:24,636 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:51:24,636 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:51:24,637 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:24" (1/1) ... [2023-11-30 04:51:24,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:51:24,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:51:24,664 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-11-30 04:51:24,691 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-11-30 04:51:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 04:51:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:51:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:51:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:51:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:51:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:51:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-30 04:51:24,724 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-30 04:51:24,724 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-30 04:51:24,724 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-30 04:51:24,725 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-30 04:51:24,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-30 04:51:24,725 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-30 04:51:24,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-30 04:51:24,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:51:24,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:51:24,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:51:24,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:51:24,727 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 04:51:24,911 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:51:24,913 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:51:25,415 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:51:25,888 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:51:25,888 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:51:25,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:51:25 BoogieIcfgContainer [2023-11-30 04:51:25,890 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:51:25,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:51:25,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:51:25,895 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:51:25,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:51:24" (1/3) ... [2023-11-30 04:51:25,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef60696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:51:25, skipping insertion in model container [2023-11-30 04:51:25,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:24" (2/3) ... [2023-11-30 04:51:25,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef60696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:51:25, skipping insertion in model container [2023-11-30 04:51:25,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:51:25" (3/3) ... [2023-11-30 04:51:25,898 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_power.opt.i [2023-11-30 04:51:25,915 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:51:25,916 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2023-11-30 04:51:25,916 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:51:26,076 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:51:26,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 217 places, 207 transitions, 430 flow [2023-11-30 04:51:26,232 INFO L124 PetriNetUnfolderBase]: 3/203 cut-off events. [2023-11-30 04:51:26,232 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:51:26,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 3/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 331 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 144. Up to 2 conditions per place. [2023-11-30 04:51:26,239 INFO L82 GeneralOperation]: Start removeDead. Operand has 217 places, 207 transitions, 430 flow [2023-11-30 04:51:26,249 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 213 places, 203 transitions, 418 flow [2023-11-30 04:51:26,263 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:51:26,272 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;@74f70c30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:51:26,272 INFO L363 AbstractCegarLoop]: Starting to check reachability of 98 error locations. [2023-11-30 04:51:26,295 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:51:26,295 INFO L124 PetriNetUnfolderBase]: 0/62 cut-off events. [2023-11-30 04:51:26,295 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:51:26,295 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:51:26,296 INFO L232 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-11-30 04:51:26,296 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-30 04:51:26,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:51:26,301 INFO L85 PathProgramCache]: Analyzing trace with hash -601515883, now seen corresponding path program 1 times [2023-11-30 04:51:26,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:51:26,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682938630] [2023-11-30 04:51:26,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:51:26,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:51:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:51:26,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:51:26,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:51:26,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682938630] [2023-11-30 04:51:26,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682938630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:51:26,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:51:26,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:51:26,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392241499] [2023-11-30 04:51:26,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:51:26,733 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:51:26,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:51:26,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:51:26,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:51:26,766 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 207 [2023-11-30 04:51:26,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 203 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:26,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:51:26,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 207 [2023-11-30 04:51:26,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:51:45,596 INFO L124 PetriNetUnfolderBase]: 76707/131537 cut-off events. [2023-11-30 04:51:45,596 INFO L125 PetriNetUnfolderBase]: For 251/251 co-relation queries the response was YES. [2023-11-30 04:51:45,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232644 conditions, 131537 events. 76707/131537 cut-off events. For 251/251 co-relation queries the response was YES. Maximal size of possible extension queue 8030. Compared 1354364 event pairs, 46503 based on Foata normal form. 3276/65920 useless extension candidates. Maximal degree in co-relation 232563. Up to 61250 conditions per place. [2023-11-30 04:51:46,879 INFO L140 encePairwiseOnDemand]: 177/207 looper letters, 77 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2023-11-30 04:51:46,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 194 transitions, 558 flow [2023-11-30 04:51:46,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:51:46,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:51:46,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2023-11-30 04:51:46,891 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7954911433172303 [2023-11-30 04:51:46,891 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2023-11-30 04:51:46,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2023-11-30 04:51:46,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:51:46,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2023-11-30 04:51:46,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:46,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:46,903 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:46,906 INFO L307 CegarLoopForPetriNet]: 213 programPoint places, -26 predicate places. [2023-11-30 04:51:46,906 INFO L500 AbstractCegarLoop]: Abstraction has has 187 places, 194 transitions, 558 flow [2023-11-30 04:51:46,907 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:46,907 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:51:46,907 INFO L232 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-11-30 04:51:46,907 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:51:46,907 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-30 04:51:46,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:51:46,908 INFO L85 PathProgramCache]: Analyzing trace with hash -601515882, now seen corresponding path program 1 times [2023-11-30 04:51:46,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:51:46,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677055996] [2023-11-30 04:51:46,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:51:46,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:51:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:51:47,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:51:47,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:51:47,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677055996] [2023-11-30 04:51:47,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677055996] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:51:47,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:51:47,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:51:47,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508824825] [2023-11-30 04:51:47,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:51:47,085 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:51:47,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:51:47,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:51:47,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:51:47,086 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 207 [2023-11-30 04:51:47,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 194 transitions, 558 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:47,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:51:47,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 207 [2023-11-30 04:51:47,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:04,762 INFO L124 PetriNetUnfolderBase]: 77384/132592 cut-off events. [2023-11-30 04:52:04,762 INFO L125 PetriNetUnfolderBase]: For 9667/17579 co-relation queries the response was YES. [2023-11-30 04:52:05,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331046 conditions, 132592 events. 77384/132592 cut-off events. For 9667/17579 co-relation queries the response was YES. Maximal size of possible extension queue 8030. Compared 1363961 event pairs, 47180 based on Foata normal form. 0/63338 useless extension candidates. Maximal degree in co-relation 330959. Up to 68472 conditions per place. [2023-11-30 04:52:06,320 INFO L140 encePairwiseOnDemand]: 204/207 looper letters, 94 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2023-11-30 04:52:06,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 215 transitions, 834 flow [2023-11-30 04:52:06,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:52:06,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:52:06,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2023-11-30 04:52:06,323 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7246376811594203 [2023-11-30 04:52:06,323 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2023-11-30 04:52:06,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2023-11-30 04:52:06,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:06,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2023-11-30 04:52:06,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:06,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:06,329 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:06,330 INFO L307 CegarLoopForPetriNet]: 213 programPoint places, -25 predicate places. [2023-11-30 04:52:06,331 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 215 transitions, 834 flow [2023-11-30 04:52:06,331 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:06,331 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:06,332 INFO L232 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] [2023-11-30 04:52:06,332 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:52:06,332 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-30 04:52:06,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:06,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1445958258, now seen corresponding path program 1 times [2023-11-30 04:52:06,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:06,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442503992] [2023-11-30 04:52:06,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:06,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:06,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:06,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:06,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442503992] [2023-11-30 04:52:06,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442503992] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:06,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:06,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:52:06,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966966520] [2023-11-30 04:52:06,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:06,520 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:52:06,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:06,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:52:06,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:52:06,525 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 207 [2023-11-30 04:52:06,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 215 transitions, 834 flow. Second operand has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:06,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:06,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 207 [2023-11-30 04:52:06,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:19,013 INFO L124 PetriNetUnfolderBase]: 49468/93817 cut-off events. [2023-11-30 04:52:19,013 INFO L125 PetriNetUnfolderBase]: For 17888/22148 co-relation queries the response was YES. [2023-11-30 04:52:19,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289935 conditions, 93817 events. 49468/93817 cut-off events. For 17888/22148 co-relation queries the response was YES. Maximal size of possible extension queue 6167. Compared 1067440 event pairs, 9428 based on Foata normal form. 0/57248 useless extension candidates. Maximal degree in co-relation 289837. Up to 56436 conditions per place. [2023-11-30 04:52:19,827 INFO L140 encePairwiseOnDemand]: 185/207 looper letters, 107 selfloop transitions, 18 changer transitions 0/238 dead transitions. [2023-11-30 04:52:19,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 238 transitions, 1216 flow [2023-11-30 04:52:19,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 04:52:19,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 04:52:19,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 984 transitions. [2023-11-30 04:52:19,830 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6790890269151139 [2023-11-30 04:52:19,830 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 984 transitions. [2023-11-30 04:52:19,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 984 transitions. [2023-11-30 04:52:19,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:19,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 984 transitions. [2023-11-30 04:52:19,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.57142857142858) internal successors, (984), 7 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:19,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:19,836 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:19,837 INFO L307 CegarLoopForPetriNet]: 213 programPoint places, -21 predicate places. [2023-11-30 04:52:19,837 INFO L500 AbstractCegarLoop]: Abstraction has has 192 places, 238 transitions, 1216 flow [2023-11-30 04:52:19,838 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:19,838 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:19,838 INFO L232 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] [2023-11-30 04:52:19,838 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:52:19,838 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-30 04:52:19,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:19,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1445958257, now seen corresponding path program 1 times [2023-11-30 04:52:19,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:19,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590367681] [2023-11-30 04:52:19,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:19,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:20,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:20,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:20,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590367681] [2023-11-30 04:52:20,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590367681] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:20,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:20,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:52:20,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415631907] [2023-11-30 04:52:20,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:20,023 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:52:20,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:20,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:52:20,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:52:20,029 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 207 [2023-11-30 04:52:20,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 238 transitions, 1216 flow. Second operand has 6 states, 6 states have (on average 117.83333333333333) internal successors, (707), 6 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:20,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:20,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 207 [2023-11-30 04:52:20,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:22,384 INFO L124 PetriNetUnfolderBase]: 6002/13268 cut-off events. [2023-11-30 04:52:22,385 INFO L125 PetriNetUnfolderBase]: For 3447/4767 co-relation queries the response was YES. [2023-11-30 04:52:22,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47758 conditions, 13268 events. 6002/13268 cut-off events. For 3447/4767 co-relation queries the response was YES. Maximal size of possible extension queue 1012. Compared 128624 event pairs, 2762 based on Foata normal form. 0/10516 useless extension candidates. Maximal degree in co-relation 47649. Up to 8054 conditions per place. [2023-11-30 04:52:22,457 INFO L140 encePairwiseOnDemand]: 184/207 looper letters, 83 selfloop transitions, 7 changer transitions 0/200 dead transitions. [2023-11-30 04:52:22,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 200 transitions, 1092 flow [2023-11-30 04:52:22,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 04:52:22,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 04:52:22,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 799 transitions. [2023-11-30 04:52:22,460 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.643317230273752 [2023-11-30 04:52:22,460 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 799 transitions. [2023-11-30 04:52:22,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 799 transitions. [2023-11-30 04:52:22,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:22,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 799 transitions. [2023-11-30 04:52:22,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.16666666666666) internal successors, (799), 6 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:22,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:22,465 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:22,466 INFO L307 CegarLoopForPetriNet]: 213 programPoint places, -26 predicate places. [2023-11-30 04:52:22,466 INFO L500 AbstractCegarLoop]: Abstraction has has 187 places, 200 transitions, 1092 flow [2023-11-30 04:52:22,467 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.83333333333333) internal successors, (707), 6 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:22,467 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:22,467 INFO L232 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-11-30 04:52:22,467 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:52:22,467 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-30 04:52:22,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:22,468 INFO L85 PathProgramCache]: Analyzing trace with hash 943950355, now seen corresponding path program 1 times [2023-11-30 04:52:22,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:22,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193379146] [2023-11-30 04:52:22,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:22,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:22,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:22,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:22,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193379146] [2023-11-30 04:52:22,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193379146] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:22,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:22,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:52:22,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251721846] [2023-11-30 04:52:22,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:22,519 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:52:22,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:22,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:52:22,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:52:22,520 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 207 [2023-11-30 04:52:22,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 200 transitions, 1092 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:22,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:22,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 207 [2023-11-30 04:52:22,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:25,012 INFO L124 PetriNetUnfolderBase]: 7421/15936 cut-off events. [2023-11-30 04:52:25,012 INFO L125 PetriNetUnfolderBase]: For 12161/18719 co-relation queries the response was YES. [2023-11-30 04:52:25,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66999 conditions, 15936 events. 7421/15936 cut-off events. For 12161/18719 co-relation queries the response was YES. Maximal size of possible extension queue 1292. Compared 158332 event pairs, 3496 based on Foata normal form. 2/12375 useless extension candidates. Maximal degree in co-relation 66881. Up to 10032 conditions per place. [2023-11-30 04:52:25,117 INFO L140 encePairwiseOnDemand]: 204/207 looper letters, 83 selfloop transitions, 2 changer transitions 0/200 dead transitions. [2023-11-30 04:52:25,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 200 transitions, 1264 flow [2023-11-30 04:52:25,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:52:25,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:52:25,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2023-11-30 04:52:25,118 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-30 04:52:25,118 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 414 transitions. [2023-11-30 04:52:25,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 414 transitions. [2023-11-30 04:52:25,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:25,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 414 transitions. [2023-11-30 04:52:25,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:25,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:25,121 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:25,122 INFO L307 CegarLoopForPetriNet]: 213 programPoint places, -25 predicate places. [2023-11-30 04:52:25,122 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 200 transitions, 1264 flow [2023-11-30 04:52:25,122 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:25,123 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:25,123 INFO L232 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-11-30 04:52:25,123 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:52:25,123 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-30 04:52:25,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:25,123 INFO L85 PathProgramCache]: Analyzing trace with hash 943950356, now seen corresponding path program 1 times [2023-11-30 04:52:25,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:25,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231991750] [2023-11-30 04:52:25,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:25,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:25,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:25,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231991750] [2023-11-30 04:52:25,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231991750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:25,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:25,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:52:25,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088746648] [2023-11-30 04:52:25,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:25,208 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:52:25,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:25,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:52:25,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:52:25,210 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 207 [2023-11-30 04:52:25,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 200 transitions, 1264 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:25,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:25,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 207 [2023-11-30 04:52:25,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:27,671 INFO L124 PetriNetUnfolderBase]: 7420/16558 cut-off events. [2023-11-30 04:52:27,671 INFO L125 PetriNetUnfolderBase]: For 28772/31022 co-relation queries the response was YES. [2023-11-30 04:52:27,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77225 conditions, 16558 events. 7420/16558 cut-off events. For 28772/31022 co-relation queries the response was YES. Maximal size of possible extension queue 1273. Compared 171254 event pairs, 736 based on Foata normal form. 2/13261 useless extension candidates. Maximal degree in co-relation 77099. Up to 10032 conditions per place. [2023-11-30 04:52:27,787 INFO L140 encePairwiseOnDemand]: 204/207 looper letters, 96 selfloop transitions, 2 changer transitions 0/219 dead transitions. [2023-11-30 04:52:27,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 219 transitions, 1692 flow [2023-11-30 04:52:27,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:52:27,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:52:27,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-11-30 04:52:27,789 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6908212560386473 [2023-11-30 04:52:27,790 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-11-30 04:52:27,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-11-30 04:52:27,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:27,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-11-30 04:52:27,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:27,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:27,792 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:27,793 INFO L307 CegarLoopForPetriNet]: 213 programPoint places, -24 predicate places. [2023-11-30 04:52:27,793 INFO L500 AbstractCegarLoop]: Abstraction has has 189 places, 219 transitions, 1692 flow [2023-11-30 04:52:27,793 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:27,793 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:27,793 INFO L232 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-11-30 04:52:27,794 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:52:27,794 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-30 04:52:27,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:27,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1262838211, now seen corresponding path program 1 times [2023-11-30 04:52:27,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:27,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927330182] [2023-11-30 04:52:27,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:27,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:27,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:27,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:27,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927330182] [2023-11-30 04:52:27,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927330182] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:27,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:27,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:52:27,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104521766] [2023-11-30 04:52:27,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:27,876 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:52:27,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:27,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:52:27,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:52:27,877 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 207 [2023-11-30 04:52:27,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 219 transitions, 1692 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-11-30 04:52:27,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:27,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 207 [2023-11-30 04:52:27,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:30,854 INFO L124 PetriNetUnfolderBase]: 8833/18213 cut-off events. [2023-11-30 04:52:30,854 INFO L125 PetriNetUnfolderBase]: For 60648/63462 co-relation queries the response was YES. [2023-11-30 04:52:30,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98922 conditions, 18213 events. 8833/18213 cut-off events. For 60648/63462 co-relation queries the response was YES. Maximal size of possible extension queue 1413. Compared 182534 event pairs, 540 based on Foata normal form. 6/14302 useless extension candidates. Maximal degree in co-relation 98788. Up to 11452 conditions per place. [2023-11-30 04:52:31,176 INFO L140 encePairwiseOnDemand]: 204/207 looper letters, 119 selfloop transitions, 2 changer transitions 0/241 dead transitions. [2023-11-30 04:52:31,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 241 transitions, 2248 flow [2023-11-30 04:52:31,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:52:31,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:52:31,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-11-30 04:52:31,178 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6908212560386473 [2023-11-30 04:52:31,178 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-11-30 04:52:31,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-11-30 04:52:31,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:31,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-11-30 04:52:31,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:31,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:31,181 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:31,181 INFO L307 CegarLoopForPetriNet]: 213 programPoint places, -23 predicate places. [2023-11-30 04:52:31,181 INFO L500 AbstractCegarLoop]: Abstraction has has 190 places, 241 transitions, 2248 flow [2023-11-30 04:52:31,182 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-11-30 04:52:31,182 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:31,182 INFO L232 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-11-30 04:52:31,182 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:52:31,182 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-30 04:52:31,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:31,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1262838212, now seen corresponding path program 1 times [2023-11-30 04:52:31,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:31,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488437434] [2023-11-30 04:52:31,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:31,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:31,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:31,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:31,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488437434] [2023-11-30 04:52:31,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488437434] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:31,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:31,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:52:31,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911122872] [2023-11-30 04:52:31,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:31,239 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:52:31,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:31,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:52:31,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:52:31,240 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 207 [2023-11-30 04:52:31,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 241 transitions, 2248 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-11-30 04:52:31,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:31,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 207 [2023-11-30 04:52:31,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:34,284 INFO L124 PetriNetUnfolderBase]: 8826/18200 cut-off events. [2023-11-30 04:52:34,284 INFO L125 PetriNetUnfolderBase]: For 75202/78620 co-relation queries the response was YES. [2023-11-30 04:52:34,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111130 conditions, 18200 events. 8826/18200 cut-off events. For 75202/78620 co-relation queries the response was YES. Maximal size of possible extension queue 1413. Compared 182366 event pairs, 540 based on Foata normal form. 6/14289 useless extension candidates. Maximal degree in co-relation 110987. Up to 11467 conditions per place. [2023-11-30 04:52:34,456 INFO L140 encePairwiseOnDemand]: 204/207 looper letters, 124 selfloop transitions, 2 changer transitions 0/240 dead transitions. [2023-11-30 04:52:34,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 240 transitions, 2488 flow [2023-11-30 04:52:34,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:52:34,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:52:34,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-11-30 04:52:34,457 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6634460547504025 [2023-11-30 04:52:34,458 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-11-30 04:52:34,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-11-30 04:52:34,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:34,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-11-30 04:52:34,461 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-11-30 04:52:34,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:34,462 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:34,463 INFO L307 CegarLoopForPetriNet]: 213 programPoint places, -22 predicate places. [2023-11-30 04:52:34,463 INFO L500 AbstractCegarLoop]: Abstraction has has 191 places, 240 transitions, 2488 flow [2023-11-30 04:52:34,463 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-11-30 04:52:34,463 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:34,463 INFO L232 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-11-30 04:52:34,464 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:52:34,464 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-30 04:52:34,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:34,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1289501874, now seen corresponding path program 1 times [2023-11-30 04:52:34,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:34,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674267246] [2023-11-30 04:52:34,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:34,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:34,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:34,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:34,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674267246] [2023-11-30 04:52:34,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674267246] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:34,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:34,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:52:34,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847028369] [2023-11-30 04:52:34,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:34,543 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:52:34,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:34,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:52:34,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:52:34,545 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 207 [2023-11-30 04:52:34,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 240 transitions, 2488 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-11-30 04:52:34,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:34,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 207 [2023-11-30 04:52:34,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:38,172 INFO L124 PetriNetUnfolderBase]: 10213/19533 cut-off events. [2023-11-30 04:52:38,172 INFO L125 PetriNetUnfolderBase]: For 126803/127123 co-relation queries the response was YES. [2023-11-30 04:52:38,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136443 conditions, 19533 events. 10213/19533 cut-off events. For 126803/127123 co-relation queries the response was YES. Maximal size of possible extension queue 1593. Compared 187445 event pairs, 372 based on Foata normal form. 18/15037 useless extension candidates. Maximal degree in co-relation 136292. Up to 12887 conditions per place. [2023-11-30 04:52:38,350 INFO L140 encePairwiseOnDemand]: 204/207 looper letters, 143 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2023-11-30 04:52:38,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 264 transitions, 3218 flow [2023-11-30 04:52:38,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:52:38,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:52:38,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2023-11-30 04:52:38,352 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6892109500805152 [2023-11-30 04:52:38,352 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2023-11-30 04:52:38,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2023-11-30 04:52:38,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:38,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2023-11-30 04:52:38,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:38,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:38,355 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:38,356 INFO L307 CegarLoopForPetriNet]: 213 programPoint places, -21 predicate places. [2023-11-30 04:52:38,356 INFO L500 AbstractCegarLoop]: Abstraction has has 192 places, 264 transitions, 3218 flow [2023-11-30 04:52:38,356 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-11-30 04:52:38,356 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:38,356 INFO L232 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-11-30 04:52:38,356 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 04:52:38,356 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-30 04:52:38,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:38,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1289501873, now seen corresponding path program 1 times [2023-11-30 04:52:38,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:38,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279937993] [2023-11-30 04:52:38,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:38,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:38,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:38,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:38,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279937993] [2023-11-30 04:52:38,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279937993] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:38,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:38,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:52:38,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375450438] [2023-11-30 04:52:38,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:38,405 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:52:38,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:38,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:52:38,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:52:38,407 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 207 [2023-11-30 04:52:38,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 264 transitions, 3218 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-11-30 04:52:38,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:38,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 207 [2023-11-30 04:52:38,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:42,114 INFO L124 PetriNetUnfolderBase]: 10180/19488 cut-off events. [2023-11-30 04:52:42,114 INFO L125 PetriNetUnfolderBase]: For 154188/154548 co-relation queries the response was YES. [2023-11-30 04:52:42,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149629 conditions, 19488 events. 10180/19488 cut-off events. For 154188/154548 co-relation queries the response was YES. Maximal size of possible extension queue 1593. Compared 187119 event pairs, 372 based on Foata normal form. 18/14992 useless extension candidates. Maximal degree in co-relation 149469. Up to 12952 conditions per place. [2023-11-30 04:52:42,313 INFO L140 encePairwiseOnDemand]: 204/207 looper letters, 148 selfloop transitions, 2 changer transitions 0/263 dead transitions. [2023-11-30 04:52:42,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 263 transitions, 3504 flow [2023-11-30 04:52:42,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:52:42,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:52:42,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2023-11-30 04:52:42,314 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6618357487922706 [2023-11-30 04:52:42,315 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 411 transitions. [2023-11-30 04:52:42,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 411 transitions. [2023-11-30 04:52:42,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:42,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 411 transitions. [2023-11-30 04:52:42,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:42,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:42,317 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:42,318 INFO L307 CegarLoopForPetriNet]: 213 programPoint places, -20 predicate places. [2023-11-30 04:52:42,318 INFO L500 AbstractCegarLoop]: Abstraction has has 193 places, 263 transitions, 3504 flow [2023-11-30 04:52:42,318 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-11-30 04:52:42,318 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:42,318 INFO L232 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-11-30 04:52:42,318 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 04:52:42,318 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-30 04:52:42,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:42,319 INFO L85 PathProgramCache]: Analyzing trace with hash 14628186, now seen corresponding path program 1 times [2023-11-30 04:52:42,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:42,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177675475] [2023-11-30 04:52:42,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:42,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:42,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:42,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177675475] [2023-11-30 04:52:42,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177675475] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:42,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:42,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:52:42,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066049531] [2023-11-30 04:52:42,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:42,437 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:52:42,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:42,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:52:42,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:52:42,438 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 207 [2023-11-30 04:52:42,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 263 transitions, 3504 flow. Second operand has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:42,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:42,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 207 [2023-11-30 04:52:42,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:46,186 INFO L124 PetriNetUnfolderBase]: 10116/19436 cut-off events. [2023-11-30 04:52:46,187 INFO L125 PetriNetUnfolderBase]: For 183407/183803 co-relation queries the response was YES. [2023-11-30 04:52:46,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159585 conditions, 19436 events. 10116/19436 cut-off events. For 183407/183803 co-relation queries the response was YES. Maximal size of possible extension queue 1593. Compared 189260 event pairs, 360 based on Foata normal form. 0/14946 useless extension candidates. Maximal degree in co-relation 159422. Up to 12952 conditions per place. [2023-11-30 04:52:46,396 INFO L140 encePairwiseOnDemand]: 203/207 looper letters, 191 selfloop transitions, 15 changer transitions 0/341 dead transitions. [2023-11-30 04:52:46,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 341 transitions, 5635 flow [2023-11-30 04:52:46,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:52:46,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:52:46,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2023-11-30 04:52:46,398 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7552334943639292 [2023-11-30 04:52:46,398 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 469 transitions. [2023-11-30 04:52:46,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 469 transitions. [2023-11-30 04:52:46,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:46,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 469 transitions. [2023-11-30 04:52:46,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:46,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:46,400 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:46,401 INFO L307 CegarLoopForPetriNet]: 213 programPoint places, -18 predicate places. [2023-11-30 04:52:46,401 INFO L500 AbstractCegarLoop]: Abstraction has has 195 places, 341 transitions, 5635 flow [2023-11-30 04:52:46,401 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:46,401 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:46,401 INFO L232 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-11-30 04:52:46,401 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 04:52:46,402 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-30 04:52:46,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:46,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1682055413, now seen corresponding path program 1 times [2023-11-30 04:52:46,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:46,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318139992] [2023-11-30 04:52:46,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:46,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:46,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:46,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:46,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318139992] [2023-11-30 04:52:46,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318139992] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:46,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:46,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 04:52:46,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336706649] [2023-11-30 04:52:46,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:46,494 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 04:52:46,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:46,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 04:52:46,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-30 04:52:46,495 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 207 [2023-11-30 04:52:46,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 341 transitions, 5635 flow. Second operand has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:46,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:46,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 207 [2023-11-30 04:52:46,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:50,405 INFO L124 PetriNetUnfolderBase]: 10064/19360 cut-off events. [2023-11-30 04:52:50,406 INFO L125 PetriNetUnfolderBase]: For 220197/220633 co-relation queries the response was YES. [2023-11-30 04:52:50,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170899 conditions, 19360 events. 10064/19360 cut-off events. For 220197/220633 co-relation queries the response was YES. Maximal size of possible extension queue 1593. Compared 186620 event pairs, 348 based on Foata normal form. 0/14894 useless extension candidates. Maximal degree in co-relation 170725. Up to 12952 conditions per place. [2023-11-30 04:52:50,653 INFO L140 encePairwiseOnDemand]: 197/207 looper letters, 193 selfloop transitions, 42 changer transitions 0/349 dead transitions. [2023-11-30 04:52:50,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 349 transitions, 6237 flow [2023-11-30 04:52:50,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:52:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:52:50,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 555 transitions. [2023-11-30 04:52:50,654 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6702898550724637 [2023-11-30 04:52:50,655 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 555 transitions. [2023-11-30 04:52:50,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 555 transitions. [2023-11-30 04:52:50,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:50,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 555 transitions. [2023-11-30 04:52:50,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:50,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:50,657 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:50,657 INFO L307 CegarLoopForPetriNet]: 213 programPoint places, -16 predicate places. [2023-11-30 04:52:50,657 INFO L500 AbstractCegarLoop]: Abstraction has has 197 places, 349 transitions, 6237 flow [2023-11-30 04:52:50,658 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:50,658 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:50,658 INFO L232 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-11-30 04:52:50,658 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 04:52:50,658 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-30 04:52:50,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:50,659 INFO L85 PathProgramCache]: Analyzing trace with hash 627557580, now seen corresponding path program 1 times [2023-11-30 04:52:50,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:50,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431020247] [2023-11-30 04:52:50,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:50,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:50,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:50,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:50,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431020247] [2023-11-30 04:52:50,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431020247] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:50,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:50,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:52:50,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39868649] [2023-11-30 04:52:50,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:50,938 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:52:50,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:50,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:52:50,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:52:50,940 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 207 [2023-11-30 04:52:50,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 349 transitions, 6237 flow. Second operand has 6 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:50,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:50,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 207 [2023-11-30 04:52:50,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:54,750 INFO L124 PetriNetUnfolderBase]: 10012/19284 cut-off events. [2023-11-30 04:52:54,750 INFO L125 PetriNetUnfolderBase]: For 258198/258674 co-relation queries the response was YES. [2023-11-30 04:52:54,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180706 conditions, 19284 events. 10012/19284 cut-off events. For 258198/258674 co-relation queries the response was YES. Maximal size of possible extension queue 1593. Compared 185910 event pairs, 336 based on Foata normal form. 0/14842 useless extension candidates. Maximal degree in co-relation 180522. Up to 12952 conditions per place. [2023-11-30 04:52:54,982 INFO L140 encePairwiseOnDemand]: 204/207 looper letters, 204 selfloop transitions, 15 changer transitions 0/348 dead transitions. [2023-11-30 04:52:54,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 348 transitions, 6649 flow [2023-11-30 04:52:54,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:52:54,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:52:54,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 557 transitions. [2023-11-30 04:52:54,983 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6727053140096618 [2023-11-30 04:52:54,984 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 557 transitions. [2023-11-30 04:52:54,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 557 transitions. [2023-11-30 04:52:54,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:54,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 557 transitions. [2023-11-30 04:52:54,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:54,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:54,987 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:54,987 INFO L307 CegarLoopForPetriNet]: 213 programPoint places, -14 predicate places. [2023-11-30 04:52:54,987 INFO L500 AbstractCegarLoop]: Abstraction has has 199 places, 348 transitions, 6649 flow [2023-11-30 04:52:54,988 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:54,988 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:54,988 INFO L232 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-11-30 04:52:54,988 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 04:52:54,988 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-30 04:52:54,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:54,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1122161790, now seen corresponding path program 1 times [2023-11-30 04:52:54,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:54,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142041181] [2023-11-30 04:52:54,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:54,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:55,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:55,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:55,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142041181] [2023-11-30 04:52:55,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142041181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:55,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:55,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-30 04:52:55,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803047591] [2023-11-30 04:52:55,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:55,311 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-30 04:52:55,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:55,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-30 04:52:55,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-30 04:52:55,313 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 207 [2023-11-30 04:52:55,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 348 transitions, 6649 flow. Second operand has 9 states, 9 states have (on average 119.77777777777777) internal successors, (1078), 9 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:55,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:55,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 207 [2023-11-30 04:52:55,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:58,592 INFO L124 PetriNetUnfolderBase]: 7492/14998 cut-off events. [2023-11-30 04:52:58,592 INFO L125 PetriNetUnfolderBase]: For 228499/229015 co-relation queries the response was YES. [2023-11-30 04:52:58,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147960 conditions, 14998 events. 7492/14998 cut-off events. For 228499/229015 co-relation queries the response was YES. Maximal size of possible extension queue 1311. Compared 143388 event pairs, 336 based on Foata normal form. 0/11804 useless extension candidates. Maximal degree in co-relation 147765. Up to 9878 conditions per place. [2023-11-30 04:52:58,771 INFO L140 encePairwiseOnDemand]: 186/207 looper letters, 209 selfloop transitions, 37 changer transitions 0/355 dead transitions. [2023-11-30 04:52:58,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 355 transitions, 7337 flow [2023-11-30 04:52:58,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-30 04:52:58,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-30 04:52:58,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1021 transitions. [2023-11-30 04:52:58,774 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6165458937198067 [2023-11-30 04:52:58,774 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1021 transitions. [2023-11-30 04:52:58,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1021 transitions. [2023-11-30 04:52:58,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:58,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1021 transitions. [2023-11-30 04:52:58,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.625) internal successors, (1021), 8 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:58,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 207.0) internal successors, (1863), 9 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:58,779 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 207.0) internal successors, (1863), 9 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:58,780 INFO L307 CegarLoopForPetriNet]: 213 programPoint places, -7 predicate places. [2023-11-30 04:52:58,780 INFO L500 AbstractCegarLoop]: Abstraction has has 206 places, 355 transitions, 7337 flow [2023-11-30 04:52:58,780 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 119.77777777777777) internal successors, (1078), 9 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:58,780 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:58,780 INFO L232 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-11-30 04:52:58,781 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 04:52:58,781 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-30 04:52:58,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:58,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1418554727, now seen corresponding path program 1 times [2023-11-30 04:52:58,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:58,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596285775] [2023-11-30 04:52:58,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:58,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:59,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:59,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:59,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596285775] [2023-11-30 04:52:59,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596285775] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:59,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:59,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-30 04:52:59,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504474891] [2023-11-30 04:52:59,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:59,207 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-30 04:52:59,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:59,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-30 04:52:59,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-30 04:52:59,209 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 207 [2023-11-30 04:52:59,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 355 transitions, 7337 flow. Second operand has 11 states, 11 states have (on average 117.45454545454545) internal successors, (1292), 11 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:52:59,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:59,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 207 [2023-11-30 04:52:59,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:53:01,785 INFO L124 PetriNetUnfolderBase]: 4972/10686 cut-off events. [2023-11-30 04:53:01,785 INFO L125 PetriNetUnfolderBase]: For 174927/175483 co-relation queries the response was YES. [2023-11-30 04:53:01,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109110 conditions, 10686 events. 4972/10686 cut-off events. For 174927/175483 co-relation queries the response was YES. Maximal size of possible extension queue 897. Compared 99330 event pairs, 336 based on Foata normal form. 0/8740 useless extension candidates. Maximal degree in co-relation 108904. Up to 6804 conditions per place. [2023-11-30 04:53:01,907 INFO L140 encePairwiseOnDemand]: 185/207 looper letters, 225 selfloop transitions, 29 changer transitions 0/362 dead transitions. [2023-11-30 04:53:01,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 362 transitions, 8055 flow [2023-11-30 04:53:01,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-30 04:53:01,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-30 04:53:01,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1244 transitions. [2023-11-30 04:53:01,910 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6009661835748792 [2023-11-30 04:53:01,910 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1244 transitions. [2023-11-30 04:53:01,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1244 transitions. [2023-11-30 04:53:01,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:53:01,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1244 transitions. [2023-11-30 04:53:01,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 124.4) internal successors, (1244), 10 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:53:01,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 207.0) internal successors, (2277), 11 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:53:01,917 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 207.0) internal successors, (2277), 11 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:53:01,918 INFO L307 CegarLoopForPetriNet]: 213 programPoint places, 2 predicate places. [2023-11-30 04:53:01,918 INFO L500 AbstractCegarLoop]: Abstraction has has 215 places, 362 transitions, 8055 flow [2023-11-30 04:53:01,919 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 117.45454545454545) internal successors, (1292), 11 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:53:01,919 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:53:01,919 INFO L232 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-11-30 04:53:01,919 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 04:53:01,919 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-30 04:53:01,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:53:01,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1728005875, now seen corresponding path program 1 times [2023-11-30 04:53:01,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:53:01,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025365816] [2023-11-30 04:53:01,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:53:01,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:53:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:53:02,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:53:02,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:53:02,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025365816] [2023-11-30 04:53:02,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025365816] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:53:02,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:53:02,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-30 04:53:02,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222089057] [2023-11-30 04:53:02,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:53:02,475 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-30 04:53:02,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:53:02,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-30 04:53:02,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-11-30 04:53:02,476 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 207 [2023-11-30 04:53:02,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 362 transitions, 8055 flow. Second operand has 13 states, 13 states have (on average 115.23076923076923) internal successors, (1498), 13 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:53:02,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:53:02,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 207 [2023-11-30 04:53:02,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:53:03,780 INFO L124 PetriNetUnfolderBase]: 1746/4004 cut-off events. [2023-11-30 04:53:03,780 INFO L125 PetriNetUnfolderBase]: For 75629/76225 co-relation queries the response was YES. [2023-11-30 04:53:03,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40544 conditions, 4004 events. 1746/4004 cut-off events. For 75629/76225 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 28295 event pairs, 36 based on Foata normal form. 0/3930 useless extension candidates. Maximal degree in co-relation 40327. Up to 1916 conditions per place. [2023-11-30 04:53:03,801 INFO L140 encePairwiseOnDemand]: 189/207 looper letters, 0 selfloop transitions, 0 changer transitions 336/336 dead transitions. [2023-11-30 04:53:03,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 336 transitions, 7681 flow [2023-11-30 04:53:03,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-30 04:53:03,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-30 04:53:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1328 transitions. [2023-11-30 04:53:03,803 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5832235397452789 [2023-11-30 04:53:03,803 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1328 transitions. [2023-11-30 04:53:03,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1328 transitions. [2023-11-30 04:53:03,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:53:03,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1328 transitions. [2023-11-30 04:53:03,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 120.72727272727273) internal successors, (1328), 11 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:53:03,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 207.0) internal successors, (2484), 12 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:53:03,810 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 207.0) internal successors, (2484), 12 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:53:03,810 INFO L307 CegarLoopForPetriNet]: 213 programPoint places, 4 predicate places. [2023-11-30 04:53:03,810 INFO L500 AbstractCegarLoop]: Abstraction has has 217 places, 336 transitions, 7681 flow [2023-11-30 04:53:03,811 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 115.23076923076923) internal successors, (1498), 13 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:53:03,826 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe027_power.opt.i_BEv2_AllErrorsAtOnce [2023-11-30 04:53:03,885 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 98 remaining) [2023-11-30 04:53:03,885 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 98 remaining) [2023-11-30 04:53:03,885 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 98 remaining) [2023-11-30 04:53:03,886 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 98 remaining) [2023-11-30 04:53:03,886 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 98 remaining) [2023-11-30 04:53:03,886 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 98 remaining) [2023-11-30 04:53:03,886 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 98 remaining) [2023-11-30 04:53:03,886 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 98 remaining) [2023-11-30 04:53:03,886 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 98 remaining) [2023-11-30 04:53:03,886 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 98 remaining) [2023-11-30 04:53:03,886 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 98 remaining) [2023-11-30 04:53:03,887 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 98 remaining) [2023-11-30 04:53:03,887 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 98 remaining) [2023-11-30 04:53:03,887 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 98 remaining) [2023-11-30 04:53:03,887 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 98 remaining) [2023-11-30 04:53:03,887 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 98 remaining) [2023-11-30 04:53:03,887 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 98 remaining) [2023-11-30 04:53:03,887 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 98 remaining) [2023-11-30 04:53:03,887 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 98 remaining) [2023-11-30 04:53:03,887 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 98 remaining) [2023-11-30 04:53:03,887 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 98 remaining) [2023-11-30 04:53:03,888 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 98 remaining) [2023-11-30 04:53:03,888 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 98 remaining) [2023-11-30 04:53:03,888 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 98 remaining) [2023-11-30 04:53:03,888 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 98 remaining) [2023-11-30 04:53:03,888 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 98 remaining) [2023-11-30 04:53:03,888 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 98 remaining) [2023-11-30 04:53:03,888 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 98 remaining) [2023-11-30 04:53:03,888 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 98 remaining) [2023-11-30 04:53:03,888 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 98 remaining) [2023-11-30 04:53:03,888 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 98 remaining) [2023-11-30 04:53:03,889 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 98 remaining) [2023-11-30 04:53:03,889 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 98 remaining) [2023-11-30 04:53:03,889 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 98 remaining) [2023-11-30 04:53:03,889 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 98 remaining) [2023-11-30 04:53:03,889 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 98 remaining) [2023-11-30 04:53:03,889 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 98 remaining) [2023-11-30 04:53:03,889 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 98 remaining) [2023-11-30 04:53:03,889 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 98 remaining) [2023-11-30 04:53:03,889 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 98 remaining) [2023-11-30 04:53:03,889 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 98 remaining) [2023-11-30 04:53:03,889 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 98 remaining) [2023-11-30 04:53:03,890 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 98 remaining) [2023-11-30 04:53:03,890 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 98 remaining) [2023-11-30 04:53:03,890 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 98 remaining) [2023-11-30 04:53:03,890 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 98 remaining) [2023-11-30 04:53:03,890 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 98 remaining) [2023-11-30 04:53:03,890 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 98 remaining) [2023-11-30 04:53:03,890 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 98 remaining) [2023-11-30 04:53:03,890 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 98 remaining) [2023-11-30 04:53:03,890 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 98 remaining) [2023-11-30 04:53:03,890 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 98 remaining) [2023-11-30 04:53:03,891 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 98 remaining) [2023-11-30 04:53:03,891 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 98 remaining) [2023-11-30 04:53:03,891 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 98 remaining) [2023-11-30 04:53:03,891 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 98 remaining) [2023-11-30 04:53:03,891 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 98 remaining) [2023-11-30 04:53:03,891 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 98 remaining) [2023-11-30 04:53:03,891 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 98 remaining) [2023-11-30 04:53:03,891 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 98 remaining) [2023-11-30 04:53:03,891 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 98 remaining) [2023-11-30 04:53:03,891 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 98 remaining) [2023-11-30 04:53:03,891 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 98 remaining) [2023-11-30 04:53:03,892 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 98 remaining) [2023-11-30 04:53:03,892 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 98 remaining) [2023-11-30 04:53:03,892 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 98 remaining) [2023-11-30 04:53:03,892 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 98 remaining) [2023-11-30 04:53:03,892 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 98 remaining) [2023-11-30 04:53:03,892 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 98 remaining) [2023-11-30 04:53:03,892 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 98 remaining) [2023-11-30 04:53:03,892 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 98 remaining) [2023-11-30 04:53:03,892 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 98 remaining) [2023-11-30 04:53:03,892 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 98 remaining) [2023-11-30 04:53:03,892 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 98 remaining) [2023-11-30 04:53:03,893 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 98 remaining) [2023-11-30 04:53:03,893 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 98 remaining) [2023-11-30 04:53:03,893 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 98 remaining) [2023-11-30 04:53:03,893 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 98 remaining) [2023-11-30 04:53:03,893 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 98 remaining) [2023-11-30 04:53:03,893 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 98 remaining) [2023-11-30 04:53:03,893 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 98 remaining) [2023-11-30 04:53:03,893 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 98 remaining) [2023-11-30 04:53:03,893 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 98 remaining) [2023-11-30 04:53:03,894 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 98 remaining) [2023-11-30 04:53:03,894 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 98 remaining) [2023-11-30 04:53:03,894 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 98 remaining) [2023-11-30 04:53:03,894 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 98 remaining) [2023-11-30 04:53:03,894 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 98 remaining) [2023-11-30 04:53:03,894 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 98 remaining) [2023-11-30 04:53:03,894 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 98 remaining) [2023-11-30 04:53:03,894 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 98 remaining) [2023-11-30 04:53:03,894 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 98 remaining) [2023-11-30 04:53:03,894 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 98 remaining) [2023-11-30 04:53:03,895 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 98 remaining) [2023-11-30 04:53:03,895 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 98 remaining) [2023-11-30 04:53:03,895 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 98 remaining) [2023-11-30 04:53:03,895 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 98 remaining) [2023-11-30 04:53:03,895 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 98 remaining) [2023-11-30 04:53:03,895 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 04:53:03,896 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:53:03,901 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:53:03,901 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:53:03,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:53:03 BasicIcfg [2023-11-30 04:53:03,909 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:53:03,909 INFO L158 Benchmark]: Toolchain (without parser) took 99860.20ms. Allocated memory was 356.5MB in the beginning and 15.9GB in the end (delta: 15.5GB). Free memory was 302.9MB in the beginning and 10.3GB in the end (delta: -10.0GB). Peak memory consumption was 5.9GB. Max. memory is 16.0GB. [2023-11-30 04:53:03,909 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 356.5MB. Free memory is still 309.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:53:03,910 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.86ms. Allocated memory is still 356.5MB. Free memory was 302.6MB in the beginning and 276.4MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-11-30 04:53:03,911 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.05ms. Allocated memory is still 356.5MB. Free memory was 276.4MB in the beginning and 273.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:53:03,911 INFO L158 Benchmark]: Boogie Preprocessor took 63.75ms. Allocated memory is still 356.5MB. Free memory was 273.6MB in the beginning and 271.1MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 04:53:03,912 INFO L158 Benchmark]: RCFGBuilder took 1254.74ms. Allocated memory was 356.5MB in the beginning and 501.2MB in the end (delta: 144.7MB). Free memory was 270.8MB in the beginning and 383.1MB in the end (delta: -112.3MB). Peak memory consumption was 36.2MB. Max. memory is 16.0GB. [2023-11-30 04:53:03,912 INFO L158 Benchmark]: TraceAbstraction took 98016.42ms. Allocated memory was 501.2MB in the beginning and 15.9GB in the end (delta: 15.4GB). Free memory was 382.0MB in the beginning and 10.3GB in the end (delta: -9.9GB). Peak memory consumption was 5.8GB. Max. memory is 16.0GB. [2023-11-30 04:53:03,913 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.13ms. Allocated memory is still 356.5MB. Free memory is still 309.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 473.86ms. Allocated memory is still 356.5MB. Free memory was 302.6MB in the beginning and 276.4MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 46.05ms. Allocated memory is still 356.5MB. Free memory was 276.4MB in the beginning and 273.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 63.75ms. Allocated memory is still 356.5MB. Free memory was 273.6MB in the beginning and 271.1MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 1254.74ms. Allocated memory was 356.5MB in the beginning and 501.2MB in the end (delta: 144.7MB). Free memory was 270.8MB in the beginning and 383.1MB in the end (delta: -112.3MB). Peak memory consumption was 36.2MB. Max. memory is 16.0GB. * TraceAbstraction took 98016.42ms. Allocated memory was 501.2MB in the beginning and 15.9GB in the end (delta: 15.4GB). Free memory was 382.0MB in the beginning and 10.3GB in the end (delta: -9.9GB). Peak memory consumption was 5.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 279 locations, 98 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: 97.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 94.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 751 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 751 mSDsluCounter, 240 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 229 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1705 IncrementalHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 229 mSolverCounterUnsat, 187 mSDtfsCounter, 1705 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8055occurred in iteration=15, InterpolantAutomatonStates: 77, 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.7s InterpolantComputationTime, 1328 NumberOfCodeBlocks, 1328 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1312 ConstructedInterpolants, 0 QuantifiedInterpolants, 5927 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 54 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 04:53:03,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...