/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/safe019_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:09:59,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:09:59,715 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:09:59,746 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:09:59,747 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:09:59,747 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:09:59,748 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:09:59,748 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:09:59,748 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:09:59,752 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:09:59,753 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:09:59,753 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:09:59,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:09:59,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:09:59,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:09:59,754 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:09:59,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:09:59,755 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:09:59,755 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:09:59,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:09:59,755 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:09:59,756 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:09:59,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:09:59,757 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:09:59,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:09:59,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:09:59,757 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:09:59,757 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:09:59,758 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:09:59,758 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:09:59,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:09:59,759 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:09:59,759 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:09:59,759 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:00,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:10:00,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:10:00,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:10:00,029 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:10:00,030 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:10:00,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_rmo.oepc.i [2023-12-05 21:10:01,144 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:10:01,388 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:10:01,389 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_rmo.oepc.i [2023-12-05 21:10:01,404 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85e038812/2327cac3752443fbbc40e9ccfa4f59cd/FLAG641a0b1d5 [2023-12-05 21:10:01,415 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85e038812/2327cac3752443fbbc40e9ccfa4f59cd [2023-12-05 21:10:01,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:10:01,418 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:10:01,419 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:10:01,419 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:10:01,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:10:01,423 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:10:01" (1/1) ... [2023-12-05 21:10:01,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40ffd535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:01, skipping insertion in model container [2023-12-05 21:10:01,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:10:01" (1/1) ... [2023-12-05 21:10:01,475 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:10:01,826 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:10:01,841 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:10:01,925 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:10:01,951 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:10:01,951 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:10:01,957 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:10:01,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:01 WrapperNode [2023-12-05 21:10:01,958 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:10:01,959 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:10:01,959 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:10:01,959 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:10:01,965 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:01" (1/1) ... [2023-12-05 21:10:01,994 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:01" (1/1) ... [2023-12-05 21:10:02,028 INFO L138 Inliner]: procedures = 177, calls = 86, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 187 [2023-12-05 21:10:02,029 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:10:02,029 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:10:02,029 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:10:02,030 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:10:02,037 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:01" (1/1) ... [2023-12-05 21:10:02,038 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:01" (1/1) ... [2023-12-05 21:10:02,042 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:01" (1/1) ... [2023-12-05 21:10:02,042 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:01" (1/1) ... [2023-12-05 21:10:02,052 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:01" (1/1) ... [2023-12-05 21:10:02,054 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:01" (1/1) ... [2023-12-05 21:10:02,057 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:01" (1/1) ... [2023-12-05 21:10:02,058 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:01" (1/1) ... [2023-12-05 21:10:02,063 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:10:02,064 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:10:02,064 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:10:02,064 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:10:02,065 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:01" (1/1) ... [2023-12-05 21:10:02,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:10:02,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:10:02,103 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:02,112 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:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:10:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:10:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:10:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:10:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:10:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:10:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-05 21:10:02,137 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-05 21:10:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-05 21:10:02,137 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-05 21:10:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-05 21:10:02,138 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-05 21:10:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-12-05 21:10:02,138 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-12-05 21:10:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:10:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:10:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:10:02,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:10:02,140 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:02,311 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:10:02,313 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:10:02,816 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:10:03,192 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:10:03,192 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:10:03,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:10:03 BoogieIcfgContainer [2023-12-05 21:10:03,194 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:10:03,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:10:03,196 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:10:03,199 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:10:03,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:10:01" (1/3) ... [2023-12-05 21:10:03,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7031c0d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:10:03, skipping insertion in model container [2023-12-05 21:10:03,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:01" (2/3) ... [2023-12-05 21:10:03,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7031c0d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:10:03, skipping insertion in model container [2023-12-05 21:10:03,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:10:03" (3/3) ... [2023-12-05 21:10:03,202 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_rmo.oepc.i [2023-12-05 21:10:03,219 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:10:03,220 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2023-12-05 21:10:03,220 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:10:03,355 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:10:03,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 212 places, 202 transitions, 420 flow [2023-12-05 21:10:03,509 INFO L124 PetriNetUnfolderBase]: 3/198 cut-off events. [2023-12-05 21:10:03,510 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:10:03,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 198 events. 3/198 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 284 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 140. Up to 2 conditions per place. [2023-12-05 21:10:03,518 INFO L82 GeneralOperation]: Start removeDead. Operand has 212 places, 202 transitions, 420 flow [2023-12-05 21:10:03,531 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 208 places, 198 transitions, 408 flow [2023-12-05 21:10:03,546 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:10:03,554 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;@73ddb67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:10:03,555 INFO L363 AbstractCegarLoop]: Starting to check reachability of 78 error locations. [2023-12-05 21:10:03,576 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:10:03,577 INFO L124 PetriNetUnfolderBase]: 0/61 cut-off events. [2023-12-05 21:10:03,577 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:10:03,577 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:03,578 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] [2023-12-05 21:10:03,578 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:03,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:03,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1845777158, now seen corresponding path program 1 times [2023-12-05 21:10:03,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:03,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762938938] [2023-12-05 21:10:03,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:03,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:03,940 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:03,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:03,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762938938] [2023-12-05 21:10:03,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762938938] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:03,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:03,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:03,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541576346] [2023-12-05 21:10:03,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:03,954 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:03,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:03,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:03,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:03,992 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 202 [2023-12-05 21:10:03,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 198 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:03,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:03,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 202 [2023-12-05 21:10:03,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:09,199 INFO L124 PetriNetUnfolderBase]: 13860/25692 cut-off events. [2023-12-05 21:10:09,208 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-12-05 21:10:09,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45340 conditions, 25692 events. 13860/25692 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 1942. Compared 233786 event pairs, 8946 based on Foata normal form. 684/12786 useless extension candidates. Maximal degree in co-relation 45260. Up to 12689 conditions per place. [2023-12-05 21:10:09,511 INFO L140 encePairwiseOnDemand]: 176/202 looper letters, 73 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2023-12-05 21:10:09,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 190 transitions, 542 flow [2023-12-05 21:10:09,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:09,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:09,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2023-12-05 21:10:09,530 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7788778877887789 [2023-12-05 21:10:09,531 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 472 transitions. [2023-12-05 21:10:09,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions. [2023-12-05 21:10:09,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:09,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions. [2023-12-05 21:10:09,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:09,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:09,548 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:09,552 INFO L308 CegarLoopForPetriNet]: 208 programPoint places, -22 predicate places. [2023-12-05 21:10:09,552 INFO L500 AbstractCegarLoop]: Abstraction has has 186 places, 190 transitions, 542 flow [2023-12-05 21:10:09,553 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:09,554 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:09,554 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] [2023-12-05 21:10:09,554 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:10:09,554 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:09,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:09,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1845777157, now seen corresponding path program 1 times [2023-12-05 21:10:09,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:09,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768621719] [2023-12-05 21:10:09,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:09,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:09,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:10:09,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:09,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768621719] [2023-12-05 21:10:09,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768621719] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:09,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:09,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:09,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492313184] [2023-12-05 21:10:09,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:09,790 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:09,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:09,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:09,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:09,792 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 202 [2023-12-05 21:10:09,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 190 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:09,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:09,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 202 [2023-12-05 21:10:09,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:14,598 INFO L124 PetriNetUnfolderBase]: 13925/25796 cut-off events. [2023-12-05 21:10:14,598 INFO L125 PetriNetUnfolderBase]: For 1797/4521 co-relation queries the response was YES. [2023-12-05 21:10:14,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64152 conditions, 25796 events. 13925/25796 cut-off events. For 1797/4521 co-relation queries the response was YES. Maximal size of possible extension queue 1942. Compared 234588 event pairs, 9011 based on Foata normal form. 0/12159 useless extension candidates. Maximal degree in co-relation 64066. Up to 13896 conditions per place. [2023-12-05 21:10:15,060 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 87 selfloop transitions, 2 changer transitions 0/208 dead transitions. [2023-12-05 21:10:15,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 208 transitions, 792 flow [2023-12-05 21:10:15,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:15,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:15,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-12-05 21:10:15,062 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.735973597359736 [2023-12-05 21:10:15,062 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-12-05 21:10:15,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-12-05 21:10:15,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:15,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-12-05 21:10:15,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:15,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:15,066 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:15,067 INFO L308 CegarLoopForPetriNet]: 208 programPoint places, -21 predicate places. [2023-12-05 21:10:15,067 INFO L500 AbstractCegarLoop]: Abstraction has has 187 places, 208 transitions, 792 flow [2023-12-05 21:10:15,068 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:15,068 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:15,068 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:15,068 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:10:15,068 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:15,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:15,069 INFO L85 PathProgramCache]: Analyzing trace with hash 919845875, now seen corresponding path program 1 times [2023-12-05 21:10:15,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:15,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060921244] [2023-12-05 21:10:15,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:15,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:15,267 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:15,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:15,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060921244] [2023-12-05 21:10:15,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060921244] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:15,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:15,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:10:15,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178540087] [2023-12-05 21:10:15,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:15,274 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:10:15,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:15,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:10:15,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:10:15,277 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 202 [2023-12-05 21:10:15,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 208 transitions, 792 flow. Second operand has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:15,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:15,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 202 [2023-12-05 21:10:15,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:17,955 INFO L124 PetriNetUnfolderBase]: 8985/18194 cut-off events. [2023-12-05 21:10:17,955 INFO L125 PetriNetUnfolderBase]: For 3603/5425 co-relation queries the response was YES. [2023-12-05 21:10:18,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56704 conditions, 18194 events. 8985/18194 cut-off events. For 3603/5425 co-relation queries the response was YES. Maximal size of possible extension queue 1009. Compared 171672 event pairs, 2257 based on Foata normal form. 0/11143 useless extension candidates. Maximal degree in co-relation 56607. Up to 10365 conditions per place. [2023-12-05 21:10:18,156 INFO L140 encePairwiseOnDemand]: 180/202 looper letters, 96 selfloop transitions, 18 changer transitions 0/227 dead transitions. [2023-12-05 21:10:18,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 227 transitions, 1128 flow [2023-12-05 21:10:18,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:10:18,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:10:18,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 971 transitions. [2023-12-05 21:10:18,159 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6867043847241867 [2023-12-05 21:10:18,159 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 971 transitions. [2023-12-05 21:10:18,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 971 transitions. [2023-12-05 21:10:18,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:18,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 971 transitions. [2023-12-05 21:10:18,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 138.71428571428572) internal successors, (971), 7 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:18,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:18,165 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:18,167 INFO L308 CegarLoopForPetriNet]: 208 programPoint places, -18 predicate places. [2023-12-05 21:10:18,167 INFO L500 AbstractCegarLoop]: Abstraction has has 190 places, 227 transitions, 1128 flow [2023-12-05 21:10:18,167 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:18,167 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:18,167 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:18,168 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:10:18,168 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:18,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:18,169 INFO L85 PathProgramCache]: Analyzing trace with hash 919845876, now seen corresponding path program 1 times [2023-12-05 21:10:18,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:18,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310837803] [2023-12-05 21:10:18,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:18,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:18,349 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:18,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:18,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310837803] [2023-12-05 21:10:18,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310837803] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:18,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:18,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:10:18,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266027806] [2023-12-05 21:10:18,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:18,350 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:10:18,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:18,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:10:18,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:10:18,356 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 202 [2023-12-05 21:10:18,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 227 transitions, 1128 flow. Second operand has 5 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:18,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:18,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 202 [2023-12-05 21:10:18,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:19,117 INFO L124 PetriNetUnfolderBase]: 1995/5144 cut-off events. [2023-12-05 21:10:19,117 INFO L125 PetriNetUnfolderBase]: For 2463/2945 co-relation queries the response was YES. [2023-12-05 21:10:19,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16630 conditions, 5144 events. 1995/5144 cut-off events. For 2463/2945 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 45987 event pairs, 247 based on Foata normal form. 0/4192 useless extension candidates. Maximal degree in co-relation 16524. Up to 2912 conditions per place. [2023-12-05 21:10:19,159 INFO L140 encePairwiseOnDemand]: 190/202 looper letters, 61 selfloop transitions, 2 changer transitions 0/189 dead transitions. [2023-12-05 21:10:19,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 189 transitions, 950 flow [2023-12-05 21:10:19,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:10:19,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:10:19,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 558 transitions. [2023-12-05 21:10:19,166 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6905940594059405 [2023-12-05 21:10:19,166 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 558 transitions. [2023-12-05 21:10:19,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 558 transitions. [2023-12-05 21:10:19,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:19,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 558 transitions. [2023-12-05 21:10:19,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:19,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:19,173 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:19,175 INFO L308 CegarLoopForPetriNet]: 208 programPoint places, -25 predicate places. [2023-12-05 21:10:19,175 INFO L500 AbstractCegarLoop]: Abstraction has has 183 places, 189 transitions, 950 flow [2023-12-05 21:10:19,176 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:19,176 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:19,176 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] [2023-12-05 21:10:19,176 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:10:19,176 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:19,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:19,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1292208463, now seen corresponding path program 1 times [2023-12-05 21:10:19,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:19,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260842557] [2023-12-05 21:10:19,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:19,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:19,287 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:19,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:19,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260842557] [2023-12-05 21:10:19,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260842557] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:19,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:19,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:19,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098635781] [2023-12-05 21:10:19,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:19,289 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:19,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:19,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:19,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:19,291 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 202 [2023-12-05 21:10:19,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 189 transitions, 950 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:19,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:19,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 202 [2023-12-05 21:10:19,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:20,112 INFO L124 PetriNetUnfolderBase]: 2322/5447 cut-off events. [2023-12-05 21:10:20,113 INFO L125 PetriNetUnfolderBase]: For 6104/6702 co-relation queries the response was YES. [2023-12-05 21:10:20,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21414 conditions, 5447 events. 2322/5447 cut-off events. For 6104/6702 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 46715 event pairs, 178 based on Foata normal form. 2/4356 useless extension candidates. Maximal degree in co-relation 21300. Up to 3240 conditions per place. [2023-12-05 21:10:20,156 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 83 selfloop transitions, 2 changer transitions 0/206 dead transitions. [2023-12-05 21:10:20,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 206 transitions, 1294 flow [2023-12-05 21:10:20,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:20,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2023-12-05 21:10:20,158 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7029702970297029 [2023-12-05 21:10:20,158 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2023-12-05 21:10:20,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2023-12-05 21:10:20,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:20,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2023-12-05 21:10:20,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:20,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:20,162 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:20,162 INFO L308 CegarLoopForPetriNet]: 208 programPoint places, -24 predicate places. [2023-12-05 21:10:20,163 INFO L500 AbstractCegarLoop]: Abstraction has has 184 places, 206 transitions, 1294 flow [2023-12-05 21:10:20,163 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:20,163 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:20,163 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] [2023-12-05 21:10:20,163 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:10:20,163 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:20,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:20,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1292208464, now seen corresponding path program 1 times [2023-12-05 21:10:20,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:20,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570719619] [2023-12-05 21:10:20,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:20,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:20,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:20,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:20,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570719619] [2023-12-05 21:10:20,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570719619] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:20,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:20,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:20,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012758567] [2023-12-05 21:10:20,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:20,207 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:20,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:20,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:20,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:20,209 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 202 [2023-12-05 21:10:20,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 206 transitions, 1294 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:20,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:20,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 202 [2023-12-05 21:10:20,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:21,138 INFO L124 PetriNetUnfolderBase]: 2321/5618 cut-off events. [2023-12-05 21:10:21,139 INFO L125 PetriNetUnfolderBase]: For 8050/8976 co-relation queries the response was YES. [2023-12-05 21:10:21,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25135 conditions, 5618 events. 2321/5618 cut-off events. For 8050/8976 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 49473 event pairs, 178 based on Foata normal form. 2/4527 useless extension candidates. Maximal degree in co-relation 25012. Up to 3244 conditions per place. [2023-12-05 21:10:21,195 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 88 selfloop transitions, 2 changer transitions 0/205 dead transitions. [2023-12-05 21:10:21,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 205 transitions, 1466 flow [2023-12-05 21:10:21,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:21,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:21,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-12-05 21:10:21,201 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6765676567656765 [2023-12-05 21:10:21,201 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-12-05 21:10:21,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-12-05 21:10:21,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:21,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-12-05 21:10:21,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:21,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:21,205 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:21,208 INFO L308 CegarLoopForPetriNet]: 208 programPoint places, -23 predicate places. [2023-12-05 21:10:21,208 INFO L500 AbstractCegarLoop]: Abstraction has has 185 places, 205 transitions, 1466 flow [2023-12-05 21:10:21,209 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:21,209 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:21,209 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] [2023-12-05 21:10:21,209 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:10:21,209 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:21,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:21,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1009140783, now seen corresponding path program 1 times [2023-12-05 21:10:21,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:21,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205665304] [2023-12-05 21:10:21,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:21,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:21,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:21,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:21,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205665304] [2023-12-05 21:10:21,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205665304] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:21,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:21,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:21,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246268810] [2023-12-05 21:10:21,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:21,274 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:21,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:21,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:21,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:21,276 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 202 [2023-12-05 21:10:21,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 205 transitions, 1466 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:21,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:21,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 202 [2023-12-05 21:10:21,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:22,371 INFO L124 PetriNetUnfolderBase]: 2648/6109 cut-off events. [2023-12-05 21:10:22,371 INFO L125 PetriNetUnfolderBase]: For 15336/16590 co-relation queries the response was YES. [2023-12-05 21:10:22,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31470 conditions, 6109 events. 2648/6109 cut-off events. For 15336/16590 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 53004 event pairs, 254 based on Foata normal form. 2/4874 useless extension candidates. Maximal degree in co-relation 31338. Up to 3581 conditions per place. [2023-12-05 21:10:22,425 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 89 selfloop transitions, 2 changer transitions 0/205 dead transitions. [2023-12-05 21:10:22,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 205 transitions, 1654 flow [2023-12-05 21:10:22,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:22,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:22,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-12-05 21:10:22,427 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6765676567656765 [2023-12-05 21:10:22,427 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-12-05 21:10:22,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-12-05 21:10:22,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:22,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-12-05 21:10:22,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:22,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:22,430 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:22,430 INFO L308 CegarLoopForPetriNet]: 208 programPoint places, -22 predicate places. [2023-12-05 21:10:22,431 INFO L500 AbstractCegarLoop]: Abstraction has has 186 places, 205 transitions, 1654 flow [2023-12-05 21:10:22,431 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:22,431 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:22,431 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] [2023-12-05 21:10:22,431 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:10:22,431 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:22,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:22,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1009140782, now seen corresponding path program 1 times [2023-12-05 21:10:22,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:22,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023123066] [2023-12-05 21:10:22,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:22,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:22,520 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:22,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:22,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023123066] [2023-12-05 21:10:22,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023123066] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:22,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:22,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:22,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620328565] [2023-12-05 21:10:22,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:22,521 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:22,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:22,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:22,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:22,522 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 202 [2023-12-05 21:10:22,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 205 transitions, 1654 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:22,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:22,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 202 [2023-12-05 21:10:22,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:23,502 INFO L124 PetriNetUnfolderBase]: 2647/5936 cut-off events. [2023-12-05 21:10:23,502 INFO L125 PetriNetUnfolderBase]: For 20219/21801 co-relation queries the response was YES. [2023-12-05 21:10:23,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34780 conditions, 5936 events. 2647/5936 cut-off events. For 20219/21801 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 49899 event pairs, 178 based on Foata normal form. 2/4701 useless extension candidates. Maximal degree in co-relation 34640. Up to 3581 conditions per place. [2023-12-05 21:10:23,572 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 99 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2023-12-05 21:10:23,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 221 transitions, 2118 flow [2023-12-05 21:10:23,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:23,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:23,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-12-05 21:10:23,574 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6996699669966997 [2023-12-05 21:10:23,574 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-12-05 21:10:23,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-12-05 21:10:23,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:23,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-12-05 21:10:23,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:23,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:23,576 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:23,577 INFO L308 CegarLoopForPetriNet]: 208 programPoint places, -21 predicate places. [2023-12-05 21:10:23,577 INFO L500 AbstractCegarLoop]: Abstraction has has 187 places, 221 transitions, 2118 flow [2023-12-05 21:10:23,577 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:23,577 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:23,578 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:23,578 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:10:23,578 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:23,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:23,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1082827525, now seen corresponding path program 1 times [2023-12-05 21:10:23,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:23,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403657096] [2023-12-05 21:10:23,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:23,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:23,633 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:23,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:23,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403657096] [2023-12-05 21:10:23,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403657096] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:23,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:23,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:23,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71239125] [2023-12-05 21:10:23,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:23,635 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:23,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:23,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:23,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:23,636 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 202 [2023-12-05 21:10:23,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 221 transitions, 2118 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:23,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:23,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 202 [2023-12-05 21:10:23,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:24,799 INFO L124 PetriNetUnfolderBase]: 2968/6443 cut-off events. [2023-12-05 21:10:24,799 INFO L125 PetriNetUnfolderBase]: For 33579/34263 co-relation queries the response was YES. [2023-12-05 21:10:24,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42037 conditions, 6443 events. 2968/6443 cut-off events. For 33579/34263 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 54101 event pairs, 178 based on Foata normal form. 6/5081 useless extension candidates. Maximal degree in co-relation 41888. Up to 3924 conditions per place. [2023-12-05 21:10:24,874 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 108 selfloop transitions, 2 changer transitions 0/223 dead transitions. [2023-12-05 21:10:24,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 223 transitions, 2382 flow [2023-12-05 21:10:24,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:24,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:24,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2023-12-05 21:10:24,875 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6749174917491749 [2023-12-05 21:10:24,876 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 409 transitions. [2023-12-05 21:10:24,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions. [2023-12-05 21:10:24,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:24,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions. [2023-12-05 21:10:24,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:24,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:24,879 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:24,879 INFO L308 CegarLoopForPetriNet]: 208 programPoint places, -20 predicate places. [2023-12-05 21:10:24,879 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 223 transitions, 2382 flow [2023-12-05 21:10:24,880 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:24,880 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:24,880 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:24,880 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:10:24,880 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:24,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:24,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1082827524, now seen corresponding path program 1 times [2023-12-05 21:10:24,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:24,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103699208] [2023-12-05 21:10:24,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:24,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:24,954 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:24,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:24,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103699208] [2023-12-05 21:10:24,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103699208] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:24,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:24,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:24,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687283102] [2023-12-05 21:10:24,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:24,956 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:24,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:24,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:24,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:24,957 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 202 [2023-12-05 21:10:24,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 223 transitions, 2382 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:24,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:24,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 202 [2023-12-05 21:10:24,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:26,061 INFO L124 PetriNetUnfolderBase]: 2961/6276 cut-off events. [2023-12-05 21:10:26,061 INFO L125 PetriNetUnfolderBase]: For 40388/40712 co-relation queries the response was YES. [2023-12-05 21:10:26,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45583 conditions, 6276 events. 2961/6276 cut-off events. For 40388/40712 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 52027 event pairs, 102 based on Foata normal form. 6/4914 useless extension candidates. Maximal degree in co-relation 45426. Up to 3924 conditions per place. [2023-12-05 21:10:26,136 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 118 selfloop transitions, 2 changer transitions 0/239 dead transitions. [2023-12-05 21:10:26,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 239 transitions, 2950 flow [2023-12-05 21:10:26,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:26,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:26,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2023-12-05 21:10:26,138 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.698019801980198 [2023-12-05 21:10:26,138 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2023-12-05 21:10:26,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2023-12-05 21:10:26,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:26,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2023-12-05 21:10:26,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:26,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:26,141 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:26,142 INFO L308 CegarLoopForPetriNet]: 208 programPoint places, -19 predicate places. [2023-12-05 21:10:26,142 INFO L500 AbstractCegarLoop]: Abstraction has has 189 places, 239 transitions, 2950 flow [2023-12-05 21:10:26,142 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:26,142 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:26,142 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:26,142 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:10:26,142 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:26,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:26,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1069445836, now seen corresponding path program 1 times [2023-12-05 21:10:26,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:26,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848007227] [2023-12-05 21:10:26,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:26,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:26,271 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:26,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:26,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848007227] [2023-12-05 21:10:26,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848007227] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:26,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:26,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:26,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403080172] [2023-12-05 21:10:26,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:26,273 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:26,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:26,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:26,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:26,274 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 202 [2023-12-05 21:10:26,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 239 transitions, 2950 flow. Second operand has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:26,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:26,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 202 [2023-12-05 21:10:26,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:27,656 INFO L124 PetriNetUnfolderBase]: 2919/6316 cut-off events. [2023-12-05 21:10:27,656 INFO L125 PetriNetUnfolderBase]: For 48253/48613 co-relation queries the response was YES. [2023-12-05 21:10:27,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48192 conditions, 6316 events. 2919/6316 cut-off events. For 48253/48613 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 53611 event pairs, 90 based on Foata normal form. 0/4966 useless extension candidates. Maximal degree in co-relation 48032. Up to 3924 conditions per place. [2023-12-05 21:10:27,748 INFO L140 encePairwiseOnDemand]: 198/202 looper letters, 170 selfloop transitions, 15 changer transitions 0/320 dead transitions. [2023-12-05 21:10:27,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 320 transitions, 5111 flow [2023-12-05 21:10:27,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:27,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:27,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2023-12-05 21:10:27,750 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7755775577557755 [2023-12-05 21:10:27,750 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 470 transitions. [2023-12-05 21:10:27,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 470 transitions. [2023-12-05 21:10:27,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:27,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 470 transitions. [2023-12-05 21:10:27,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,754 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,754 INFO L308 CegarLoopForPetriNet]: 208 programPoint places, -17 predicate places. [2023-12-05 21:10:27,754 INFO L500 AbstractCegarLoop]: Abstraction has has 191 places, 320 transitions, 5111 flow [2023-12-05 21:10:27,755 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,755 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:27,755 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:27,755 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:10:27,755 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:27,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:27,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1525079937, now seen corresponding path program 1 times [2023-12-05 21:10:27,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:27,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867749988] [2023-12-05 21:10:27,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:27,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:27,891 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:27,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:27,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867749988] [2023-12-05 21:10:27,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867749988] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:27,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:27,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:10:27,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147958594] [2023-12-05 21:10:27,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:27,893 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:10:27,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:27,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:10:27,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:10:27,894 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 202 [2023-12-05 21:10:27,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 320 transitions, 5111 flow. Second operand has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:27,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 202 [2023-12-05 21:10:27,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:29,180 INFO L124 PetriNetUnfolderBase]: 2907/6215 cut-off events. [2023-12-05 21:10:29,180 INFO L125 PetriNetUnfolderBase]: For 60496/60892 co-relation queries the response was YES. [2023-12-05 21:10:29,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51606 conditions, 6215 events. 2907/6215 cut-off events. For 60496/60892 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 51971 event pairs, 84 based on Foata normal form. 0/4874 useless extension candidates. Maximal degree in co-relation 51435. Up to 3924 conditions per place. [2023-12-05 21:10:29,285 INFO L140 encePairwiseOnDemand]: 192/202 looper letters, 180 selfloop transitions, 38 changer transitions 0/332 dead transitions. [2023-12-05 21:10:29,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 332 transitions, 5753 flow [2023-12-05 21:10:29,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:10:29,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:10:29,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 559 transitions. [2023-12-05 21:10:29,287 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6918316831683168 [2023-12-05 21:10:29,287 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 559 transitions. [2023-12-05 21:10:29,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 559 transitions. [2023-12-05 21:10:29,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:29,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 559 transitions. [2023-12-05 21:10:29,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:29,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:29,291 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:29,291 INFO L308 CegarLoopForPetriNet]: 208 programPoint places, -15 predicate places. [2023-12-05 21:10:29,291 INFO L500 AbstractCegarLoop]: Abstraction has has 193 places, 332 transitions, 5753 flow [2023-12-05 21:10:29,292 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:29,292 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:29,292 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:29,292 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:10:29,292 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:29,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:29,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1525079938, now seen corresponding path program 1 times [2023-12-05 21:10:29,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:29,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863947788] [2023-12-05 21:10:29,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:29,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:29,581 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:29,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:29,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863947788] [2023-12-05 21:10:29,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863947788] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:29,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:29,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:10:29,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929286985] [2023-12-05 21:10:29,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:29,583 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:10:29,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:29,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:10:29,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:10:29,584 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 202 [2023-12-05 21:10:29,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 332 transitions, 5753 flow. Second operand has 6 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:29,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:29,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 202 [2023-12-05 21:10:29,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:30,892 INFO L124 PetriNetUnfolderBase]: 2895/6194 cut-off events. [2023-12-05 21:10:30,893 INFO L125 PetriNetUnfolderBase]: For 69310/69742 co-relation queries the response was YES. [2023-12-05 21:10:30,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54487 conditions, 6194 events. 2895/6194 cut-off events. For 69310/69742 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 51734 event pairs, 78 based on Foata normal form. 0/4862 useless extension candidates. Maximal degree in co-relation 54306. Up to 3924 conditions per place. [2023-12-05 21:10:30,980 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 187 selfloop transitions, 15 changer transitions 0/331 dead transitions. [2023-12-05 21:10:30,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 331 transitions, 6131 flow [2023-12-05 21:10:30,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:10:30,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:10:30,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2023-12-05 21:10:30,982 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6955445544554455 [2023-12-05 21:10:30,982 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 562 transitions. [2023-12-05 21:10:30,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 562 transitions. [2023-12-05 21:10:30,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:30,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 562 transitions. [2023-12-05 21:10:30,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:30,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:30,985 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:30,985 INFO L308 CegarLoopForPetriNet]: 208 programPoint places, -13 predicate places. [2023-12-05 21:10:30,986 INFO L500 AbstractCegarLoop]: Abstraction has has 195 places, 331 transitions, 6131 flow [2023-12-05 21:10:30,986 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:30,986 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:30,986 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] [2023-12-05 21:10:30,986 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:10:30,986 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:30,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:30,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1037713513, now seen corresponding path program 1 times [2023-12-05 21:10:30,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:30,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287827465] [2023-12-05 21:10:30,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:30,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:31,198 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:31,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:31,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287827465] [2023-12-05 21:10:31,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287827465] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:31,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:31,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:10:31,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597052439] [2023-12-05 21:10:31,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:31,199 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:10:31,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:31,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:10:31,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:10:31,201 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 202 [2023-12-05 21:10:31,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 331 transitions, 6131 flow. Second operand has 7 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:31,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:31,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 202 [2023-12-05 21:10:31,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:32,407 INFO L124 PetriNetUnfolderBase]: 2365/5164 cut-off events. [2023-12-05 21:10:32,407 INFO L125 PetriNetUnfolderBase]: For 73312/73780 co-relation queries the response was YES. [2023-12-05 21:10:32,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48342 conditions, 5164 events. 2365/5164 cut-off events. For 73312/73780 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 41987 event pairs, 78 based on Foata normal form. 0/4120 useless extension candidates. Maximal degree in co-relation 48150. Up to 3245 conditions per place. [2023-12-05 21:10:32,485 INFO L140 encePairwiseOnDemand]: 183/202 looper letters, 177 selfloop transitions, 49 changer transitions 0/336 dead transitions. [2023-12-05 21:10:32,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 336 transitions, 6723 flow [2023-12-05 21:10:32,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 21:10:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 21:10:32,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 785 transitions. [2023-12-05 21:10:32,488 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6476897689768977 [2023-12-05 21:10:32,488 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 785 transitions. [2023-12-05 21:10:32,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 785 transitions. [2023-12-05 21:10:32,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:32,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 785 transitions. [2023-12-05 21:10:32,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:32,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:32,492 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:32,492 INFO L308 CegarLoopForPetriNet]: 208 programPoint places, -8 predicate places. [2023-12-05 21:10:32,493 INFO L500 AbstractCegarLoop]: Abstraction has has 200 places, 336 transitions, 6723 flow [2023-12-05 21:10:32,493 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:32,493 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:32,493 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] [2023-12-05 21:10:32,493 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:10:32,493 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:32,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:32,494 INFO L85 PathProgramCache]: Analyzing trace with hash -811889302, now seen corresponding path program 1 times [2023-12-05 21:10:32,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:32,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74325513] [2023-12-05 21:10:32,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:32,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:32,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:32,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:32,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74325513] [2023-12-05 21:10:32,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74325513] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:32,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:32,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-05 21:10:32,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757395979] [2023-12-05 21:10:32,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:32,945 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:10:32,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:32,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:10:32,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:10:32,947 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 202 [2023-12-05 21:10:32,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 336 transitions, 6723 flow. Second operand has 11 states, 11 states have (on average 117.36363636363636) internal successors, (1291), 11 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:32,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:32,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 202 [2023-12-05 21:10:32,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:35,012 INFO L124 PetriNetUnfolderBase]: 3045/6784 cut-off events. [2023-12-05 21:10:35,012 INFO L125 PetriNetUnfolderBase]: For 104087/106431 co-relation queries the response was YES. [2023-12-05 21:10:35,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64735 conditions, 6784 events. 3045/6784 cut-off events. For 104087/106431 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 56907 event pairs, 102 based on Foata normal form. 0/5631 useless extension candidates. Maximal degree in co-relation 64531. Up to 3866 conditions per place. [2023-12-05 21:10:35,106 INFO L140 encePairwiseOnDemand]: 177/202 looper letters, 339 selfloop transitions, 113 changer transitions 5/564 dead transitions. [2023-12-05 21:10:35,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 564 transitions, 13901 flow [2023-12-05 21:10:35,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-05 21:10:35,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-12-05 21:10:35,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1874 transitions. [2023-12-05 21:10:35,110 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6184818481848184 [2023-12-05 21:10:35,111 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1874 transitions. [2023-12-05 21:10:35,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1874 transitions. [2023-12-05 21:10:35,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:35,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1874 transitions. [2023-12-05 21:10:35,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 124.93333333333334) internal successors, (1874), 15 states have internal predecessors, (1874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:35,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 202.0) internal successors, (3232), 16 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:35,119 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 202.0) internal successors, (3232), 16 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:35,119 INFO L308 CegarLoopForPetriNet]: 208 programPoint places, 6 predicate places. [2023-12-05 21:10:35,119 INFO L500 AbstractCegarLoop]: Abstraction has has 214 places, 564 transitions, 13901 flow [2023-12-05 21:10:35,120 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 117.36363636363636) internal successors, (1291), 11 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:35,120 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:35,120 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:35,120 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-05 21:10:35,120 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:35,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:35,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1973721447, now seen corresponding path program 1 times [2023-12-05 21:10:35,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:35,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52346002] [2023-12-05 21:10:35,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:35,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:35,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:35,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52346002] [2023-12-05 21:10:35,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52346002] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:35,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:35,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-05 21:10:35,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526032452] [2023-12-05 21:10:35,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:35,500 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-05 21:10:35,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:35,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-05 21:10:35,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-05 21:10:35,501 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 202 [2023-12-05 21:10:35,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 564 transitions, 13901 flow. Second operand has 9 states, 9 states have (on average 119.77777777777777) internal successors, (1078), 9 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:35,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:35,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 202 [2023-12-05 21:10:35,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:37,156 INFO L124 PetriNetUnfolderBase]: 2515/5855 cut-off events. [2023-12-05 21:10:37,157 INFO L125 PetriNetUnfolderBase]: For 99997/101779 co-relation queries the response was YES. [2023-12-05 21:10:37,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57552 conditions, 5855 events. 2515/5855 cut-off events. For 99997/101779 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 48171 event pairs, 105 based on Foata normal form. 0/4983 useless extension candidates. Maximal degree in co-relation 57337. Up to 3187 conditions per place. [2023-12-05 21:10:37,245 INFO L140 encePairwiseOnDemand]: 182/202 looper letters, 381 selfloop transitions, 69 changer transitions 5/569 dead transitions. [2023-12-05 21:10:37,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 569 transitions, 14971 flow [2023-12-05 21:10:37,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:10:37,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:10:37,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1013 transitions. [2023-12-05 21:10:37,247 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6268564356435643 [2023-12-05 21:10:37,247 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1013 transitions. [2023-12-05 21:10:37,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1013 transitions. [2023-12-05 21:10:37,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:37,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1013 transitions. [2023-12-05 21:10:37,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.625) internal successors, (1013), 8 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:37,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:37,252 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:37,253 INFO L308 CegarLoopForPetriNet]: 208 programPoint places, 13 predicate places. [2023-12-05 21:10:37,253 INFO L500 AbstractCegarLoop]: Abstraction has has 221 places, 569 transitions, 14971 flow [2023-12-05 21:10:37,253 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 119.77777777777777) internal successors, (1078), 9 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:37,254 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:37,254 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] [2023-12-05 21:10:37,254 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-05 21:10:37,254 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:37,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:37,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1454071897, now seen corresponding path program 1 times [2023-12-05 21:10:37,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:37,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472878128] [2023-12-05 21:10:37,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:37,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:37,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:37,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:37,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472878128] [2023-12-05 21:10:37,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472878128] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:37,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:37,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-05 21:10:37,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630774527] [2023-12-05 21:10:37,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:37,750 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-05 21:10:37,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:37,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-05 21:10:37,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-12-05 21:10:37,752 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 202 [2023-12-05 21:10:37,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 569 transitions, 14971 flow. Second operand has 13 states, 13 states have (on average 115.15384615384616) internal successors, (1497), 13 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:37,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:37,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 202 [2023-12-05 21:10:37,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:39,663 INFO L124 PetriNetUnfolderBase]: 2593/6120 cut-off events. [2023-12-05 21:10:39,663 INFO L125 PetriNetUnfolderBase]: For 108791/111027 co-relation queries the response was YES. [2023-12-05 21:10:39,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63334 conditions, 6120 events. 2593/6120 cut-off events. For 108791/111027 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 51639 event pairs, 106 based on Foata normal form. 18/5298 useless extension candidates. Maximal degree in co-relation 63107. Up to 3289 conditions per place. [2023-12-05 21:10:39,761 INFO L140 encePairwiseOnDemand]: 175/202 looper letters, 381 selfloop transitions, 121 changer transitions 10/618 dead transitions. [2023-12-05 21:10:39,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 618 transitions, 17409 flow [2023-12-05 21:10:39,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-05 21:10:39,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-12-05 21:10:39,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2310 transitions. [2023-12-05 21:10:39,766 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6018759770713914 [2023-12-05 21:10:39,766 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2310 transitions. [2023-12-05 21:10:39,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2310 transitions. [2023-12-05 21:10:39,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:39,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2310 transitions. [2023-12-05 21:10:39,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 121.57894736842105) internal successors, (2310), 19 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:39,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 202.0) internal successors, (4040), 20 states have internal predecessors, (4040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:39,777 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 202.0) internal successors, (4040), 20 states have internal predecessors, (4040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:39,777 INFO L308 CegarLoopForPetriNet]: 208 programPoint places, 31 predicate places. [2023-12-05 21:10:39,777 INFO L500 AbstractCegarLoop]: Abstraction has has 239 places, 618 transitions, 17409 flow [2023-12-05 21:10:39,778 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 115.15384615384616) internal successors, (1497), 13 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:39,778 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:39,778 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:39,778 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-05 21:10:39,778 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:39,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:39,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1412887576, now seen corresponding path program 1 times [2023-12-05 21:10:39,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:39,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002324958] [2023-12-05 21:10:39,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:39,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:40,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:10:40,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:40,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002324958] [2023-12-05 21:10:40,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002324958] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:40,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:40,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-05 21:10:40,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973093203] [2023-12-05 21:10:40,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:40,261 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:10:40,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:40,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:10:40,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:10:40,263 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 202 [2023-12-05 21:10:40,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 618 transitions, 17409 flow. Second operand has 11 states, 11 states have (on average 117.45454545454545) internal successors, (1292), 11 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:40,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:40,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 202 [2023-12-05 21:10:40,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:41,905 INFO L124 PetriNetUnfolderBase]: 2063/5013 cut-off events. [2023-12-05 21:10:41,905 INFO L125 PetriNetUnfolderBase]: For 99777/101775 co-relation queries the response was YES. [2023-12-05 21:10:41,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54119 conditions, 5013 events. 2063/5013 cut-off events. For 99777/101775 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 40132 event pairs, 105 based on Foata normal form. 0/4459 useless extension candidates. Maximal degree in co-relation 53881. Up to 2610 conditions per place. [2023-12-05 21:10:41,985 INFO L140 encePairwiseOnDemand]: 181/202 looper letters, 441 selfloop transitions, 55 changer transitions 10/623 dead transitions. [2023-12-05 21:10:41,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 623 transitions, 18601 flow [2023-12-05 21:10:41,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:10:41,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:10:41,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1233 transitions. [2023-12-05 21:10:41,990 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6103960396039604 [2023-12-05 21:10:41,990 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1233 transitions. [2023-12-05 21:10:41,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1233 transitions. [2023-12-05 21:10:41,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:41,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1233 transitions. [2023-12-05 21:10:41,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 123.3) internal successors, (1233), 10 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:41,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 202.0) internal successors, (2222), 11 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:41,996 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 202.0) internal successors, (2222), 11 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:41,997 INFO L308 CegarLoopForPetriNet]: 208 programPoint places, 40 predicate places. [2023-12-05 21:10:41,997 INFO L500 AbstractCegarLoop]: Abstraction has has 248 places, 623 transitions, 18601 flow [2023-12-05 21:10:41,997 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 117.45454545454545) internal successors, (1292), 11 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:41,997 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:41,998 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] [2023-12-05 21:10:41,998 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-05 21:10:41,998 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2023-12-05 21:10:41,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:41,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1495747943, now seen corresponding path program 1 times [2023-12-05 21:10:41,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:41,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978969806] [2023-12-05 21:10:41,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:41,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:42,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:42,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:42,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978969806] [2023-12-05 21:10:42,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978969806] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:42,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:42,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-05 21:10:42,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27089179] [2023-12-05 21:10:42,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:42,726 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-05 21:10:42,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:42,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-05 21:10:42,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-12-05 21:10:42,728 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 202 [2023-12-05 21:10:42,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 623 transitions, 18601 flow. Second operand has 13 states, 13 states have (on average 115.23076923076923) internal successors, (1498), 13 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:42,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:42,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 202 [2023-12-05 21:10:42,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:43,827 INFO L124 PetriNetUnfolderBase]: 1337/3289 cut-off events. [2023-12-05 21:10:43,827 INFO L125 PetriNetUnfolderBase]: For 69114/71316 co-relation queries the response was YES. [2023-12-05 21:10:43,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36237 conditions, 3289 events. 1337/3289 cut-off events. For 69114/71316 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 23078 event pairs, 48 based on Foata normal form. 0/3212 useless extension candidates. Maximal degree in co-relation 35988. Up to 1437 conditions per place. [2023-12-05 21:10:43,856 INFO L140 encePairwiseOnDemand]: 185/202 looper letters, 0 selfloop transitions, 0 changer transitions 583/583 dead transitions. [2023-12-05 21:10:43,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 583 transitions, 18015 flow [2023-12-05 21:10:43,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-05 21:10:43,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-05 21:10:43,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1317 transitions. [2023-12-05 21:10:43,860 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5927092709270927 [2023-12-05 21:10:43,860 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1317 transitions. [2023-12-05 21:10:43,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1317 transitions. [2023-12-05 21:10:43,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:43,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1317 transitions. [2023-12-05 21:10:43,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 119.72727272727273) internal successors, (1317), 11 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:43,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 202.0) internal successors, (2424), 12 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:10:43,866 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 202.0) internal successors, (2424), 12 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:10:43,866 INFO L308 CegarLoopForPetriNet]: 208 programPoint places, 43 predicate places. [2023-12-05 21:10:43,866 INFO L500 AbstractCegarLoop]: Abstraction has has 251 places, 583 transitions, 18015 flow [2023-12-05 21:10:43,867 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 115.23076923076923) internal successors, (1498), 13 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:43,882 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe019_rmo.oepc.i_BEv2_AllErrorsAtOnce [2023-12-05 21:10:43,930 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 78 remaining) [2023-12-05 21:10:43,931 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 78 remaining) [2023-12-05 21:10:43,931 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 78 remaining) [2023-12-05 21:10:43,931 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 78 remaining) [2023-12-05 21:10:43,931 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 78 remaining) [2023-12-05 21:10:43,932 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 78 remaining) [2023-12-05 21:10:43,932 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 78 remaining) [2023-12-05 21:10:43,932 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 78 remaining) [2023-12-05 21:10:43,932 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 78 remaining) [2023-12-05 21:10:43,932 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 78 remaining) [2023-12-05 21:10:43,932 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 78 remaining) [2023-12-05 21:10:43,932 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 78 remaining) [2023-12-05 21:10:43,932 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 78 remaining) [2023-12-05 21:10:43,932 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 78 remaining) [2023-12-05 21:10:43,932 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 78 remaining) [2023-12-05 21:10:43,933 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 78 remaining) [2023-12-05 21:10:43,933 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 78 remaining) [2023-12-05 21:10:43,933 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 78 remaining) [2023-12-05 21:10:43,933 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 78 remaining) [2023-12-05 21:10:43,933 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 78 remaining) [2023-12-05 21:10:43,933 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 78 remaining) [2023-12-05 21:10:43,933 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 78 remaining) [2023-12-05 21:10:43,933 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 78 remaining) [2023-12-05 21:10:43,933 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 78 remaining) [2023-12-05 21:10:43,934 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 78 remaining) [2023-12-05 21:10:43,934 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 78 remaining) [2023-12-05 21:10:43,934 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 78 remaining) [2023-12-05 21:10:43,934 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 78 remaining) [2023-12-05 21:10:43,934 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 78 remaining) [2023-12-05 21:10:43,934 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 78 remaining) [2023-12-05 21:10:43,934 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 78 remaining) [2023-12-05 21:10:43,934 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 78 remaining) [2023-12-05 21:10:43,934 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 78 remaining) [2023-12-05 21:10:43,935 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 78 remaining) [2023-12-05 21:10:43,935 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 78 remaining) [2023-12-05 21:10:43,935 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 78 remaining) [2023-12-05 21:10:43,935 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 78 remaining) [2023-12-05 21:10:43,935 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 78 remaining) [2023-12-05 21:10:43,935 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 78 remaining) [2023-12-05 21:10:43,935 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 78 remaining) [2023-12-05 21:10:43,935 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 78 remaining) [2023-12-05 21:10:43,935 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 78 remaining) [2023-12-05 21:10:43,935 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 78 remaining) [2023-12-05 21:10:43,936 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 78 remaining) [2023-12-05 21:10:43,936 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 78 remaining) [2023-12-05 21:10:43,936 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 78 remaining) [2023-12-05 21:10:43,936 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 78 remaining) [2023-12-05 21:10:43,936 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 78 remaining) [2023-12-05 21:10:43,936 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 78 remaining) [2023-12-05 21:10:43,936 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 78 remaining) [2023-12-05 21:10:43,936 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 78 remaining) [2023-12-05 21:10:43,936 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 78 remaining) [2023-12-05 21:10:43,936 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 78 remaining) [2023-12-05 21:10:43,937 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 78 remaining) [2023-12-05 21:10:43,937 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 78 remaining) [2023-12-05 21:10:43,937 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 78 remaining) [2023-12-05 21:10:43,937 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 78 remaining) [2023-12-05 21:10:43,937 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 78 remaining) [2023-12-05 21:10:43,937 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 78 remaining) [2023-12-05 21:10:43,937 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 78 remaining) [2023-12-05 21:10:43,937 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 78 remaining) [2023-12-05 21:10:43,937 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 78 remaining) [2023-12-05 21:10:43,937 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 78 remaining) [2023-12-05 21:10:43,938 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 78 remaining) [2023-12-05 21:10:43,938 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 78 remaining) [2023-12-05 21:10:43,938 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 78 remaining) [2023-12-05 21:10:43,938 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 78 remaining) [2023-12-05 21:10:43,938 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 78 remaining) [2023-12-05 21:10:43,938 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 78 remaining) [2023-12-05 21:10:43,938 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 78 remaining) [2023-12-05 21:10:43,938 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 78 remaining) [2023-12-05 21:10:43,938 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 78 remaining) [2023-12-05 21:10:43,938 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 78 remaining) [2023-12-05 21:10:43,938 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 78 remaining) [2023-12-05 21:10:43,939 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 78 remaining) [2023-12-05 21:10:43,939 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 78 remaining) [2023-12-05 21:10:43,939 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 78 remaining) [2023-12-05 21:10:43,939 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 78 remaining) [2023-12-05 21:10:43,939 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-05 21:10:43,940 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:43,945 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:10:43,945 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:10:43,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:10:43 BasicIcfg [2023-12-05 21:10:43,951 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:10:43,951 INFO L158 Benchmark]: Toolchain (without parser) took 42533.39ms. Allocated memory was 334.5MB in the beginning and 6.2GB in the end (delta: 5.9GB). Free memory was 284.4MB in the beginning and 4.0GB in the end (delta: -3.7GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2023-12-05 21:10:43,952 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 200.3MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:10:43,952 INFO L158 Benchmark]: CACSL2BoogieTranslator took 539.06ms. Allocated memory is still 334.5MB. Free memory was 284.4MB in the beginning and 259.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-12-05 21:10:43,952 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.94ms. Allocated memory is still 334.5MB. Free memory was 259.2MB in the beginning and 256.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:10:43,952 INFO L158 Benchmark]: Boogie Preprocessor took 33.86ms. Allocated memory is still 334.5MB. Free memory was 256.5MB in the beginning and 254.0MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-05 21:10:43,953 INFO L158 Benchmark]: RCFGBuilder took 1130.21ms. Allocated memory is still 334.5MB. Free memory was 254.0MB in the beginning and 199.9MB in the end (delta: 54.1MB). Peak memory consumption was 55.0MB. Max. memory is 8.0GB. [2023-12-05 21:10:43,953 INFO L158 Benchmark]: TraceAbstraction took 40754.63ms. Allocated memory was 334.5MB in the beginning and 6.2GB in the end (delta: 5.9GB). Free memory was 199.4MB in the beginning and 4.0GB in the end (delta: -3.8GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2023-12-05 21:10:43,954 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 200.3MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 539.06ms. Allocated memory is still 334.5MB. Free memory was 284.4MB in the beginning and 259.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.94ms. Allocated memory is still 334.5MB. Free memory was 259.2MB in the beginning and 256.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.86ms. Allocated memory is still 334.5MB. Free memory was 256.5MB in the beginning and 254.0MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1130.21ms. Allocated memory is still 334.5MB. Free memory was 254.0MB in the beginning and 199.9MB in the end (delta: 54.1MB). Peak memory consumption was 55.0MB. Max. memory is 8.0GB. * TraceAbstraction took 40754.63ms. Allocated memory was 334.5MB in the beginning and 6.2GB in the end (delta: 5.9GB). Free memory was 199.4MB in the beginning and 4.0GB in the end (delta: -3.8GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 258 locations, 78 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 40.5s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 35.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1107 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1107 mSDsluCounter, 383 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 162 mSDsCounter, 341 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2261 IncrementalHoareTripleChecker+Invalid, 2602 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 341 mSolverCounterUnsat, 221 mSDtfsCounter, 2261 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18601occurred in iteration=18, InterpolantAutomatonStates: 115, 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, 4.1s InterpolantComputationTime, 1630 NumberOfCodeBlocks, 1630 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1611 ConstructedInterpolants, 0 QuantifiedInterpolants, 8828 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 50 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:10:43,971 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...