/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/safe018_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:49:39,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:49:39,403 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:49:39,424 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:49:39,425 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:49:39,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:49:39,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:49:39,426 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:49:39,426 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:49:39,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:49:39,427 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:49:39,427 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:49:39,427 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:49:39,428 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:49:39,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:49:39,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:49:39,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:49:39,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:49:39,429 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:49:39,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:49:39,430 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:49:39,430 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:49:39,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:49:39,431 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:49:39,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:49:39,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:49:39,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:49:39,432 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:49:39,433 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:49:39,433 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:49:39,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:49:39,434 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:49:39,434 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:49:39,434 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:49:39,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:49:39,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:49:39,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:49:39,674 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:49:39,674 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:49:39,676 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe018_power.oepc.i [2023-11-30 04:49:40,812 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:49:41,045 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:49:41,046 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_power.oepc.i [2023-11-30 04:49:41,072 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4817a4940/14b84ec7019e4a53afbf0d5c5ab28186/FLAG1a455fe14 [2023-11-30 04:49:41,085 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4817a4940/14b84ec7019e4a53afbf0d5c5ab28186 [2023-11-30 04:49:41,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:49:41,088 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:49:41,090 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:49:41,090 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:49:41,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:49:41,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:49:41" (1/1) ... [2023-11-30 04:49:41,098 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17028f2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:41, skipping insertion in model container [2023-11-30 04:49:41,098 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:49:41" (1/1) ... [2023-11-30 04:49:41,153 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:49:41,530 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:49:41,543 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:49:41,601 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:49:41,631 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:49:41,631 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:49:41,638 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:49:41,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:41 WrapperNode [2023-11-30 04:49:41,638 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:49:41,640 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:49:41,640 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:49:41,640 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:49:41,646 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:49:41" (1/1) ... [2023-11-30 04:49:41,667 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:49:41" (1/1) ... [2023-11-30 04:49:41,696 INFO L138 Inliner]: procedures = 176, calls = 68, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2023-11-30 04:49:41,696 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:49:41,697 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:49:41,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:49:41,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:49:41,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:41" (1/1) ... [2023-11-30 04:49:41,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:41" (1/1) ... [2023-11-30 04:49:41,723 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:41" (1/1) ... [2023-11-30 04:49:41,723 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:41" (1/1) ... [2023-11-30 04:49:41,731 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:41" (1/1) ... [2023-11-30 04:49:41,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:41" (1/1) ... [2023-11-30 04:49:41,736 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:41" (1/1) ... [2023-11-30 04:49:41,762 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:41" (1/1) ... [2023-11-30 04:49:41,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:49:41,766 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:49:41,766 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:49:41,766 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:49:41,767 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:41" (1/1) ... [2023-11-30 04:49:41,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:49:41,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:49:41,798 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:49:41,800 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:49:41,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 04:49:41,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:49:41,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:49:41,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:49:41,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:49:41,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:49:41,818 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-30 04:49:41,818 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-30 04:49:41,818 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-30 04:49:41,819 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-30 04:49:41,819 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-30 04:49:41,819 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-30 04:49:41,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:49:41,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:49:41,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:49:41,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:49:41,821 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:49:41,950 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:49:41,952 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:49:42,350 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:49:42,725 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:49:42,726 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:49:42,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:49:42 BoogieIcfgContainer [2023-11-30 04:49:42,727 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:49:42,729 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:49:42,729 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:49:42,732 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:49:42,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:49:41" (1/3) ... [2023-11-30 04:49:42,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2e1e54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:49:42, skipping insertion in model container [2023-11-30 04:49:42,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:41" (2/3) ... [2023-11-30 04:49:42,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2e1e54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:49:42, skipping insertion in model container [2023-11-30 04:49:42,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:49:42" (3/3) ... [2023-11-30 04:49:42,734 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_power.oepc.i [2023-11-30 04:49:42,750 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:49:42,750 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2023-11-30 04:49:42,750 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:49:42,879 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:49:42,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 166 transitions, 344 flow [2023-11-30 04:49:43,002 INFO L124 PetriNetUnfolderBase]: 3/163 cut-off events. [2023-11-30 04:49:43,002 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:49:43,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 163 events. 3/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 213 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2023-11-30 04:49:43,008 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 166 transitions, 344 flow [2023-11-30 04:49:43,013 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 163 transitions, 335 flow [2023-11-30 04:49:43,019 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:49:43,026 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;@29d40236, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:49:43,026 INFO L363 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2023-11-30 04:49:43,038 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:49:43,038 INFO L124 PetriNetUnfolderBase]: 0/57 cut-off events. [2023-11-30 04:49:43,038 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:49:43,038 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:43,039 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] [2023-11-30 04:49:43,039 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:49:43,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:43,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1984831523, now seen corresponding path program 1 times [2023-11-30 04:49:43,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:43,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16652643] [2023-11-30 04:49:43,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:43,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:43,386 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:49:43,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:43,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16652643] [2023-11-30 04:49:43,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16652643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:43,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:43,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:49:43,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639140283] [2023-11-30 04:49:43,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:43,399 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:49:43,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:43,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:49:43,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:49:43,430 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 166 [2023-11-30 04:49:43,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 163 transitions, 335 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 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:49:43,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:43,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 166 [2023-11-30 04:49:43,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:44,073 INFO L124 PetriNetUnfolderBase]: 815/2103 cut-off events. [2023-11-30 04:49:44,073 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-30 04:49:44,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3485 conditions, 2103 events. 815/2103 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 15145 event pairs, 520 based on Foata normal form. 76/1272 useless extension candidates. Maximal degree in co-relation 3410. Up to 879 conditions per place. [2023-11-30 04:49:44,098 INFO L140 encePairwiseOnDemand]: 146/166 looper letters, 50 selfloop transitions, 2 changer transitions 0/153 dead transitions. [2023-11-30 04:49:44,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 153 transitions, 419 flow [2023-11-30 04:49:44,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:49:44,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:49:44,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2023-11-30 04:49:44,115 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8072289156626506 [2023-11-30 04:49:44,116 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2023-11-30 04:49:44,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2023-11-30 04:49:44,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:44,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2023-11-30 04:49:44,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 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:49:44,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:44,131 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:44,134 INFO L307 CegarLoopForPetriNet]: 170 programPoint places, -16 predicate places. [2023-11-30 04:49:44,134 INFO L500 AbstractCegarLoop]: Abstraction has has 154 places, 153 transitions, 419 flow [2023-11-30 04:49:44,134 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 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:49:44,134 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:44,135 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] [2023-11-30 04:49:44,135 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:49:44,135 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:49:44,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:44,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1984831522, now seen corresponding path program 1 times [2023-11-30 04:49:44,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:44,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939536884] [2023-11-30 04:49:44,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:44,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:44,299 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:49:44,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:44,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939536884] [2023-11-30 04:49:44,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939536884] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:44,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:44,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:49:44,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586654344] [2023-11-30 04:49:44,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:44,303 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:49:44,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:44,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:49:44,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:49:44,304 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 166 [2023-11-30 04:49:44,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 153 transitions, 419 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:44,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:44,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 166 [2023-11-30 04:49:44,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:44,854 INFO L124 PetriNetUnfolderBase]: 821/2116 cut-off events. [2023-11-30 04:49:44,854 INFO L125 PetriNetUnfolderBase]: For 175/487 co-relation queries the response was YES. [2023-11-30 04:49:44,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4795 conditions, 2116 events. 821/2116 cut-off events. For 175/487 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 15159 event pairs, 526 based on Foata normal form. 0/1208 useless extension candidates. Maximal degree in co-relation 4714. Up to 979 conditions per place. [2023-11-30 04:49:44,872 INFO L140 encePairwiseOnDemand]: 163/166 looper letters, 57 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2023-11-30 04:49:44,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 163 transitions, 577 flow [2023-11-30 04:49:44,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:49:44,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:49:44,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-11-30 04:49:44,875 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7550200803212851 [2023-11-30 04:49:44,875 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-11-30 04:49:44,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-11-30 04:49:44,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:44,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-11-30 04:49:44,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:49:44,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:44,878 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:44,879 INFO L307 CegarLoopForPetriNet]: 170 programPoint places, -15 predicate places. [2023-11-30 04:49:44,879 INFO L500 AbstractCegarLoop]: Abstraction has has 155 places, 163 transitions, 577 flow [2023-11-30 04:49:44,880 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:44,880 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:44,880 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] [2023-11-30 04:49:44,880 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:49:44,881 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:49:44,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:44,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1300395280, now seen corresponding path program 1 times [2023-11-30 04:49:44,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:44,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676778016] [2023-11-30 04:49:44,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:44,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:45,063 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:49:45,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:45,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676778016] [2023-11-30 04:49:45,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676778016] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:45,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:45,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:49:45,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668471579] [2023-11-30 04:49:45,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:45,068 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:49:45,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:45,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:49:45,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:49:45,069 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 166 [2023-11-30 04:49:45,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 163 transitions, 577 flow. Second operand has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 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:49:45,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:45,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 166 [2023-11-30 04:49:45,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:45,598 INFO L124 PetriNetUnfolderBase]: 558/1673 cut-off events. [2023-11-30 04:49:45,598 INFO L125 PetriNetUnfolderBase]: For 392/638 co-relation queries the response was YES. [2023-11-30 04:49:45,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4581 conditions, 1673 events. 558/1673 cut-off events. For 392/638 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 11915 event pairs, 203 based on Foata normal form. 0/1167 useless extension candidates. Maximal degree in co-relation 4489. Up to 657 conditions per place. [2023-11-30 04:49:45,614 INFO L140 encePairwiseOnDemand]: 151/166 looper letters, 63 selfloop transitions, 13 changer transitions 0/175 dead transitions. [2023-11-30 04:49:45,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 175 transitions, 797 flow [2023-11-30 04:49:45,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 04:49:45,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 04:49:45,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 818 transitions. [2023-11-30 04:49:45,617 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7039586919104991 [2023-11-30 04:49:45,617 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 818 transitions. [2023-11-30 04:49:45,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 818 transitions. [2023-11-30 04:49:45,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:45,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 818 transitions. [2023-11-30 04:49:45,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 0 states have call successors, (0), 0 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:49:45,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 166.0) internal successors, (1328), 8 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:49:45,622 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 166.0) internal successors, (1328), 8 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:49:45,623 INFO L307 CegarLoopForPetriNet]: 170 programPoint places, -11 predicate places. [2023-11-30 04:49:45,623 INFO L500 AbstractCegarLoop]: Abstraction has has 159 places, 175 transitions, 797 flow [2023-11-30 04:49:45,624 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 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:49:45,624 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:45,624 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] [2023-11-30 04:49:45,624 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:49:45,624 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:49:45,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:45,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1300395279, now seen corresponding path program 1 times [2023-11-30 04:49:45,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:45,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623345853] [2023-11-30 04:49:45,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:45,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:45,764 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:49:45,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:45,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623345853] [2023-11-30 04:49:45,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623345853] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:45,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:45,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 04:49:45,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108181086] [2023-11-30 04:49:45,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:45,766 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 04:49:45,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:45,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 04:49:45,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-30 04:49:45,767 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 166 [2023-11-30 04:49:45,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 175 transitions, 797 flow. Second operand has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 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:49:45,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:45,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 166 [2023-11-30 04:49:45,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:45,957 INFO L124 PetriNetUnfolderBase]: 183/774 cut-off events. [2023-11-30 04:49:45,958 INFO L125 PetriNetUnfolderBase]: For 374/454 co-relation queries the response was YES. [2023-11-30 04:49:45,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2123 conditions, 774 events. 183/774 cut-off events. For 374/454 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4608 event pairs, 43 based on Foata normal form. 0/671 useless extension candidates. Maximal degree in co-relation 2022. Up to 289 conditions per place. [2023-11-30 04:49:45,964 INFO L140 encePairwiseOnDemand]: 158/166 looper letters, 41 selfloop transitions, 2 changer transitions 0/153 dead transitions. [2023-11-30 04:49:45,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 153 transitions, 707 flow [2023-11-30 04:49:45,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:49:45,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:49:45,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2023-11-30 04:49:45,967 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7243975903614458 [2023-11-30 04:49:45,967 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2023-11-30 04:49:45,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2023-11-30 04:49:45,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:45,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2023-11-30 04:49:45,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:45,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 166.0) internal successors, (830), 5 states have internal predecessors, (830), 0 states have call successors, (0), 0 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:49:45,970 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 166.0) internal successors, (830), 5 states have internal predecessors, (830), 0 states have call successors, (0), 0 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:49:45,971 INFO L307 CegarLoopForPetriNet]: 170 programPoint places, -14 predicate places. [2023-11-30 04:49:45,972 INFO L500 AbstractCegarLoop]: Abstraction has has 156 places, 153 transitions, 707 flow [2023-11-30 04:49:45,972 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 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:49:45,972 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:45,973 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] [2023-11-30 04:49:45,973 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:49:45,973 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:49:45,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:45,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1947800221, now seen corresponding path program 1 times [2023-11-30 04:49:45,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:45,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539883115] [2023-11-30 04:49:45,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:45,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:46,078 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:49:46,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:46,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539883115] [2023-11-30 04:49:46,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539883115] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:46,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:46,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:49:46,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330231536] [2023-11-30 04:49:46,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:46,080 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:49:46,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:46,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:49:46,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:49:46,081 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 166 [2023-11-30 04:49:46,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 153 transitions, 707 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 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:49:46,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:46,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 166 [2023-11-30 04:49:46,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:46,300 INFO L124 PetriNetUnfolderBase]: 215/776 cut-off events. [2023-11-30 04:49:46,300 INFO L125 PetriNetUnfolderBase]: For 822/920 co-relation queries the response was YES. [2023-11-30 04:49:46,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2623 conditions, 776 events. 215/776 cut-off events. For 822/920 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4436 event pairs, 19 based on Foata normal form. 2/663 useless extension candidates. Maximal degree in co-relation 2514. Up to 322 conditions per place. [2023-11-30 04:49:46,306 INFO L140 encePairwiseOnDemand]: 163/166 looper letters, 56 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2023-11-30 04:49:46,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 163 transitions, 927 flow [2023-11-30 04:49:46,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:49:46,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:49:46,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-11-30 04:49:46,308 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7309236947791165 [2023-11-30 04:49:46,308 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-11-30 04:49:46,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-11-30 04:49:46,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:46,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-11-30 04:49:46,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 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:49:46,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:46,311 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:46,313 INFO L307 CegarLoopForPetriNet]: 170 programPoint places, -13 predicate places. [2023-11-30 04:49:46,313 INFO L500 AbstractCegarLoop]: Abstraction has has 157 places, 163 transitions, 927 flow [2023-11-30 04:49:46,313 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 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:49:46,313 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:46,314 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] [2023-11-30 04:49:46,314 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:49:46,314 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:49:46,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:46,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1947800222, now seen corresponding path program 1 times [2023-11-30 04:49:46,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:46,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275141151] [2023-11-30 04:49:46,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:46,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:46,363 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:49:46,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:46,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275141151] [2023-11-30 04:49:46,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275141151] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:46,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:46,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:49:46,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055062344] [2023-11-30 04:49:46,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:46,364 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:49:46,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:46,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:49:46,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:49:46,365 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 166 [2023-11-30 04:49:46,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 163 transitions, 927 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 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:49:46,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:46,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 166 [2023-11-30 04:49:46,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:46,551 INFO L124 PetriNetUnfolderBase]: 214/773 cut-off events. [2023-11-30 04:49:46,551 INFO L125 PetriNetUnfolderBase]: For 1116/1256 co-relation queries the response was YES. [2023-11-30 04:49:46,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3015 conditions, 773 events. 214/773 cut-off events. For 1116/1256 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4401 event pairs, 19 based on Foata normal form. 2/660 useless extension candidates. Maximal degree in co-relation 2897. Up to 326 conditions per place. [2023-11-30 04:49:46,558 INFO L140 encePairwiseOnDemand]: 163/166 looper letters, 59 selfloop transitions, 2 changer transitions 0/162 dead transitions. [2023-11-30 04:49:46,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 162 transitions, 1041 flow [2023-11-30 04:49:46,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:49:46,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:49:46,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-11-30 04:49:46,560 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7088353413654619 [2023-11-30 04:49:46,560 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-11-30 04:49:46,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-11-30 04:49:46,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:46,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-11-30 04:49:46,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 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:49:46,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:46,562 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:46,563 INFO L307 CegarLoopForPetriNet]: 170 programPoint places, -12 predicate places. [2023-11-30 04:49:46,563 INFO L500 AbstractCegarLoop]: Abstraction has has 158 places, 162 transitions, 1041 flow [2023-11-30 04:49:46,564 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 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:49:46,564 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:46,564 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] [2023-11-30 04:49:46,564 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:49:46,564 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:49:46,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:46,564 INFO L85 PathProgramCache]: Analyzing trace with hash -141181743, now seen corresponding path program 1 times [2023-11-30 04:49:46,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:46,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332286373] [2023-11-30 04:49:46,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:46,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:46,608 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:49:46,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:46,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332286373] [2023-11-30 04:49:46,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332286373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:46,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:46,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:49:46,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175943734] [2023-11-30 04:49:46,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:46,610 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:49:46,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:46,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:49:46,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:49:46,611 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 166 [2023-11-30 04:49:46,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 162 transitions, 1041 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 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:49:46,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:46,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 166 [2023-11-30 04:49:46,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:46,821 INFO L124 PetriNetUnfolderBase]: 246/848 cut-off events. [2023-11-30 04:49:46,822 INFO L125 PetriNetUnfolderBase]: For 1969/2053 co-relation queries the response was YES. [2023-11-30 04:49:46,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3714 conditions, 848 events. 246/848 cut-off events. For 1969/2053 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4892 event pairs, 29 based on Foata normal form. 2/720 useless extension candidates. Maximal degree in co-relation 3587. Up to 368 conditions per place. [2023-11-30 04:49:46,831 INFO L140 encePairwiseOnDemand]: 163/166 looper letters, 60 selfloop transitions, 2 changer transitions 0/162 dead transitions. [2023-11-30 04:49:46,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 162 transitions, 1171 flow [2023-11-30 04:49:46,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:49:46,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:49:46,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-11-30 04:49:46,833 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7088353413654619 [2023-11-30 04:49:46,833 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-11-30 04:49:46,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-11-30 04:49:46,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:46,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-11-30 04:49:46,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 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:49:46,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:46,835 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:46,836 INFO L307 CegarLoopForPetriNet]: 170 programPoint places, -11 predicate places. [2023-11-30 04:49:46,836 INFO L500 AbstractCegarLoop]: Abstraction has has 159 places, 162 transitions, 1171 flow [2023-11-30 04:49:46,836 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 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:49:46,836 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:46,836 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] [2023-11-30 04:49:46,836 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:49:46,836 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:49:46,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:46,837 INFO L85 PathProgramCache]: Analyzing trace with hash -141181742, now seen corresponding path program 1 times [2023-11-30 04:49:46,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:46,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865858198] [2023-11-30 04:49:46,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:46,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:46,912 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:49:46,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:46,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865858198] [2023-11-30 04:49:46,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865858198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:46,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:46,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:49:46,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039578557] [2023-11-30 04:49:46,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:46,914 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:49:46,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:46,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:49:46,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:49:46,915 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 166 [2023-11-30 04:49:46,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 162 transitions, 1171 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 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:49:46,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:46,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 166 [2023-11-30 04:49:46,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:47,162 INFO L124 PetriNetUnfolderBase]: 245/840 cut-off events. [2023-11-30 04:49:47,162 INFO L125 PetriNetUnfolderBase]: For 2708/2806 co-relation queries the response was YES. [2023-11-30 04:49:47,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4091 conditions, 840 events. 245/840 cut-off events. For 2708/2806 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4995 event pairs, 19 based on Foata normal form. 2/712 useless extension candidates. Maximal degree in co-relation 3956. Up to 368 conditions per place. [2023-11-30 04:49:47,172 INFO L140 encePairwiseOnDemand]: 163/166 looper letters, 63 selfloop transitions, 2 changer transitions 2/171 dead transitions. [2023-11-30 04:49:47,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 171 transitions, 1455 flow [2023-11-30 04:49:47,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:49:47,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:49:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-11-30 04:49:47,174 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7269076305220884 [2023-11-30 04:49:47,174 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-11-30 04:49:47,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-11-30 04:49:47,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:47,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-11-30 04:49:47,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 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:49:47,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:47,176 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:47,178 INFO L307 CegarLoopForPetriNet]: 170 programPoint places, -10 predicate places. [2023-11-30 04:49:47,178 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 171 transitions, 1455 flow [2023-11-30 04:49:47,178 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 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:49:47,180 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:47,180 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:49:47,180 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:49:47,180 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:49:47,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:47,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1051589607, now seen corresponding path program 1 times [2023-11-30 04:49:47,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:47,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181769731] [2023-11-30 04:49:47,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:47,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:47,296 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:49:47,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:47,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181769731] [2023-11-30 04:49:47,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181769731] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:47,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:47,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:49:47,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366043198] [2023-11-30 04:49:47,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:47,298 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:49:47,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:47,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:49:47,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:49:47,299 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 166 [2023-11-30 04:49:47,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 171 transitions, 1455 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:49:47,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:47,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 166 [2023-11-30 04:49:47,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:47,488 INFO L124 PetriNetUnfolderBase]: 235/826 cut-off events. [2023-11-30 04:49:47,488 INFO L125 PetriNetUnfolderBase]: For 3253/3363 co-relation queries the response was YES. [2023-11-30 04:49:47,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4236 conditions, 826 events. 235/826 cut-off events. For 3253/3363 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4914 event pairs, 15 based on Foata normal form. 0/702 useless extension candidates. Maximal degree in co-relation 4098. Up to 368 conditions per place. [2023-11-30 04:49:47,495 INFO L140 encePairwiseOnDemand]: 162/166 looper letters, 61 selfloop transitions, 11 changer transitions 11/201 dead transitions. [2023-11-30 04:49:47,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 201 transitions, 2167 flow [2023-11-30 04:49:47,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:49:47,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:49:47,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2023-11-30 04:49:47,497 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8052208835341366 [2023-11-30 04:49:47,497 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2023-11-30 04:49:47,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2023-11-30 04:49:47,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:47,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2023-11-30 04:49:47,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 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:49:47,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:47,500 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:47,501 INFO L307 CegarLoopForPetriNet]: 170 programPoint places, -8 predicate places. [2023-11-30 04:49:47,501 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 201 transitions, 2167 flow [2023-11-30 04:49:47,501 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:49:47,501 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:47,501 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] [2023-11-30 04:49:47,501 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 04:49:47,502 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:49:47,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:47,504 INFO L85 PathProgramCache]: Analyzing trace with hash 82795702, now seen corresponding path program 1 times [2023-11-30 04:49:47,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:47,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051311018] [2023-11-30 04:49:47,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:47,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:47,603 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:49:47,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:47,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051311018] [2023-11-30 04:49:47,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051311018] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:47,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:47,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 04:49:47,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505652681] [2023-11-30 04:49:47,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:47,607 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 04:49:47,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:47,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 04:49:47,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-30 04:49:47,609 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 166 [2023-11-30 04:49:47,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 201 transitions, 2167 flow. Second operand has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:47,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:47,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 166 [2023-11-30 04:49:47,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:47,863 INFO L124 PetriNetUnfolderBase]: 233/801 cut-off events. [2023-11-30 04:49:47,864 INFO L125 PetriNetUnfolderBase]: For 4132/4256 co-relation queries the response was YES. [2023-11-30 04:49:47,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4526 conditions, 801 events. 233/801 cut-off events. For 4132/4256 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4611 event pairs, 13 based on Foata normal form. 0/681 useless extension candidates. Maximal degree in co-relation 4377. Up to 368 conditions per place. [2023-11-30 04:49:47,871 INFO L140 encePairwiseOnDemand]: 159/166 looper letters, 81 selfloop transitions, 16 changer transitions 11/209 dead transitions. [2023-11-30 04:49:47,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 209 transitions, 2495 flow [2023-11-30 04:49:47,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:49:47,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:49:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 478 transitions. [2023-11-30 04:49:47,873 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7198795180722891 [2023-11-30 04:49:47,873 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 478 transitions. [2023-11-30 04:49:47,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 478 transitions. [2023-11-30 04:49:47,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:47,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 478 transitions. [2023-11-30 04:49:47,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:47,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 166.0) internal successors, (830), 5 states have internal predecessors, (830), 0 states have call successors, (0), 0 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:49:47,876 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 166.0) internal successors, (830), 5 states have internal predecessors, (830), 0 states have call successors, (0), 0 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:49:47,877 INFO L307 CegarLoopForPetriNet]: 170 programPoint places, -6 predicate places. [2023-11-30 04:49:47,877 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 209 transitions, 2495 flow [2023-11-30 04:49:47,877 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:47,877 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:47,877 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] [2023-11-30 04:49:47,877 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 04:49:47,878 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:49:47,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:47,878 INFO L85 PathProgramCache]: Analyzing trace with hash 82795703, now seen corresponding path program 1 times [2023-11-30 04:49:47,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:47,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067193158] [2023-11-30 04:49:47,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:47,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:48,187 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:49:48,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:48,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067193158] [2023-11-30 04:49:48,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067193158] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:48,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:48,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:49:48,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117956155] [2023-11-30 04:49:48,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:48,190 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:49:48,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:48,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:49:48,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:49:48,192 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 166 [2023-11-30 04:49:48,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 209 transitions, 2495 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 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:49:48,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:48,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 166 [2023-11-30 04:49:48,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:48,469 INFO L124 PetriNetUnfolderBase]: 231/816 cut-off events. [2023-11-30 04:49:48,469 INFO L125 PetriNetUnfolderBase]: For 4952/5090 co-relation queries the response was YES. [2023-11-30 04:49:48,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4783 conditions, 816 events. 231/816 cut-off events. For 4952/5090 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4861 event pairs, 11 based on Foata normal form. 2/701 useless extension candidates. Maximal degree in co-relation 4624. Up to 368 conditions per place. [2023-11-30 04:49:48,477 INFO L140 encePairwiseOnDemand]: 163/166 looper letters, 73 selfloop transitions, 11 changer transitions 12/208 dead transitions. [2023-11-30 04:49:48,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 208 transitions, 2665 flow [2023-11-30 04:49:48,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:49:48,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:49:48,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2023-11-30 04:49:48,480 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7259036144578314 [2023-11-30 04:49:48,480 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2023-11-30 04:49:48,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2023-11-30 04:49:48,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:48,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2023-11-30 04:49:48,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:48,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 166.0) internal successors, (830), 5 states have internal predecessors, (830), 0 states have call successors, (0), 0 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:49:48,483 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 166.0) internal successors, (830), 5 states have internal predecessors, (830), 0 states have call successors, (0), 0 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:49:48,484 INFO L307 CegarLoopForPetriNet]: 170 programPoint places, -4 predicate places. [2023-11-30 04:49:48,484 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 208 transitions, 2665 flow [2023-11-30 04:49:48,484 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 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:49:48,484 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:48,484 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] [2023-11-30 04:49:48,485 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 04:49:48,485 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:49:48,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:48,485 INFO L85 PathProgramCache]: Analyzing trace with hash 933463823, now seen corresponding path program 1 times [2023-11-30 04:49:48,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:48,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952580801] [2023-11-30 04:49:48,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:48,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:48,692 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:49:48,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:48,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952580801] [2023-11-30 04:49:48,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952580801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:48,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:48,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 04:49:48,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201163645] [2023-11-30 04:49:48,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:48,693 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 04:49:48,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:48,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 04:49:48,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-30 04:49:48,695 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 166 [2023-11-30 04:49:48,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 208 transitions, 2665 flow. Second operand has 7 states, 7 states have (on average 106.85714285714286) internal successors, (748), 7 states have internal predecessors, (748), 0 states have call successors, (0), 0 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:49:48,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:48,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 166 [2023-11-30 04:49:48,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:48,961 INFO L124 PetriNetUnfolderBase]: 189/699 cut-off events. [2023-11-30 04:49:48,961 INFO L125 PetriNetUnfolderBase]: For 5505/5655 co-relation queries the response was YES. [2023-11-30 04:49:48,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4386 conditions, 699 events. 189/699 cut-off events. For 5505/5655 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3814 event pairs, 11 based on Foata normal form. 0/612 useless extension candidates. Maximal degree in co-relation 4216. Up to 309 conditions per place. [2023-11-30 04:49:48,969 INFO L140 encePairwiseOnDemand]: 153/166 looper letters, 77 selfloop transitions, 22 changer transitions 14/210 dead transitions. [2023-11-30 04:49:48,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 210 transitions, 2939 flow [2023-11-30 04:49:48,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 04:49:48,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 04:49:48,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 673 transitions. [2023-11-30 04:49:48,971 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6757028112449799 [2023-11-30 04:49:48,971 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 673 transitions. [2023-11-30 04:49:48,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 673 transitions. [2023-11-30 04:49:48,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:48,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 673 transitions. [2023-11-30 04:49:48,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 0 states have call successors, (0), 0 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:49:48,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 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:49:48,976 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 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:49:48,976 INFO L307 CegarLoopForPetriNet]: 170 programPoint places, 1 predicate places. [2023-11-30 04:49:48,976 INFO L500 AbstractCegarLoop]: Abstraction has has 171 places, 210 transitions, 2939 flow [2023-11-30 04:49:48,977 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.85714285714286) internal successors, (748), 7 states have internal predecessors, (748), 0 states have call successors, (0), 0 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:49:48,977 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:48,977 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:49:48,977 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 04:49:48,977 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:49:48,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:48,978 INFO L85 PathProgramCache]: Analyzing trace with hash -590034941, now seen corresponding path program 1 times [2023-11-30 04:49:48,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:48,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799060194] [2023-11-30 04:49:48,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:48,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:49,269 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:49:49,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:49,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799060194] [2023-11-30 04:49:49,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799060194] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:49,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:49,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-30 04:49:49,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486762336] [2023-11-30 04:49:49,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:49,270 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-30 04:49:49,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:49,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-30 04:49:49,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-30 04:49:49,272 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 166 [2023-11-30 04:49:49,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 210 transitions, 2939 flow. Second operand has 9 states, 9 states have (on average 104.44444444444444) internal successors, (940), 9 states have internal predecessors, (940), 0 states have call successors, (0), 0 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:49:49,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:49,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 166 [2023-11-30 04:49:49,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:49,522 INFO L124 PetriNetUnfolderBase]: 147/614 cut-off events. [2023-11-30 04:49:49,523 INFO L125 PetriNetUnfolderBase]: For 5585/5751 co-relation queries the response was YES. [2023-11-30 04:49:49,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3931 conditions, 614 events. 147/614 cut-off events. For 5585/5751 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3112 event pairs, 11 based on Foata normal form. 0/557 useless extension candidates. Maximal degree in co-relation 3750. Up to 250 conditions per place. [2023-11-30 04:49:49,528 INFO L140 encePairwiseOnDemand]: 152/166 looper letters, 79 selfloop transitions, 18 changer transitions 19/212 dead transitions. [2023-11-30 04:49:49,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 212 transitions, 3223 flow [2023-11-30 04:49:49,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-30 04:49:49,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-30 04:49:49,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 869 transitions. [2023-11-30 04:49:49,531 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6543674698795181 [2023-11-30 04:49:49,531 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 869 transitions. [2023-11-30 04:49:49,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 869 transitions. [2023-11-30 04:49:49,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:49,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 869 transitions. [2023-11-30 04:49:49,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 108.625) internal successors, (869), 8 states have internal predecessors, (869), 0 states have call successors, (0), 0 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:49:49,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 166.0) internal successors, (1494), 9 states have internal predecessors, (1494), 0 states have call successors, (0), 0 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:49:49,570 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 166.0) internal successors, (1494), 9 states have internal predecessors, (1494), 0 states have call successors, (0), 0 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:49:49,570 INFO L307 CegarLoopForPetriNet]: 170 programPoint places, 8 predicate places. [2023-11-30 04:49:49,570 INFO L500 AbstractCegarLoop]: Abstraction has has 178 places, 212 transitions, 3223 flow [2023-11-30 04:49:49,571 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 104.44444444444444) internal successors, (940), 9 states have internal predecessors, (940), 0 states have call successors, (0), 0 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:49:49,571 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:49,571 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:49:49,571 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 04:49:49,571 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:49:49,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:49,572 INFO L85 PathProgramCache]: Analyzing trace with hash -490485470, now seen corresponding path program 1 times [2023-11-30 04:49:49,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:49,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412745646] [2023-11-30 04:49:49,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:49,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:50,031 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:49:50,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:50,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412745646] [2023-11-30 04:49:50,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412745646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:50,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:50,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-30 04:49:50,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597249761] [2023-11-30 04:49:50,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:50,032 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-30 04:49:50,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:50,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-30 04:49:50,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-11-30 04:49:50,034 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 166 [2023-11-30 04:49:50,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 212 transitions, 3223 flow. Second operand has 13 states, 13 states have (on average 99.92307692307692) internal successors, (1299), 13 states have internal predecessors, (1299), 0 states have call successors, (0), 0 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:49:50,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:50,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 166 [2023-11-30 04:49:50,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:50,622 INFO L124 PetriNetUnfolderBase]: 265/955 cut-off events. [2023-11-30 04:49:50,622 INFO L125 PetriNetUnfolderBase]: For 10114/10855 co-relation queries the response was YES. [2023-11-30 04:49:50,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6793 conditions, 955 events. 265/955 cut-off events. For 10114/10855 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5791 event pairs, 9 based on Foata normal form. 4/895 useless extension candidates. Maximal degree in co-relation 6600. Up to 390 conditions per place. [2023-11-30 04:49:50,630 INFO L140 encePairwiseOnDemand]: 145/166 looper letters, 59 selfloop transitions, 38 changer transitions 130/320 dead transitions. [2023-11-30 04:49:50,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 320 transitions, 6203 flow [2023-11-30 04:49:50,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-30 04:49:50,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-30 04:49:50,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1862 transitions. [2023-11-30 04:49:50,636 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6231593038821954 [2023-11-30 04:49:50,636 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1862 transitions. [2023-11-30 04:49:50,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1862 transitions. [2023-11-30 04:49:50,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:50,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1862 transitions. [2023-11-30 04:49:50,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 103.44444444444444) internal successors, (1862), 18 states have internal predecessors, (1862), 0 states have call successors, (0), 0 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:49:50,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 166.0) internal successors, (3154), 19 states have internal predecessors, (3154), 0 states have call successors, (0), 0 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:49:50,646 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 166.0) internal successors, (3154), 19 states have internal predecessors, (3154), 0 states have call successors, (0), 0 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:49:50,646 INFO L307 CegarLoopForPetriNet]: 170 programPoint places, 25 predicate places. [2023-11-30 04:49:50,646 INFO L500 AbstractCegarLoop]: Abstraction has has 195 places, 320 transitions, 6203 flow [2023-11-30 04:49:50,647 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 99.92307692307692) internal successors, (1299), 13 states have internal predecessors, (1299), 0 states have call successors, (0), 0 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:49:50,647 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:50,648 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] [2023-11-30 04:49:50,648 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 04:49:50,648 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:49:50,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:50,648 INFO L85 PathProgramCache]: Analyzing trace with hash 478951615, now seen corresponding path program 1 times [2023-11-30 04:49:50,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:50,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403092259] [2023-11-30 04:49:50,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:50,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:51,151 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:49:51,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:51,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403092259] [2023-11-30 04:49:51,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403092259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:51,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:51,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-30 04:49:51,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268101458] [2023-11-30 04:49:51,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:51,152 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-30 04:49:51,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:51,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-30 04:49:51,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-11-30 04:49:51,154 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 166 [2023-11-30 04:49:51,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 320 transitions, 6203 flow. Second operand has 14 states, 14 states have (on average 96.92857142857143) internal successors, (1357), 14 states have internal predecessors, (1357), 0 states have call successors, (0), 0 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:49:51,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:51,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 166 [2023-11-30 04:49:51,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:52,349 INFO L124 PetriNetUnfolderBase]: 1696/4578 cut-off events. [2023-11-30 04:49:52,349 INFO L125 PetriNetUnfolderBase]: For 58991/64373 co-relation queries the response was YES. [2023-11-30 04:49:52,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29319 conditions, 4578 events. 1696/4578 cut-off events. For 58991/64373 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 39254 event pairs, 58 based on Foata normal form. 20/4434 useless extension candidates. Maximal degree in co-relation 29113. Up to 1325 conditions per place. [2023-11-30 04:49:52,384 INFO L140 encePairwiseOnDemand]: 145/166 looper letters, 67 selfloop transitions, 35 changer transitions 580/772 dead transitions. [2023-11-30 04:49:52,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 772 transitions, 18947 flow [2023-11-30 04:49:52,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-30 04:49:52,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-30 04:49:52,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1664 transitions. [2023-11-30 04:49:52,388 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6265060240963856 [2023-11-30 04:49:52,388 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1664 transitions. [2023-11-30 04:49:52,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1664 transitions. [2023-11-30 04:49:52,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:52,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1664 transitions. [2023-11-30 04:49:52,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 104.0) internal successors, (1664), 16 states have internal predecessors, (1664), 0 states have call successors, (0), 0 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:49:52,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 166.0) internal successors, (2822), 17 states have internal predecessors, (2822), 0 states have call successors, (0), 0 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:49:52,396 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 166.0) internal successors, (2822), 17 states have internal predecessors, (2822), 0 states have call successors, (0), 0 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:49:52,397 INFO L307 CegarLoopForPetriNet]: 170 programPoint places, 40 predicate places. [2023-11-30 04:49:52,397 INFO L500 AbstractCegarLoop]: Abstraction has has 210 places, 772 transitions, 18947 flow [2023-11-30 04:49:52,398 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 96.92857142857143) internal successors, (1357), 14 states have internal predecessors, (1357), 0 states have call successors, (0), 0 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:49:52,398 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:52,398 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] [2023-11-30 04:49:52,398 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 04:49:52,398 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:49:52,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:52,398 INFO L85 PathProgramCache]: Analyzing trace with hash -237149314, now seen corresponding path program 1 times [2023-11-30 04:49:52,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:52,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859098178] [2023-11-30 04:49:52,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:52,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:53,012 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:49:53,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:53,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859098178] [2023-11-30 04:49:53,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859098178] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:53,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:53,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-30 04:49:53,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031624492] [2023-11-30 04:49:53,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:53,013 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-30 04:49:53,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:53,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-30 04:49:53,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2023-11-30 04:49:53,015 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 166 [2023-11-30 04:49:53,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 772 transitions, 18947 flow. Second operand has 14 states, 14 states have (on average 99.85714285714286) internal successors, (1398), 14 states have internal predecessors, (1398), 0 states have call successors, (0), 0 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:49:53,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:53,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 166 [2023-11-30 04:49:53,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:54,662 INFO L124 PetriNetUnfolderBase]: 2107/5694 cut-off events. [2023-11-30 04:49:54,662 INFO L125 PetriNetUnfolderBase]: For 69713/86973 co-relation queries the response was YES. [2023-11-30 04:49:54,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37270 conditions, 5694 events. 2107/5694 cut-off events. For 69713/86973 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 50880 event pairs, 128 based on Foata normal form. 37/5560 useless extension candidates. Maximal degree in co-relation 37051. Up to 1516 conditions per place. [2023-11-30 04:49:54,703 INFO L140 encePairwiseOnDemand]: 146/166 looper letters, 0 selfloop transitions, 0 changer transitions 956/956 dead transitions. [2023-11-30 04:49:54,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 956 transitions, 24704 flow [2023-11-30 04:49:54,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-30 04:49:54,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-30 04:49:54,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1566 transitions. [2023-11-30 04:49:54,708 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6289156626506024 [2023-11-30 04:49:54,708 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1566 transitions. [2023-11-30 04:49:54,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1566 transitions. [2023-11-30 04:49:54,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:54,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1566 transitions. [2023-11-30 04:49:54,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 104.4) internal successors, (1566), 15 states have internal predecessors, (1566), 0 states have call successors, (0), 0 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:49:54,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 166.0) internal successors, (2656), 16 states have internal predecessors, (2656), 0 states have call successors, (0), 0 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:49:54,716 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 166.0) internal successors, (2656), 16 states have internal predecessors, (2656), 0 states have call successors, (0), 0 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:49:54,716 INFO L307 CegarLoopForPetriNet]: 170 programPoint places, 50 predicate places. [2023-11-30 04:49:54,717 INFO L500 AbstractCegarLoop]: Abstraction has has 220 places, 956 transitions, 24704 flow [2023-11-30 04:49:54,717 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 99.85714285714286) internal successors, (1398), 14 states have internal predecessors, (1398), 0 states have call successors, (0), 0 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:49:54,728 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe018_power.oepc.i_BEv2_AllErrorsAtOnce [2023-11-30 04:49:54,772 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 59 remaining) [2023-11-30 04:49:54,772 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 59 remaining) [2023-11-30 04:49:54,772 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 59 remaining) [2023-11-30 04:49:54,773 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 59 remaining) [2023-11-30 04:49:54,773 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 59 remaining) [2023-11-30 04:49:54,773 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 59 remaining) [2023-11-30 04:49:54,773 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 59 remaining) [2023-11-30 04:49:54,773 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 59 remaining) [2023-11-30 04:49:54,773 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 59 remaining) [2023-11-30 04:49:54,773 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 59 remaining) [2023-11-30 04:49:54,773 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 59 remaining) [2023-11-30 04:49:54,774 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 59 remaining) [2023-11-30 04:49:54,774 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 59 remaining) [2023-11-30 04:49:54,774 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 59 remaining) [2023-11-30 04:49:54,774 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 59 remaining) [2023-11-30 04:49:54,774 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 59 remaining) [2023-11-30 04:49:54,774 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 59 remaining) [2023-11-30 04:49:54,774 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 59 remaining) [2023-11-30 04:49:54,775 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 59 remaining) [2023-11-30 04:49:54,775 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 59 remaining) [2023-11-30 04:49:54,775 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 59 remaining) [2023-11-30 04:49:54,775 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 59 remaining) [2023-11-30 04:49:54,775 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 59 remaining) [2023-11-30 04:49:54,775 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 59 remaining) [2023-11-30 04:49:54,775 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 59 remaining) [2023-11-30 04:49:54,775 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 59 remaining) [2023-11-30 04:49:54,776 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 59 remaining) [2023-11-30 04:49:54,776 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 59 remaining) [2023-11-30 04:49:54,778 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 59 remaining) [2023-11-30 04:49:54,779 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 59 remaining) [2023-11-30 04:49:54,779 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 59 remaining) [2023-11-30 04:49:54,779 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 59 remaining) [2023-11-30 04:49:54,779 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 59 remaining) [2023-11-30 04:49:54,779 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 59 remaining) [2023-11-30 04:49:54,779 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 59 remaining) [2023-11-30 04:49:54,779 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 59 remaining) [2023-11-30 04:49:54,779 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 59 remaining) [2023-11-30 04:49:54,779 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 59 remaining) [2023-11-30 04:49:54,779 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 59 remaining) [2023-11-30 04:49:54,780 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 59 remaining) [2023-11-30 04:49:54,780 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 59 remaining) [2023-11-30 04:49:54,780 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 59 remaining) [2023-11-30 04:49:54,780 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 59 remaining) [2023-11-30 04:49:54,780 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 59 remaining) [2023-11-30 04:49:54,780 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 59 remaining) [2023-11-30 04:49:54,780 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 59 remaining) [2023-11-30 04:49:54,780 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 59 remaining) [2023-11-30 04:49:54,780 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 59 remaining) [2023-11-30 04:49:54,780 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 59 remaining) [2023-11-30 04:49:54,781 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 59 remaining) [2023-11-30 04:49:54,781 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 59 remaining) [2023-11-30 04:49:54,781 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 59 remaining) [2023-11-30 04:49:54,781 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 59 remaining) [2023-11-30 04:49:54,781 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 59 remaining) [2023-11-30 04:49:54,781 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 59 remaining) [2023-11-30 04:49:54,781 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 59 remaining) [2023-11-30 04:49:54,781 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 59 remaining) [2023-11-30 04:49:54,781 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 59 remaining) [2023-11-30 04:49:54,782 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 59 remaining) [2023-11-30 04:49:54,782 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 04:49:54,782 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:49:54,788 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:49:54,788 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:49:54,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:49:54 BasicIcfg [2023-11-30 04:49:54,794 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:49:54,795 INFO L158 Benchmark]: Toolchain (without parser) took 13706.90ms. Allocated memory was 528.5MB in the beginning and 1.3GB in the end (delta: 763.4MB). Free memory was 476.4MB in the beginning and 736.8MB in the end (delta: -260.4MB). Peak memory consumption was 627.4MB. Max. memory is 16.0GB. [2023-11-30 04:49:54,795 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 348.1MB. Free memory was 298.3MB in the beginning and 298.2MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:49:54,795 INFO L158 Benchmark]: CACSL2BoogieTranslator took 548.41ms. Allocated memory is still 528.5MB. Free memory was 476.1MB in the beginning and 452.5MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-11-30 04:49:54,795 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.68ms. Allocated memory is still 528.5MB. Free memory was 452.5MB in the beginning and 449.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:49:54,796 INFO L158 Benchmark]: Boogie Preprocessor took 68.54ms. Allocated memory is still 528.5MB. Free memory was 449.9MB in the beginning and 447.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:49:54,796 INFO L158 Benchmark]: RCFGBuilder took 961.53ms. Allocated memory is still 528.5MB. Free memory was 447.8MB in the beginning and 391.3MB in the end (delta: 56.5MB). Peak memory consumption was 59.5MB. Max. memory is 16.0GB. [2023-11-30 04:49:54,796 INFO L158 Benchmark]: TraceAbstraction took 12064.95ms. Allocated memory was 528.5MB in the beginning and 1.3GB in the end (delta: 763.4MB). Free memory was 391.3MB in the beginning and 736.8MB in the end (delta: -345.4MB). Peak memory consumption was 540.6MB. Max. memory is 16.0GB. [2023-11-30 04:49:54,797 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.14ms. Allocated memory is still 348.1MB. Free memory was 298.3MB in the beginning and 298.2MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 548.41ms. Allocated memory is still 528.5MB. Free memory was 476.1MB in the beginning and 452.5MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 56.68ms. Allocated memory is still 528.5MB. Free memory was 452.5MB in the beginning and 449.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 68.54ms. Allocated memory is still 528.5MB. Free memory was 449.9MB in the beginning and 447.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 961.53ms. Allocated memory is still 528.5MB. Free memory was 447.8MB in the beginning and 391.3MB in the end (delta: 56.5MB). Peak memory consumption was 59.5MB. Max. memory is 16.0GB. * TraceAbstraction took 12064.95ms. Allocated memory was 528.5MB in the beginning and 1.3GB in the end (delta: 763.4MB). Free memory was 391.3MB in the beginning and 736.8MB in the end (delta: -345.4MB). Peak memory consumption was 540.6MB. 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 212 locations, 59 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: 11.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 763 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 763 mSDsluCounter, 340 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 173 mSDsCounter, 210 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1453 IncrementalHoareTripleChecker+Invalid, 1663 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 210 mSolverCounterUnsat, 167 mSDtfsCounter, 1453 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24704occurred in iteration=16, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1240 NumberOfCodeBlocks, 1240 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1224 ConstructedInterpolants, 0 QuantifiedInterpolants, 7239 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 34 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 04:49:54,825 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...