/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/thin002_rmo.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:10:55,703 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:10:55,787 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 21:10:55,816 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:10:55,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:10:55,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:10:55,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:10:55,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:10:55,819 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:10:55,822 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:10:55,823 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:10:55,823 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:10:55,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:10:55,824 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:10:55,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:10:55,825 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:10:55,825 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:10:55,825 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:10:55,825 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:10:55,825 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:10:55,826 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:10:55,826 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:10:55,826 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:10:55,827 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:10:55,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:10:55,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:10:55,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:10:55,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:10:55,829 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:10:55,829 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:10:55,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:10:55,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:10:55,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:10:55,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 21:10:56,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:10:56,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:10:56,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:10:56,084 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:10:56,084 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:10:56,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_rmo.i [2023-12-05 21:10:57,253 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:10:57,492 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:10:57,493 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_rmo.i [2023-12-05 21:10:57,514 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84eff80d7/163a4ad40b904ce4b54ff0466dad024b/FLAGd5e179881 [2023-12-05 21:10:57,525 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84eff80d7/163a4ad40b904ce4b54ff0466dad024b [2023-12-05 21:10:57,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:10:57,528 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:10:57,529 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:10:57,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:10:57,533 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:10:57,534 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:10:57" (1/1) ... [2023-12-05 21:10:57,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@233e169f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:57, skipping insertion in model container [2023-12-05 21:10:57,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:10:57" (1/1) ... [2023-12-05 21:10:57,588 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:10:57,945 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:10:57,962 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:10:58,033 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:10:58,067 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:10:58,068 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:10:58,074 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:10:58,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:58 WrapperNode [2023-12-05 21:10:58,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:10:58,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:10:58,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:10:58,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:10:58,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:58" (1/1) ... [2023-12-05 21:10:58,098 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:58" (1/1) ... [2023-12-05 21:10:58,135 INFO L138 Inliner]: procedures = 177, calls = 81, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 157 [2023-12-05 21:10:58,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:10:58,136 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:10:58,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:10:58,137 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:10:58,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:58" (1/1) ... [2023-12-05 21:10:58,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:58" (1/1) ... [2023-12-05 21:10:58,161 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:58" (1/1) ... [2023-12-05 21:10:58,162 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:58" (1/1) ... [2023-12-05 21:10:58,173 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:58" (1/1) ... [2023-12-05 21:10:58,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:58" (1/1) ... [2023-12-05 21:10:58,189 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:58" (1/1) ... [2023-12-05 21:10:58,195 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:58" (1/1) ... [2023-12-05 21:10:58,199 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:10:58,200 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:10:58,200 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:10:58,200 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:10:58,201 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:58" (1/1) ... [2023-12-05 21:10:58,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:10:58,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:10:58,262 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 21:10:58,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 21:10:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:10:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:10:58,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:10:58,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:10:58,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:10:58,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:10:58,299 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-05 21:10:58,300 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-05 21:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-05 21:10:58,300 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-05 21:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-05 21:10:58,300 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-05 21:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-12-05 21:10:58,301 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-12-05 21:10:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:10:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:10:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:10:58,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:10:58,303 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:10:58,483 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:10:58,485 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:10:58,846 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:10:59,173 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:10:59,173 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:10:59,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:10:59 BoogieIcfgContainer [2023-12-05 21:10:59,175 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:10:59,177 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:10:59,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:10:59,180 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:10:59,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:10:57" (1/3) ... [2023-12-05 21:10:59,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38aee810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:10:59, skipping insertion in model container [2023-12-05 21:10:59,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:58" (2/3) ... [2023-12-05 21:10:59,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38aee810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:10:59, skipping insertion in model container [2023-12-05 21:10:59,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:10:59" (3/3) ... [2023-12-05 21:10:59,183 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_rmo.i [2023-12-05 21:10:59,199 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:10:59,200 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2023-12-05 21:10:59,200 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:10:59,320 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:10:59,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 189 transitions, 394 flow [2023-12-05 21:10:59,473 INFO L124 PetriNetUnfolderBase]: 3/185 cut-off events. [2023-12-05 21:10:59,473 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:10:59,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 185 events. 3/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 214 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2023-12-05 21:10:59,480 INFO L82 GeneralOperation]: Start removeDead. Operand has 199 places, 189 transitions, 394 flow [2023-12-05 21:10:59,491 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 195 places, 185 transitions, 382 flow [2023-12-05 21:10:59,507 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:10:59,516 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;@7f644e1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:10:59,516 INFO L363 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2023-12-05 21:10:59,526 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:10:59,526 INFO L124 PetriNetUnfolderBase]: 0/64 cut-off events. [2023-12-05 21:10:59,527 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:10:59,527 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:59,527 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:59,528 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2023-12-05 21:10:59,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:59,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1737197414, now seen corresponding path program 1 times [2023-12-05 21:10:59,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:59,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397741040] [2023-12-05 21:10:59,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:59,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:59,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:59,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:59,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397741040] [2023-12-05 21:10:59,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397741040] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:59,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:59,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:59,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012960553] [2023-12-05 21:10:59,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:59,946 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:59,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:59,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:59,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:59,994 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 189 [2023-12-05 21:11:00,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 185 transitions, 382 flow. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:00,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:00,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 189 [2023-12-05 21:11:00,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:00,736 INFO L124 PetriNetUnfolderBase]: 886/2321 cut-off events. [2023-12-05 21:11:00,737 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-05 21:11:00,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3835 conditions, 2321 events. 886/2321 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 16465 event pairs, 532 based on Foata normal form. 76/1439 useless extension candidates. Maximal degree in co-relation 3752. Up to 907 conditions per place. [2023-12-05 21:11:00,771 INFO L140 encePairwiseOnDemand]: 173/189 looper letters, 55 selfloop transitions, 2 changer transitions 0/179 dead transitions. [2023-12-05 21:11:00,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 179 transitions, 484 flow [2023-12-05 21:11:00,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:11:00,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:11:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2023-12-05 21:11:00,789 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8201058201058201 [2023-12-05 21:11:00,790 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 465 transitions. [2023-12-05 21:11:00,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 465 transitions. [2023-12-05 21:11:00,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:00,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 465 transitions. [2023-12-05 21:11:00,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:00,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:00,806 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:00,811 INFO L308 CegarLoopForPetriNet]: 195 programPoint places, -12 predicate places. [2023-12-05 21:11:00,811 INFO L500 AbstractCegarLoop]: Abstraction has has 183 places, 179 transitions, 484 flow [2023-12-05 21:11:00,812 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:00,812 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:00,812 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:00,813 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:11:00,813 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2023-12-05 21:11:00,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:00,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1737197413, now seen corresponding path program 1 times [2023-12-05 21:11:00,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:00,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824817369] [2023-12-05 21:11:00,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:00,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:01,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-12-05 21:11:01,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:01,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824817369] [2023-12-05 21:11:01,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824817369] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:01,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:01,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:11:01,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190122015] [2023-12-05 21:11:01,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:01,035 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:11:01,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:01,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:11:01,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:11:01,037 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 189 [2023-12-05 21:11:01,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 179 transitions, 484 flow. Second operand has 3 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-12-05 21:11:01,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:01,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 189 [2023-12-05 21:11:01,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:01,595 INFO L124 PetriNetUnfolderBase]: 895/2337 cut-off events. [2023-12-05 21:11:01,596 INFO L125 PetriNetUnfolderBase]: For 199/499 co-relation queries the response was YES. [2023-12-05 21:11:01,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5241 conditions, 2337 events. 895/2337 cut-off events. For 199/499 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 16546 event pairs, 541 based on Foata normal form. 0/1380 useless extension candidates. Maximal degree in co-relation 5152. Up to 1010 conditions per place. [2023-12-05 21:11:01,631 INFO L140 encePairwiseOnDemand]: 186/189 looper letters, 61 selfloop transitions, 2 changer transitions 0/189 dead transitions. [2023-12-05 21:11:01,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 189 transitions, 650 flow [2023-12-05 21:11:01,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:11:01,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:11:01,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2023-12-05 21:11:01,634 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7918871252204586 [2023-12-05 21:11:01,634 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2023-12-05 21:11:01,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2023-12-05 21:11:01,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:01,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2023-12-05 21:11:01,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:01,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:01,638 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:01,639 INFO L308 CegarLoopForPetriNet]: 195 programPoint places, -11 predicate places. [2023-12-05 21:11:01,639 INFO L500 AbstractCegarLoop]: Abstraction has has 184 places, 189 transitions, 650 flow [2023-12-05 21:11:01,640 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-12-05 21:11:01,640 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:01,640 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:01,640 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:11:01,640 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2023-12-05 21:11:01,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:01,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1508438871, now seen corresponding path program 1 times [2023-12-05 21:11:01,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:01,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235745852] [2023-12-05 21:11:01,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:01,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:01,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:11:01,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:01,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235745852] [2023-12-05 21:11:01,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235745852] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:01,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:01,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:11:01,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110647834] [2023-12-05 21:11:01,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:01,849 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:11:01,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:01,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:11:01,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:11:01,852 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 189 [2023-12-05 21:11:01,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 189 transitions, 650 flow. Second operand has 6 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:01,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:01,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 189 [2023-12-05 21:11:01,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:02,403 INFO L124 PetriNetUnfolderBase]: 649/1976 cut-off events. [2023-12-05 21:11:02,403 INFO L125 PetriNetUnfolderBase]: For 468/710 co-relation queries the response was YES. [2023-12-05 21:11:02,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5314 conditions, 1976 events. 649/1976 cut-off events. For 468/710 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 14108 event pairs, 205 based on Foata normal form. 0/1412 useless extension candidates. Maximal degree in co-relation 5214. Up to 795 conditions per place. [2023-12-05 21:11:02,429 INFO L140 encePairwiseOnDemand]: 173/189 looper letters, 68 selfloop transitions, 14 changer transitions 0/202 dead transitions. [2023-12-05 21:11:02,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 202 transitions, 886 flow [2023-12-05 21:11:02,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:11:02,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:11:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 978 transitions. [2023-12-05 21:11:02,432 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7392290249433107 [2023-12-05 21:11:02,432 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 978 transitions. [2023-12-05 21:11:02,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 978 transitions. [2023-12-05 21:11:02,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:02,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 978 transitions. [2023-12-05 21:11:02,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.71428571428572) internal successors, (978), 7 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:02,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 189.0) internal successors, (1512), 8 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:02,477 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 189.0) internal successors, (1512), 8 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:02,478 INFO L308 CegarLoopForPetriNet]: 195 programPoint places, -7 predicate places. [2023-12-05 21:11:02,478 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 202 transitions, 886 flow [2023-12-05 21:11:02,479 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:02,479 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:02,479 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:02,479 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:11:02,479 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2023-12-05 21:11:02,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:02,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1508438872, now seen corresponding path program 1 times [2023-12-05 21:11:02,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:02,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946331695] [2023-12-05 21:11:02,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:02,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:02,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:11:02,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:02,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946331695] [2023-12-05 21:11:02,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946331695] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:02,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:02,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:11:02,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202621851] [2023-12-05 21:11:02,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:02,634 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:11:02,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:02,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:11:02,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:11:02,640 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 189 [2023-12-05 21:11:02,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 202 transitions, 886 flow. Second operand has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 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-12-05 21:11:02,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:02,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 189 [2023-12-05 21:11:02,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:02,840 INFO L124 PetriNetUnfolderBase]: 221/947 cut-off events. [2023-12-05 21:11:02,840 INFO L125 PetriNetUnfolderBase]: For 453/533 co-relation queries the response was YES. [2023-12-05 21:11:02,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2541 conditions, 947 events. 221/947 cut-off events. For 453/533 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5710 event pairs, 48 based on Foata normal form. 0/830 useless extension candidates. Maximal degree in co-relation 2432. Up to 350 conditions per place. [2023-12-05 21:11:02,852 INFO L140 encePairwiseOnDemand]: 181/189 looper letters, 45 selfloop transitions, 2 changer transitions 0/180 dead transitions. [2023-12-05 21:11:02,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 180 transitions, 804 flow [2023-12-05 21:11:02,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:11:02,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:11:02,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 577 transitions. [2023-12-05 21:11:02,854 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7632275132275133 [2023-12-05 21:11:02,855 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 577 transitions. [2023-12-05 21:11:02,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 577 transitions. [2023-12-05 21:11:02,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:02,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 577 transitions. [2023-12-05 21:11:02,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.25) internal successors, (577), 4 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:02,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:02,858 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:02,860 INFO L308 CegarLoopForPetriNet]: 195 programPoint places, -10 predicate places. [2023-12-05 21:11:02,861 INFO L500 AbstractCegarLoop]: Abstraction has has 185 places, 180 transitions, 804 flow [2023-12-05 21:11:02,861 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 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-12-05 21:11:02,861 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:02,861 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:02,861 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:11:02,862 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2023-12-05 21:11:02,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:02,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1632576806, now seen corresponding path program 1 times [2023-12-05 21:11:02,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:02,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442953329] [2023-12-05 21:11:02,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:02,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:02,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:11:02,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:02,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442953329] [2023-12-05 21:11:02,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442953329] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:02,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:02,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:11:02,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192477375] [2023-12-05 21:11:02,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:02,976 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:11:02,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:02,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:11:02,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:11:02,978 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 189 [2023-12-05 21:11:02,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 180 transitions, 804 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:02,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:02,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 189 [2023-12-05 21:11:02,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:03,248 INFO L124 PetriNetUnfolderBase]: 253/969 cut-off events. [2023-12-05 21:11:03,249 INFO L125 PetriNetUnfolderBase]: For 938/1028 co-relation queries the response was YES. [2023-12-05 21:11:03,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3107 conditions, 969 events. 253/969 cut-off events. For 938/1028 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5778 event pairs, 19 based on Foata normal form. 2/842 useless extension candidates. Maximal degree in co-relation 2990. Up to 383 conditions per place. [2023-12-05 21:11:03,260 INFO L140 encePairwiseOnDemand]: 186/189 looper letters, 60 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2023-12-05 21:11:03,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 190 transitions, 1032 flow [2023-12-05 21:11:03,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:11:03,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:11:03,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2023-12-05 21:11:03,262 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7707231040564374 [2023-12-05 21:11:03,262 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2023-12-05 21:11:03,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2023-12-05 21:11:03,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:03,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2023-12-05 21:11:03,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:03,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:03,265 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:03,267 INFO L308 CegarLoopForPetriNet]: 195 programPoint places, -9 predicate places. [2023-12-05 21:11:03,267 INFO L500 AbstractCegarLoop]: Abstraction has has 186 places, 190 transitions, 1032 flow [2023-12-05 21:11:03,268 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:03,268 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:03,269 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:03,271 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:11:03,271 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2023-12-05 21:11:03,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:03,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1632576807, now seen corresponding path program 1 times [2023-12-05 21:11:03,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:03,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495776043] [2023-12-05 21:11:03,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:03,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:03,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:11:03,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:03,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495776043] [2023-12-05 21:11:03,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495776043] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:03,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:03,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:11:03,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601198616] [2023-12-05 21:11:03,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:03,345 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:11:03,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:03,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:11:03,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:11:03,346 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 189 [2023-12-05 21:11:03,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 190 transitions, 1032 flow. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:03,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:03,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 189 [2023-12-05 21:11:03,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:03,588 INFO L124 PetriNetUnfolderBase]: 252/946 cut-off events. [2023-12-05 21:11:03,588 INFO L125 PetriNetUnfolderBase]: For 1305/1435 co-relation queries the response was YES. [2023-12-05 21:11:03,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3553 conditions, 946 events. 252/946 cut-off events. For 1305/1435 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5492 event pairs, 19 based on Foata normal form. 2/819 useless extension candidates. Maximal degree in co-relation 3427. Up to 387 conditions per place. [2023-12-05 21:11:03,597 INFO L140 encePairwiseOnDemand]: 186/189 looper letters, 65 selfloop transitions, 2 changer transitions 0/189 dead transitions. [2023-12-05 21:11:03,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 189 transitions, 1158 flow [2023-12-05 21:11:03,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:11:03,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:11:03,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-12-05 21:11:03,602 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7477954144620811 [2023-12-05 21:11:03,602 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-12-05 21:11:03,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-12-05 21:11:03,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:03,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-12-05 21:11:03,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:03,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:03,605 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:03,607 INFO L308 CegarLoopForPetriNet]: 195 programPoint places, -8 predicate places. [2023-12-05 21:11:03,607 INFO L500 AbstractCegarLoop]: Abstraction has has 187 places, 189 transitions, 1158 flow [2023-12-05 21:11:03,607 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:03,608 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:03,608 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:03,608 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:11:03,608 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2023-12-05 21:11:03,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:03,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1228835941, now seen corresponding path program 1 times [2023-12-05 21:11:03,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:03,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469982154] [2023-12-05 21:11:03,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:03,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:03,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:11:03,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:03,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469982154] [2023-12-05 21:11:03,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469982154] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:03,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:03,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:11:03,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794718272] [2023-12-05 21:11:03,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:03,678 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:11:03,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:03,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:11:03,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:11:03,680 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 189 [2023-12-05 21:11:03,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 189 transitions, 1158 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:03,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:03,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 189 [2023-12-05 21:11:03,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:03,962 INFO L124 PetriNetUnfolderBase]: 284/996 cut-off events. [2023-12-05 21:11:03,963 INFO L125 PetriNetUnfolderBase]: For 2288/2458 co-relation queries the response was YES. [2023-12-05 21:11:03,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4301 conditions, 996 events. 284/996 cut-off events. For 2288/2458 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5941 event pairs, 29 based on Foata normal form. 2/854 useless extension candidates. Maximal degree in co-relation 4166. Up to 429 conditions per place. [2023-12-05 21:11:03,977 INFO L140 encePairwiseOnDemand]: 186/189 looper letters, 66 selfloop transitions, 2 changer transitions 0/189 dead transitions. [2023-12-05 21:11:03,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 189 transitions, 1300 flow [2023-12-05 21:11:03,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:11:03,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:11:03,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-12-05 21:11:03,979 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7477954144620811 [2023-12-05 21:11:03,979 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-12-05 21:11:03,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-12-05 21:11:03,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:03,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-12-05 21:11:03,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:03,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:03,982 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:03,983 INFO L308 CegarLoopForPetriNet]: 195 programPoint places, -7 predicate places. [2023-12-05 21:11:03,983 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 189 transitions, 1300 flow [2023-12-05 21:11:03,984 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:03,984 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:03,984 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:03,984 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:11:03,984 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2023-12-05 21:11:03,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:03,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1228835942, now seen corresponding path program 1 times [2023-12-05 21:11:03,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:03,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033774513] [2023-12-05 21:11:03,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:03,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:04,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:11:04,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:04,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033774513] [2023-12-05 21:11:04,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033774513] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:04,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:04,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:11:04,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188167787] [2023-12-05 21:11:04,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:04,076 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:11:04,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:04,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:11:04,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:11:04,077 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 189 [2023-12-05 21:11:04,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 189 transitions, 1300 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:04,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:04,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 189 [2023-12-05 21:11:04,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:04,345 INFO L124 PetriNetUnfolderBase]: 283/1003 cut-off events. [2023-12-05 21:11:04,345 INFO L125 PetriNetUnfolderBase]: For 3055/3265 co-relation queries the response was YES. [2023-12-05 21:11:04,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4739 conditions, 1003 events. 283/1003 cut-off events. For 3055/3265 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5949 event pairs, 19 based on Foata normal form. 2/861 useless extension candidates. Maximal degree in co-relation 4596. Up to 429 conditions per place. [2023-12-05 21:11:04,357 INFO L140 encePairwiseOnDemand]: 186/189 looper letters, 69 selfloop transitions, 2 changer transitions 0/198 dead transitions. [2023-12-05 21:11:04,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 198 transitions, 1592 flow [2023-12-05 21:11:04,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:11:04,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:11:04,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-12-05 21:11:04,359 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7671957671957672 [2023-12-05 21:11:04,359 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-12-05 21:11:04,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-12-05 21:11:04,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:04,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-12-05 21:11:04,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:04,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:04,362 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:04,362 INFO L308 CegarLoopForPetriNet]: 195 programPoint places, -6 predicate places. [2023-12-05 21:11:04,362 INFO L500 AbstractCegarLoop]: Abstraction has has 189 places, 198 transitions, 1592 flow [2023-12-05 21:11:04,363 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:04,363 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:04,363 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:04,363 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:11:04,363 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2023-12-05 21:11:04,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:04,363 INFO L85 PathProgramCache]: Analyzing trace with hash -927000883, now seen corresponding path program 1 times [2023-12-05 21:11:04,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:04,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121601148] [2023-12-05 21:11:04,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:04,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:04,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:11:04,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:04,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121601148] [2023-12-05 21:11:04,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121601148] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:04,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:04,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:11:04,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195924966] [2023-12-05 21:11:04,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:04,447 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:11:04,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:04,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:11:04,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:11:04,448 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 189 [2023-12-05 21:11:04,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 198 transitions, 1592 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:04,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:04,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 189 [2023-12-05 21:11:04,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:04,697 INFO L124 PetriNetUnfolderBase]: 315/1034 cut-off events. [2023-12-05 21:11:04,697 INFO L125 PetriNetUnfolderBase]: For 4625/4721 co-relation queries the response was YES. [2023-12-05 21:11:04,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5496 conditions, 1034 events. 315/1034 cut-off events. For 4625/4721 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6151 event pairs, 19 based on Foata normal form. 2/877 useless extension candidates. Maximal degree in co-relation 5345. Up to 462 conditions per place. [2023-12-05 21:11:04,712 INFO L140 encePairwiseOnDemand]: 186/189 looper letters, 78 selfloop transitions, 2 changer transitions 2/208 dead transitions. [2023-12-05 21:11:04,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 208 transitions, 1944 flow [2023-12-05 21:11:04,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:11:04,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:11:04,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-12-05 21:11:04,714 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7671957671957672 [2023-12-05 21:11:04,714 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-12-05 21:11:04,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-12-05 21:11:04,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:04,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-12-05 21:11:04,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:04,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:04,717 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:04,718 INFO L308 CegarLoopForPetriNet]: 195 programPoint places, -5 predicate places. [2023-12-05 21:11:04,718 INFO L500 AbstractCegarLoop]: Abstraction has has 190 places, 208 transitions, 1944 flow [2023-12-05 21:11:04,718 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:04,718 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:04,718 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:04,718 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:11:04,718 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2023-12-05 21:11:04,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:04,719 INFO L85 PathProgramCache]: Analyzing trace with hash -927000884, now seen corresponding path program 1 times [2023-12-05 21:11:04,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:04,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609972652] [2023-12-05 21:11:04,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:04,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:04,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:11:04,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:04,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609972652] [2023-12-05 21:11:04,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609972652] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:04,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:04,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:11:04,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150108932] [2023-12-05 21:11:04,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:04,775 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:11:04,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:04,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:11:04,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:11:04,776 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 189 [2023-12-05 21:11:04,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 208 transitions, 1944 flow. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:04,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:04,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 189 [2023-12-05 21:11:04,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:05,063 INFO L124 PetriNetUnfolderBase]: 314/1011 cut-off events. [2023-12-05 21:11:05,063 INFO L125 PetriNetUnfolderBase]: For 5822/5930 co-relation queries the response was YES. [2023-12-05 21:11:05,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5992 conditions, 1011 events. 314/1011 cut-off events. For 5822/5930 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5899 event pairs, 19 based on Foata normal form. 2/854 useless extension candidates. Maximal degree in co-relation 5832. Up to 471 conditions per place. [2023-12-05 21:11:05,078 INFO L140 encePairwiseOnDemand]: 186/189 looper letters, 83 selfloop transitions, 2 changer transitions 2/207 dead transitions. [2023-12-05 21:11:05,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 207 transitions, 2106 flow [2023-12-05 21:11:05,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:11:05,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:11:05,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-12-05 21:11:05,080 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7442680776014109 [2023-12-05 21:11:05,080 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-12-05 21:11:05,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-12-05 21:11:05,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:05,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-12-05 21:11:05,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:05,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:05,083 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:05,083 INFO L308 CegarLoopForPetriNet]: 195 programPoint places, -4 predicate places. [2023-12-05 21:11:05,084 INFO L500 AbstractCegarLoop]: Abstraction has has 191 places, 207 transitions, 2106 flow [2023-12-05 21:11:05,084 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:05,084 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:05,084 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:05,084 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:11:05,084 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2023-12-05 21:11:05,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:05,085 INFO L85 PathProgramCache]: Analyzing trace with hash 484182039, now seen corresponding path program 1 times [2023-12-05 21:11:05,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:05,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258903887] [2023-12-05 21:11:05,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:05,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:11:05,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:05,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258903887] [2023-12-05 21:11:05,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258903887] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:05,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:05,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:11:05,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478110999] [2023-12-05 21:11:05,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:05,221 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:11:05,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:05,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:11:05,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:11:05,222 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 189 [2023-12-05 21:11:05,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 207 transitions, 2106 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:05,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:05,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 189 [2023-12-05 21:11:05,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:05,471 INFO L124 PetriNetUnfolderBase]: 304/1017 cut-off events. [2023-12-05 21:11:05,471 INFO L125 PetriNetUnfolderBase]: For 6666/6786 co-relation queries the response was YES. [2023-12-05 21:11:05,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6196 conditions, 1017 events. 304/1017 cut-off events. For 6666/6786 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6085 event pairs, 15 based on Foata normal form. 0/864 useless extension candidates. Maximal degree in co-relation 6033. Up to 471 conditions per place. [2023-12-05 21:11:05,487 INFO L140 encePairwiseOnDemand]: 185/189 looper letters, 75 selfloop transitions, 14 changer transitions 13/244 dead transitions. [2023-12-05 21:11:05,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 244 transitions, 3133 flow [2023-12-05 21:11:05,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:11:05,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:11:05,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 481 transitions. [2023-12-05 21:11:05,489 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8483245149911817 [2023-12-05 21:11:05,490 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 481 transitions. [2023-12-05 21:11:05,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 481 transitions. [2023-12-05 21:11:05,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:05,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 481 transitions. [2023-12-05 21:11:05,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:05,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:05,492 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:05,493 INFO L308 CegarLoopForPetriNet]: 195 programPoint places, -2 predicate places. [2023-12-05 21:11:05,493 INFO L500 AbstractCegarLoop]: Abstraction has has 193 places, 244 transitions, 3133 flow [2023-12-05 21:11:05,493 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:05,493 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:05,494 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:05,494 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:11:05,494 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2023-12-05 21:11:05,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:05,494 INFO L85 PathProgramCache]: Analyzing trace with hash 633793060, now seen corresponding path program 1 times [2023-12-05 21:11:05,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:05,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916603004] [2023-12-05 21:11:05,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:05,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:05,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:11:05,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:05,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916603004] [2023-12-05 21:11:05,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916603004] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:05,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:05,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:11:05,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70479785] [2023-12-05 21:11:05,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:05,788 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:11:05,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:05,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:11:05,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:11:05,790 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 189 [2023-12-05 21:11:05,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 244 transitions, 3133 flow. Second operand has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:05,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:05,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 189 [2023-12-05 21:11:05,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:06,115 INFO L124 PetriNetUnfolderBase]: 302/992 cut-off events. [2023-12-05 21:11:06,115 INFO L125 PetriNetUnfolderBase]: For 7825/7957 co-relation queries the response was YES. [2023-12-05 21:11:06,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6488 conditions, 992 events. 302/992 cut-off events. For 7825/7957 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5785 event pairs, 13 based on Foata normal form. 0/842 useless extension candidates. Maximal degree in co-relation 6315. Up to 471 conditions per place. [2023-12-05 21:11:06,132 INFO L140 encePairwiseOnDemand]: 186/189 looper letters, 93 selfloop transitions, 14 changer transitions 13/249 dead transitions. [2023-12-05 21:11:06,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 249 transitions, 3481 flow [2023-12-05 21:11:06,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:11:06,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:11:06,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 581 transitions. [2023-12-05 21:11:06,134 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7685185185185185 [2023-12-05 21:11:06,134 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 581 transitions. [2023-12-05 21:11:06,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 581 transitions. [2023-12-05 21:11:06,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:06,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 581 transitions. [2023-12-05 21:11:06,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:06,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:06,139 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:06,139 INFO L308 CegarLoopForPetriNet]: 195 programPoint places, 0 predicate places. [2023-12-05 21:11:06,139 INFO L500 AbstractCegarLoop]: Abstraction has has 195 places, 249 transitions, 3481 flow [2023-12-05 21:11:06,140 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:06,140 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:06,140 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:06,140 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:11:06,140 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2023-12-05 21:11:06,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:06,141 INFO L85 PathProgramCache]: Analyzing trace with hash 633793059, now seen corresponding path program 1 times [2023-12-05 21:11:06,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:06,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169850493] [2023-12-05 21:11:06,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:06,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:06,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:11:06,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:06,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169850493] [2023-12-05 21:11:06,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169850493] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:06,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:06,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:11:06,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000712639] [2023-12-05 21:11:06,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:06,261 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:11:06,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:06,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:11:06,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:11:06,263 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 189 [2023-12-05 21:11:06,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 249 transitions, 3481 flow. Second operand has 5 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:06,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:06,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 189 [2023-12-05 21:11:06,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:06,575 INFO L124 PetriNetUnfolderBase]: 300/987 cut-off events. [2023-12-05 21:11:06,575 INFO L125 PetriNetUnfolderBase]: For 9301/9445 co-relation queries the response was YES. [2023-12-05 21:11:06,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6881 conditions, 987 events. 300/987 cut-off events. For 9301/9445 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5745 event pairs, 11 based on Foata normal form. 0/840 useless extension candidates. Maximal degree in co-relation 6697. Up to 471 conditions per place. [2023-12-05 21:11:06,593 INFO L140 encePairwiseOnDemand]: 181/189 looper letters, 99 selfloop transitions, 21 changer transitions 14/255 dead transitions. [2023-12-05 21:11:06,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 255 transitions, 3821 flow [2023-12-05 21:11:06,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:11:06,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:11:06,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 574 transitions. [2023-12-05 21:11:06,595 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7592592592592593 [2023-12-05 21:11:06,595 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 574 transitions. [2023-12-05 21:11:06,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 574 transitions. [2023-12-05 21:11:06,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:06,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 574 transitions. [2023-12-05 21:11:06,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:06,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:06,599 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:06,600 INFO L308 CegarLoopForPetriNet]: 195 programPoint places, 2 predicate places. [2023-12-05 21:11:06,600 INFO L500 AbstractCegarLoop]: Abstraction has has 197 places, 255 transitions, 3821 flow [2023-12-05 21:11:06,600 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:06,600 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:06,601 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:06,601 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:11:06,601 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2023-12-05 21:11:06,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:06,601 INFO L85 PathProgramCache]: Analyzing trace with hash -474902053, now seen corresponding path program 1 times [2023-12-05 21:11:06,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:06,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831065497] [2023-12-05 21:11:06,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:06,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:06,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:11:06,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:06,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831065497] [2023-12-05 21:11:06,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831065497] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:06,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:06,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:11:06,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484305863] [2023-12-05 21:11:06,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:06,866 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:11:06,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:06,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:11:06,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:11:06,867 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 189 [2023-12-05 21:11:06,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 255 transitions, 3821 flow. Second operand has 7 states, 7 states have (on average 129.28571428571428) internal successors, (905), 7 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:06,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:06,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 189 [2023-12-05 21:11:06,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:07,198 INFO L124 PetriNetUnfolderBase]: 258/895 cut-off events. [2023-12-05 21:11:07,199 INFO L125 PetriNetUnfolderBase]: For 10410/10566 co-relation queries the response was YES. [2023-12-05 21:11:07,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6511 conditions, 895 events. 258/895 cut-off events. For 10410/10566 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5026 event pairs, 11 based on Foata normal form. 0/778 useless extension candidates. Maximal degree in co-relation 6316. Up to 412 conditions per place. [2023-12-05 21:11:07,215 INFO L140 encePairwiseOnDemand]: 175/189 looper letters, 96 selfloop transitions, 28 changer transitions 16/257 dead transitions. [2023-12-05 21:11:07,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 257 transitions, 4157 flow [2023-12-05 21:11:07,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 21:11:07,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 21:11:07,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 810 transitions. [2023-12-05 21:11:07,218 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2023-12-05 21:11:07,218 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 810 transitions. [2023-12-05 21:11:07,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 810 transitions. [2023-12-05 21:11:07,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:07,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 810 transitions. [2023-12-05 21:11:07,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.0) internal successors, (810), 6 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:07,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:07,222 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:07,223 INFO L308 CegarLoopForPetriNet]: 195 programPoint places, 7 predicate places. [2023-12-05 21:11:07,223 INFO L500 AbstractCegarLoop]: Abstraction has has 202 places, 257 transitions, 4157 flow [2023-12-05 21:11:07,223 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 129.28571428571428) internal successors, (905), 7 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:07,223 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:07,223 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:07,224 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:11:07,224 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2023-12-05 21:11:07,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:07,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1114540171, now seen corresponding path program 1 times [2023-12-05 21:11:07,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:07,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721004222] [2023-12-05 21:11:07,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:07,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:07,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:11:07,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:07,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721004222] [2023-12-05 21:11:07,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721004222] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:07,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:07,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-05 21:11:07,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164594507] [2023-12-05 21:11:07,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:07,607 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-05 21:11:07,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:07,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-05 21:11:07,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-05 21:11:07,610 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 189 [2023-12-05 21:11:07,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 257 transitions, 4157 flow. Second operand has 9 states, 9 states have (on average 126.77777777777777) internal successors, (1141), 9 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:07,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:07,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 189 [2023-12-05 21:11:07,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:07,975 INFO L124 PetriNetUnfolderBase]: 216/801 cut-off events. [2023-12-05 21:11:07,976 INFO L125 PetriNetUnfolderBase]: For 10803/10971 co-relation queries the response was YES. [2023-12-05 21:11:07,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6049 conditions, 801 events. 216/801 cut-off events. For 10803/10971 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4270 event pairs, 11 based on Foata normal form. 0/714 useless extension candidates. Maximal degree in co-relation 5843. Up to 353 conditions per place. [2023-12-05 21:11:07,988 INFO L140 encePairwiseOnDemand]: 174/189 looper letters, 100 selfloop transitions, 25 changer transitions 18/259 dead transitions. [2023-12-05 21:11:07,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 259 transitions, 4503 flow [2023-12-05 21:11:07,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:11:07,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:11:07,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1050 transitions. [2023-12-05 21:11:07,991 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2023-12-05 21:11:07,992 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1050 transitions. [2023-12-05 21:11:07,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1050 transitions. [2023-12-05 21:11:07,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:07,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1050 transitions. [2023-12-05 21:11:07,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 131.25) internal successors, (1050), 8 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:07,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 189.0) internal successors, (1701), 9 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:07,998 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 189.0) internal successors, (1701), 9 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:07,999 INFO L308 CegarLoopForPetriNet]: 195 programPoint places, 14 predicate places. [2023-12-05 21:11:07,999 INFO L500 AbstractCegarLoop]: Abstraction has has 209 places, 259 transitions, 4503 flow [2023-12-05 21:11:07,999 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 126.77777777777777) internal successors, (1141), 9 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:07,999 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:07,999 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:08,000 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-05 21:11:08,000 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2023-12-05 21:11:08,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:08,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1628414447, now seen corresponding path program 1 times [2023-12-05 21:11:08,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:08,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423129710] [2023-12-05 21:11:08,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:08,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:08,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:11:08,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:08,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423129710] [2023-12-05 21:11:08,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423129710] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:08,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:08,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-05 21:11:08,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730551041] [2023-12-05 21:11:08,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:08,532 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-05 21:11:08,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:08,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-05 21:11:08,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-12-05 21:11:08,534 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 189 [2023-12-05 21:11:08,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 259 transitions, 4503 flow. Second operand has 13 states, 13 states have (on average 122.15384615384616) internal successors, (1588), 13 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:08,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:08,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 189 [2023-12-05 21:11:08,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:09,232 INFO L124 PetriNetUnfolderBase]: 342/1174 cut-off events. [2023-12-05 21:11:09,233 INFO L125 PetriNetUnfolderBase]: For 16906/17723 co-relation queries the response was YES. [2023-12-05 21:11:09,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9337 conditions, 1174 events. 342/1174 cut-off events. For 16906/17723 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7216 event pairs, 9 based on Foata normal form. 2/1079 useless extension candidates. Maximal degree in co-relation 9119. Up to 486 conditions per place. [2023-12-05 21:11:09,255 INFO L140 encePairwiseOnDemand]: 167/189 looper letters, 160 selfloop transitions, 70 changer transitions 34/377 dead transitions. [2023-12-05 21:11:09,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 377 transitions, 8105 flow [2023-12-05 21:11:09,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-05 21:11:09,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-12-05 21:11:09,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2392 transitions. [2023-12-05 21:11:09,302 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6661097187412977 [2023-12-05 21:11:09,303 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2392 transitions. [2023-12-05 21:11:09,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2392 transitions. [2023-12-05 21:11:09,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:09,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2392 transitions. [2023-12-05 21:11:09,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 125.89473684210526) internal successors, (2392), 19 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:09,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 189.0) internal successors, (3780), 20 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:09,315 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 189.0) internal successors, (3780), 20 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:09,316 INFO L308 CegarLoopForPetriNet]: 195 programPoint places, 32 predicate places. [2023-12-05 21:11:09,316 INFO L500 AbstractCegarLoop]: Abstraction has has 227 places, 377 transitions, 8105 flow [2023-12-05 21:11:09,317 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 122.15384615384616) internal successors, (1588), 13 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:09,317 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:09,317 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:09,317 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-05 21:11:09,317 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2023-12-05 21:11:09,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:09,318 INFO L85 PathProgramCache]: Analyzing trace with hash 295033424, now seen corresponding path program 1 times [2023-12-05 21:11:09,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:09,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741496010] [2023-12-05 21:11:09,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:09,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:11:09,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:09,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741496010] [2023-12-05 21:11:09,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741496010] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:09,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:09,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-05 21:11:09,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676753580] [2023-12-05 21:11:09,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:09,825 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-05 21:11:09,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:09,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-05 21:11:09,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-12-05 21:11:09,828 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 189 [2023-12-05 21:11:09,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 377 transitions, 8105 flow. Second operand has 13 states, 13 states have (on average 122.15384615384616) internal successors, (1588), 13 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:09,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:09,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 189 [2023-12-05 21:11:09,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:11,121 INFO L124 PetriNetUnfolderBase]: 1081/3215 cut-off events. [2023-12-05 21:11:11,121 INFO L125 PetriNetUnfolderBase]: For 51052/53994 co-relation queries the response was YES. [2023-12-05 21:11:11,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24361 conditions, 3215 events. 1081/3215 cut-off events. For 51052/53994 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 26441 event pairs, 26 based on Foata normal form. 12/3054 useless extension candidates. Maximal degree in co-relation 24131. Up to 1121 conditions per place. [2023-12-05 21:11:11,174 INFO L140 encePairwiseOnDemand]: 167/189 looper letters, 431 selfloop transitions, 154 changer transitions 96/799 dead transitions. [2023-12-05 21:11:11,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 799 transitions, 21994 flow [2023-12-05 21:11:11,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-05 21:11:11,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-12-05 21:11:11,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2424 transitions. [2023-12-05 21:11:11,180 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6750208855472013 [2023-12-05 21:11:11,180 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2424 transitions. [2023-12-05 21:11:11,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2424 transitions. [2023-12-05 21:11:11,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:11,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2424 transitions. [2023-12-05 21:11:11,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 127.57894736842105) internal successors, (2424), 19 states have internal predecessors, (2424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:11,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 189.0) internal successors, (3780), 20 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:11,192 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 189.0) internal successors, (3780), 20 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:11,192 INFO L308 CegarLoopForPetriNet]: 195 programPoint places, 50 predicate places. [2023-12-05 21:11:11,192 INFO L500 AbstractCegarLoop]: Abstraction has has 245 places, 799 transitions, 21994 flow [2023-12-05 21:11:11,193 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 122.15384615384616) internal successors, (1588), 13 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:11,193 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:11,193 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:11,193 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-05 21:11:11,193 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2023-12-05 21:11:11,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:11,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1541561659, now seen corresponding path program 1 times [2023-12-05 21:11:11,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:11,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824393115] [2023-12-05 21:11:11,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:11,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:11,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:11:11,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:11,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824393115] [2023-12-05 21:11:11,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824393115] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:11,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:11,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-05 21:11:11,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107577497] [2023-12-05 21:11:11,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:11,944 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-05 21:11:11,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:11,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-05 21:11:11,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-05 21:11:11,946 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 189 [2023-12-05 21:11:11,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 799 transitions, 21994 flow. Second operand has 13 states, 13 states have (on average 122.23076923076923) internal successors, (1589), 13 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:11,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:11,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 189 [2023-12-05 21:11:11,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:12,977 INFO L124 PetriNetUnfolderBase]: 907/2592 cut-off events. [2023-12-05 21:11:12,978 INFO L125 PetriNetUnfolderBase]: For 47572/54543 co-relation queries the response was YES. [2023-12-05 21:11:12,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21291 conditions, 2592 events. 907/2592 cut-off events. For 47572/54543 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 19550 event pairs, 12 based on Foata normal form. 4/2550 useless extension candidates. Maximal degree in co-relation 21050. Up to 880 conditions per place. [2023-12-05 21:11:13,006 INFO L140 encePairwiseOnDemand]: 175/189 looper letters, 0 selfloop transitions, 0 changer transitions 760/760 dead transitions. [2023-12-05 21:11:13,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 760 transitions, 21858 flow [2023-12-05 21:11:13,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-05 21:11:13,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-05 21:11:13,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1380 transitions. [2023-12-05 21:11:13,010 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6637806637806638 [2023-12-05 21:11:13,010 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1380 transitions. [2023-12-05 21:11:13,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1380 transitions. [2023-12-05 21:11:13,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:13,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1380 transitions. [2023-12-05 21:11:13,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 125.45454545454545) internal successors, (1380), 11 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:13,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 189.0) internal successors, (2268), 12 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:13,018 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 189.0) internal successors, (2268), 12 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:13,019 INFO L308 CegarLoopForPetriNet]: 195 programPoint places, 56 predicate places. [2023-12-05 21:11:13,019 INFO L500 AbstractCegarLoop]: Abstraction has has 251 places, 760 transitions, 21858 flow [2023-12-05 21:11:13,020 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 122.23076923076923) internal successors, (1589), 13 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:13,033 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/thin002_rmo.i_BEv2_AllErrorsAtOnce [2023-12-05 21:11:13,101 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 54 remaining) [2023-12-05 21:11:13,101 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 54 remaining) [2023-12-05 21:11:13,101 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 54 remaining) [2023-12-05 21:11:13,101 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 54 remaining) [2023-12-05 21:11:13,102 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 54 remaining) [2023-12-05 21:11:13,102 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 54 remaining) [2023-12-05 21:11:13,102 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 54 remaining) [2023-12-05 21:11:13,102 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 54 remaining) [2023-12-05 21:11:13,102 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 54 remaining) [2023-12-05 21:11:13,102 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 54 remaining) [2023-12-05 21:11:13,102 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 54 remaining) [2023-12-05 21:11:13,102 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 54 remaining) [2023-12-05 21:11:13,103 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 54 remaining) [2023-12-05 21:11:13,103 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 54 remaining) [2023-12-05 21:11:13,103 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 54 remaining) [2023-12-05 21:11:13,103 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 54 remaining) [2023-12-05 21:11:13,103 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 54 remaining) [2023-12-05 21:11:13,103 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 54 remaining) [2023-12-05 21:11:13,103 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 54 remaining) [2023-12-05 21:11:13,103 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 54 remaining) [2023-12-05 21:11:13,103 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 54 remaining) [2023-12-05 21:11:13,103 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 54 remaining) [2023-12-05 21:11:13,104 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 54 remaining) [2023-12-05 21:11:13,104 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 54 remaining) [2023-12-05 21:11:13,104 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 54 remaining) [2023-12-05 21:11:13,104 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 54 remaining) [2023-12-05 21:11:13,104 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 54 remaining) [2023-12-05 21:11:13,104 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 54 remaining) [2023-12-05 21:11:13,104 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 54 remaining) [2023-12-05 21:11:13,104 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 54 remaining) [2023-12-05 21:11:13,104 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 54 remaining) [2023-12-05 21:11:13,105 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 54 remaining) [2023-12-05 21:11:13,105 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 54 remaining) [2023-12-05 21:11:13,105 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 54 remaining) [2023-12-05 21:11:13,105 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 54 remaining) [2023-12-05 21:11:13,105 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 54 remaining) [2023-12-05 21:11:13,105 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 54 remaining) [2023-12-05 21:11:13,105 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 54 remaining) [2023-12-05 21:11:13,105 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 54 remaining) [2023-12-05 21:11:13,105 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 54 remaining) [2023-12-05 21:11:13,106 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 54 remaining) [2023-12-05 21:11:13,106 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 54 remaining) [2023-12-05 21:11:13,106 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 54 remaining) [2023-12-05 21:11:13,106 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 54 remaining) [2023-12-05 21:11:13,106 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 54 remaining) [2023-12-05 21:11:13,106 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 54 remaining) [2023-12-05 21:11:13,106 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 54 remaining) [2023-12-05 21:11:13,106 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 54 remaining) [2023-12-05 21:11:13,106 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 54 remaining) [2023-12-05 21:11:13,107 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 54 remaining) [2023-12-05 21:11:13,107 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 54 remaining) [2023-12-05 21:11:13,107 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 54 remaining) [2023-12-05 21:11:13,107 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 54 remaining) [2023-12-05 21:11:13,107 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 54 remaining) [2023-12-05 21:11:13,107 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-05 21:11:13,108 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:13,113 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:11:13,113 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:11:13,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:11:13 BasicIcfg [2023-12-05 21:11:13,118 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:11:13,119 INFO L158 Benchmark]: Toolchain (without parser) took 15590.57ms. Allocated memory was 259.0MB in the beginning and 1.0GB in the end (delta: 781.2MB). Free memory was 206.1MB in the beginning and 360.5MB in the end (delta: -154.4MB). Peak memory consumption was 627.3MB. Max. memory is 8.0GB. [2023-12-05 21:11:13,119 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 183.5MB. Free memory is still 136.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:11:13,119 INFO L158 Benchmark]: CACSL2BoogieTranslator took 545.68ms. Allocated memory is still 259.0MB. Free memory was 205.6MB in the beginning and 182.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-12-05 21:11:13,120 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.99ms. Allocated memory is still 259.0MB. Free memory was 182.0MB in the beginning and 179.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:11:13,120 INFO L158 Benchmark]: Boogie Preprocessor took 62.49ms. Allocated memory is still 259.0MB. Free memory was 179.9MB in the beginning and 177.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:11:13,120 INFO L158 Benchmark]: RCFGBuilder took 975.44ms. Allocated memory is still 259.0MB. Free memory was 177.3MB in the beginning and 90.8MB in the end (delta: 86.5MB). Peak memory consumption was 86.0MB. Max. memory is 8.0GB. [2023-12-05 21:11:13,120 INFO L158 Benchmark]: TraceAbstraction took 13941.27ms. Allocated memory was 259.0MB in the beginning and 1.0GB in the end (delta: 781.2MB). Free memory was 90.2MB in the beginning and 360.5MB in the end (delta: -270.3MB). Peak memory consumption was 510.9MB. Max. memory is 8.0GB. [2023-12-05 21:11:13,121 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 183.5MB. Free memory is still 136.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 545.68ms. Allocated memory is still 259.0MB. Free memory was 205.6MB in the beginning and 182.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.99ms. Allocated memory is still 259.0MB. Free memory was 182.0MB in the beginning and 179.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 62.49ms. Allocated memory is still 259.0MB. Free memory was 179.9MB in the beginning and 177.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 975.44ms. Allocated memory is still 259.0MB. Free memory was 177.3MB in the beginning and 90.8MB in the end (delta: 86.5MB). Peak memory consumption was 86.0MB. Max. memory is 8.0GB. * TraceAbstraction took 13941.27ms. Allocated memory was 259.0MB in the beginning and 1.0GB in the end (delta: 781.2MB). Free memory was 90.2MB in the beginning and 360.5MB in the end (delta: -270.3MB). Peak memory consumption was 510.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 241 locations, 54 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: 13.8s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 830 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 830 mSDsluCounter, 352 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 141 mSDsCounter, 236 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1724 IncrementalHoareTripleChecker+Invalid, 1960 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 236 mSolverCounterUnsat, 211 mSDtfsCounter, 1724 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21994occurred in iteration=17, InterpolantAutomatonStates: 109, 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.9s InterpolantComputationTime, 1577 NumberOfCodeBlocks, 1577 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1559 ConstructedInterpolants, 0 QuantifiedInterpolants, 8453 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 32 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:11:13,150 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...