/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/safe018_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:09:45,412 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:09:45,475 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:45,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:09:45,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:09:45,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:09:45,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:09:45,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:09:45,495 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:09:45,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:09:45,495 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:09:45,495 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:09:45,496 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:09:45,496 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:09:45,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:09:45,496 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:09:45,496 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:09:45,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:09:45,497 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:09:45,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:09:45,497 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:09:45,500 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:09:45,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:09:45,501 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:09:45,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:09:45,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:09:45,502 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:09:45,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:09:45,502 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:09:45,502 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:09:45,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:09:45,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:09:45,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:09:45,503 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:09:45,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:09:45,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:09:45,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:09:45,733 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:09:45,733 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:09:45,734 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.i [2023-12-05 21:09:46,786 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:09:46,938 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:09:46,940 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.i [2023-12-05 21:09:46,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/690730274/78b727d1ff164203ac3859e631e930e3/FLAGb8ed64407 [2023-12-05 21:09:46,960 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/690730274/78b727d1ff164203ac3859e631e930e3 [2023-12-05 21:09:46,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:09:46,962 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:09:46,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:09:46,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:09:46,966 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:09:46,967 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:09:46" (1/1) ... [2023-12-05 21:09:46,967 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5849f027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:46, skipping insertion in model container [2023-12-05 21:09:46,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:09:46" (1/1) ... [2023-12-05 21:09:47,005 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:09:47,265 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:09:47,273 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:09:47,307 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:09:47,324 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:09:47,324 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:09:47,329 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:09:47,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:47 WrapperNode [2023-12-05 21:09:47,329 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:09:47,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:09:47,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:09:47,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:09:47,336 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:09:47" (1/1) ... [2023-12-05 21:09:47,359 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:09:47" (1/1) ... [2023-12-05 21:09:47,386 INFO L138 Inliner]: procedures = 176, calls = 66, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2023-12-05 21:09:47,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:09:47,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:09:47,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:09:47,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:09:47,393 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:47" (1/1) ... [2023-12-05 21:09:47,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:47" (1/1) ... [2023-12-05 21:09:47,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:47" (1/1) ... [2023-12-05 21:09:47,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:47" (1/1) ... [2023-12-05 21:09:47,412 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:47" (1/1) ... [2023-12-05 21:09:47,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:47" (1/1) ... [2023-12-05 21:09:47,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:47" (1/1) ... [2023-12-05 21:09:47,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:47" (1/1) ... [2023-12-05 21:09:47,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:09:47,418 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:09:47,418 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:09:47,418 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:09:47,419 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:47" (1/1) ... [2023-12-05 21:09:47,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:09:47,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:09:47,453 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:09:47,472 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:09:47,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:09:47,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:09:47,478 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:09:47,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:09:47,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:09:47,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:09:47,479 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-05 21:09:47,479 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-05 21:09:47,479 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-05 21:09:47,479 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-05 21:09:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-05 21:09:47,480 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-05 21:09:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:09:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:09:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:09:47,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:09:47,481 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:09:47,636 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:09:47,645 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:09:47,887 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:09:48,077 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:09:48,078 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:09:48,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:09:48 BoogieIcfgContainer [2023-12-05 21:09:48,079 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:09:48,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:09:48,080 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:09:48,082 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:09:48,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:09:46" (1/3) ... [2023-12-05 21:09:48,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c83d45e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:09:48, skipping insertion in model container [2023-12-05 21:09:48,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:47" (2/3) ... [2023-12-05 21:09:48,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c83d45e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:09:48, skipping insertion in model container [2023-12-05 21:09:48,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:09:48" (3/3) ... [2023-12-05 21:09:48,084 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_rmo.oepc.i [2023-12-05 21:09:48,097 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:09:48,097 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2023-12-05 21:09:48,097 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:09:48,175 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:09:48,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 162 transitions, 336 flow [2023-12-05 21:09:48,288 INFO L124 PetriNetUnfolderBase]: 3/159 cut-off events. [2023-12-05 21:09:48,288 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:09:48,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 159 events. 3/159 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 191 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 103. Up to 2 conditions per place. [2023-12-05 21:09:48,294 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 162 transitions, 336 flow [2023-12-05 21:09:48,302 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 159 transitions, 327 flow [2023-12-05 21:09:48,313 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:09:48,319 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;@d49bd31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:09:48,320 INFO L363 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2023-12-05 21:09:48,331 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:09:48,331 INFO L124 PetriNetUnfolderBase]: 0/57 cut-off events. [2023-12-05 21:09:48,331 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:09:48,331 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:48,332 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] [2023-12-05 21:09:48,332 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:09:48,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:48,336 INFO L85 PathProgramCache]: Analyzing trace with hash -198720883, now seen corresponding path program 1 times [2023-12-05 21:09:48,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:48,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271669232] [2023-12-05 21:09:48,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:48,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:48,623 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:09:48,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:48,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271669232] [2023-12-05 21:09:48,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271669232] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:48,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:48,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:48,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574382686] [2023-12-05 21:09:48,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:48,631 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:48,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:48,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:48,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:48,653 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 162 [2023-12-05 21:09:48,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 159 transitions, 327 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:48,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:48,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 162 [2023-12-05 21:09:48,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:49,117 INFO L124 PetriNetUnfolderBase]: 815/2103 cut-off events. [2023-12-05 21:09:49,117 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-05 21:09:49,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3485 conditions, 2103 events. 815/2103 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 15115 event pairs, 520 based on Foata normal form. 76/1275 useless extension candidates. Maximal degree in co-relation 3410. Up to 879 conditions per place. [2023-12-05 21:09:49,144 INFO L140 encePairwiseOnDemand]: 146/162 looper letters, 50 selfloop transitions, 2 changer transitions 0/153 dead transitions. [2023-12-05 21:09:49,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 153 transitions, 419 flow [2023-12-05 21:09:49,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:49,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:49,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-12-05 21:09:49,160 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8106995884773662 [2023-12-05 21:09:49,160 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-12-05 21:09:49,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-12-05 21:09:49,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:49,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-12-05 21:09:49,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:49,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:49,172 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:49,178 INFO L308 CegarLoopForPetriNet]: 166 programPoint places, -12 predicate places. [2023-12-05 21:09:49,179 INFO L500 AbstractCegarLoop]: Abstraction has has 154 places, 153 transitions, 419 flow [2023-12-05 21:09:49,179 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:49,179 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:49,179 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] [2023-12-05 21:09:49,180 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:09:49,180 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:09:49,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:49,181 INFO L85 PathProgramCache]: Analyzing trace with hash -198720882, now seen corresponding path program 1 times [2023-12-05 21:09:49,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:49,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493295069] [2023-12-05 21:09:49,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:49,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:49,357 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:09:49,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:49,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493295069] [2023-12-05 21:09:49,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493295069] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:49,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:49,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:49,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886132299] [2023-12-05 21:09:49,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:49,359 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:49,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:49,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:49,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:49,360 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 162 [2023-12-05 21:09:49,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 153 transitions, 419 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:49,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:49,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 162 [2023-12-05 21:09:49,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:49,707 INFO L124 PetriNetUnfolderBase]: 821/2116 cut-off events. [2023-12-05 21:09:49,707 INFO L125 PetriNetUnfolderBase]: For 172/472 co-relation queries the response was YES. [2023-12-05 21:09:49,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4795 conditions, 2116 events. 821/2116 cut-off events. For 172/472 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 15226 event pairs, 526 based on Foata normal form. 0/1211 useless extension candidates. Maximal degree in co-relation 4714. Up to 979 conditions per place. [2023-12-05 21:09:49,726 INFO L140 encePairwiseOnDemand]: 159/162 looper letters, 57 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2023-12-05 21:09:49,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 163 transitions, 577 flow [2023-12-05 21:09:49,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:49,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:49,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-12-05 21:09:49,727 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7736625514403292 [2023-12-05 21:09:49,727 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-12-05 21:09:49,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-12-05 21:09:49,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:49,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-12-05 21:09:49,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:49,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:49,730 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:49,731 INFO L308 CegarLoopForPetriNet]: 166 programPoint places, -11 predicate places. [2023-12-05 21:09:49,731 INFO L500 AbstractCegarLoop]: Abstraction has has 155 places, 163 transitions, 577 flow [2023-12-05 21:09:49,731 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:49,732 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:49,732 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] [2023-12-05 21:09:49,732 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:09:49,732 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:09:49,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:49,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1628286154, now seen corresponding path program 1 times [2023-12-05 21:09:49,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:49,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854975436] [2023-12-05 21:09:49,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:49,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:49,969 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:09:49,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:49,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854975436] [2023-12-05 21:09:49,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854975436] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:49,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:49,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:09:49,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021078945] [2023-12-05 21:09:49,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:49,972 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:09:49,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:49,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:09:49,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:09:49,974 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 162 [2023-12-05 21:09:49,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 163 transitions, 577 flow. Second operand has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:49,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:49,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 162 [2023-12-05 21:09:49,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:50,396 INFO L124 PetriNetUnfolderBase]: 558/1673 cut-off events. [2023-12-05 21:09:50,396 INFO L125 PetriNetUnfolderBase]: For 386/620 co-relation queries the response was YES. [2023-12-05 21:09:50,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4581 conditions, 1673 events. 558/1673 cut-off events. For 386/620 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 11942 event pairs, 203 based on Foata normal form. 0/1169 useless extension candidates. Maximal degree in co-relation 4489. Up to 657 conditions per place. [2023-12-05 21:09:50,407 INFO L140 encePairwiseOnDemand]: 147/162 looper letters, 63 selfloop transitions, 13 changer transitions 0/175 dead transitions. [2023-12-05 21:09:50,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 175 transitions, 797 flow [2023-12-05 21:09:50,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:09:50,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:09:50,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 818 transitions. [2023-12-05 21:09:50,409 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7213403880070547 [2023-12-05 21:09:50,409 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 818 transitions. [2023-12-05 21:09:50,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 818 transitions. [2023-12-05 21:09:50,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:50,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 818 transitions. [2023-12-05 21:09:50,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:50,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 162.0) internal successors, (1296), 8 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:50,413 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 162.0) internal successors, (1296), 8 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:50,413 INFO L308 CegarLoopForPetriNet]: 166 programPoint places, -7 predicate places. [2023-12-05 21:09:50,414 INFO L500 AbstractCegarLoop]: Abstraction has has 159 places, 175 transitions, 797 flow [2023-12-05 21:09:50,414 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:50,414 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:50,414 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] [2023-12-05 21:09:50,414 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:09:50,414 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:09:50,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:50,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1628286153, now seen corresponding path program 1 times [2023-12-05 21:09:50,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:50,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382104932] [2023-12-05 21:09:50,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:50,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:50,504 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:09:50,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:50,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382104932] [2023-12-05 21:09:50,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382104932] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:50,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:50,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:09:50,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344958271] [2023-12-05 21:09:50,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:50,506 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:09:50,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:50,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:09:50,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:09:50,507 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 162 [2023-12-05 21:09:50,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 175 transitions, 797 flow. Second operand has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:50,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:50,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 162 [2023-12-05 21:09:50,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:50,624 INFO L124 PetriNetUnfolderBase]: 183/773 cut-off events. [2023-12-05 21:09:50,624 INFO L125 PetriNetUnfolderBase]: For 359/433 co-relation queries the response was YES. [2023-12-05 21:09:50,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2122 conditions, 773 events. 183/773 cut-off events. For 359/433 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4465 event pairs, 43 based on Foata normal form. 0/671 useless extension candidates. Maximal degree in co-relation 2021. Up to 289 conditions per place. [2023-12-05 21:09:50,630 INFO L140 encePairwiseOnDemand]: 154/162 looper letters, 41 selfloop transitions, 2 changer transitions 0/153 dead transitions. [2023-12-05 21:09:50,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 153 transitions, 707 flow [2023-12-05 21:09:50,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:09:50,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:09:50,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2023-12-05 21:09:50,632 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7422839506172839 [2023-12-05 21:09:50,632 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2023-12-05 21:09:50,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2023-12-05 21:09:50,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:50,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2023-12-05 21:09:50,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:50,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 162.0) internal successors, (810), 5 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:50,635 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 162.0) internal successors, (810), 5 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:50,635 INFO L308 CegarLoopForPetriNet]: 166 programPoint places, -10 predicate places. [2023-12-05 21:09:50,635 INFO L500 AbstractCegarLoop]: Abstraction has has 156 places, 153 transitions, 707 flow [2023-12-05 21:09:50,636 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:50,636 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:50,636 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:09:50,636 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:09:50,636 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:09:50,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:50,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1078873461, now seen corresponding path program 1 times [2023-12-05 21:09:50,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:50,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726230962] [2023-12-05 21:09:50,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:50,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:50,685 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:09:50,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:50,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726230962] [2023-12-05 21:09:50,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726230962] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:50,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:50,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:50,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886603511] [2023-12-05 21:09:50,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:50,687 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:50,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:50,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:50,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:50,688 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 162 [2023-12-05 21:09:50,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 153 transitions, 707 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:50,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:50,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 162 [2023-12-05 21:09:50,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:50,832 INFO L124 PetriNetUnfolderBase]: 215/824 cut-off events. [2023-12-05 21:09:50,833 INFO L125 PetriNetUnfolderBase]: For 758/848 co-relation queries the response was YES. [2023-12-05 21:09:50,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2706 conditions, 824 events. 215/824 cut-off events. For 758/848 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4910 event pairs, 29 based on Foata normal form. 2/712 useless extension candidates. Maximal degree in co-relation 2596. Up to 326 conditions per place. [2023-12-05 21:09:50,840 INFO L140 encePairwiseOnDemand]: 159/162 looper letters, 50 selfloop transitions, 2 changer transitions 0/153 dead transitions. [2023-12-05 21:09:50,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 153 transitions, 815 flow [2023-12-05 21:09:50,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:50,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:50,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-12-05 21:09:50,841 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7283950617283951 [2023-12-05 21:09:50,841 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-12-05 21:09:50,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-12-05 21:09:50,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:50,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-12-05 21:09:50,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:50,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:50,844 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:50,846 INFO L308 CegarLoopForPetriNet]: 166 programPoint places, -9 predicate places. [2023-12-05 21:09:50,846 INFO L500 AbstractCegarLoop]: Abstraction has has 157 places, 153 transitions, 815 flow [2023-12-05 21:09:50,846 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:50,846 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:50,847 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:09:50,847 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:09:50,847 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:09:50,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:50,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1078873462, now seen corresponding path program 1 times [2023-12-05 21:09:50,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:50,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113141312] [2023-12-05 21:09:50,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:50,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:50,932 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:09:50,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:50,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113141312] [2023-12-05 21:09:50,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113141312] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:50,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:50,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:50,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015524995] [2023-12-05 21:09:50,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:50,939 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:50,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:50,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:50,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:50,940 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 162 [2023-12-05 21:09:50,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 153 transitions, 815 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:50,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:50,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 162 [2023-12-05 21:09:50,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:51,088 INFO L124 PetriNetUnfolderBase]: 214/793 cut-off events. [2023-12-05 21:09:51,089 INFO L125 PetriNetUnfolderBase]: For 1091/1221 co-relation queries the response was YES. [2023-12-05 21:09:51,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3035 conditions, 793 events. 214/793 cut-off events. For 1091/1221 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4646 event pairs, 19 based on Foata normal form. 2/681 useless extension candidates. Maximal degree in co-relation 2917. Up to 326 conditions per place. [2023-12-05 21:09:51,100 INFO L140 encePairwiseOnDemand]: 159/162 looper letters, 55 selfloop transitions, 2 changer transitions 0/162 dead transitions. [2023-12-05 21:09:51,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 162 transitions, 1041 flow [2023-12-05 21:09:51,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:51,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:51,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-12-05 21:09:51,102 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2023-12-05 21:09:51,102 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-12-05 21:09:51,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-12-05 21:09:51,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:51,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-12-05 21:09:51,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:51,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:51,105 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:51,107 INFO L308 CegarLoopForPetriNet]: 166 programPoint places, -8 predicate places. [2023-12-05 21:09:51,107 INFO L500 AbstractCegarLoop]: Abstraction has has 158 places, 162 transitions, 1041 flow [2023-12-05 21:09:51,107 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:51,107 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:51,107 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:51,108 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:09:51,108 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:09:51,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:51,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1293355311, now seen corresponding path program 1 times [2023-12-05 21:09:51,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:51,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084868584] [2023-12-05 21:09:51,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:51,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:51,164 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:09:51,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:51,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084868584] [2023-12-05 21:09:51,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084868584] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:51,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:51,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:51,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246562137] [2023-12-05 21:09:51,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:51,166 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:51,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:51,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:51,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:51,168 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 162 [2023-12-05 21:09:51,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 162 transitions, 1041 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:51,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:51,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 162 [2023-12-05 21:09:51,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:51,330 INFO L124 PetriNetUnfolderBase]: 246/868 cut-off events. [2023-12-05 21:09:51,330 INFO L125 PetriNetUnfolderBase]: For 1975/2047 co-relation queries the response was YES. [2023-12-05 21:09:51,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3734 conditions, 868 events. 246/868 cut-off events. For 1975/2047 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5159 event pairs, 29 based on Foata normal form. 2/741 useless extension candidates. Maximal degree in co-relation 3607. Up to 368 conditions per place. [2023-12-05 21:09:51,337 INFO L140 encePairwiseOnDemand]: 159/162 looper letters, 60 selfloop transitions, 2 changer transitions 0/162 dead transitions. [2023-12-05 21:09:51,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 162 transitions, 1171 flow [2023-12-05 21:09:51,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:51,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:51,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-12-05 21:09:51,338 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7263374485596708 [2023-12-05 21:09:51,338 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-12-05 21:09:51,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-12-05 21:09:51,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:51,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-12-05 21:09:51,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:51,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:51,340 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:51,341 INFO L308 CegarLoopForPetriNet]: 166 programPoint places, -7 predicate places. [2023-12-05 21:09:51,341 INFO L500 AbstractCegarLoop]: Abstraction has has 159 places, 162 transitions, 1171 flow [2023-12-05 21:09:51,341 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:51,341 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:51,341 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:51,342 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:09:51,342 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:09:51,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:51,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1293355312, now seen corresponding path program 1 times [2023-12-05 21:09:51,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:51,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324283627] [2023-12-05 21:09:51,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:51,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:51,418 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:09:51,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:51,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324283627] [2023-12-05 21:09:51,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324283627] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:51,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:51,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:51,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553450753] [2023-12-05 21:09:51,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:51,420 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:51,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:51,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:51,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:51,421 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 162 [2023-12-05 21:09:51,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 162 transitions, 1171 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:51,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:51,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 162 [2023-12-05 21:09:51,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:51,559 INFO L124 PetriNetUnfolderBase]: 245/840 cut-off events. [2023-12-05 21:09:51,560 INFO L125 PetriNetUnfolderBase]: For 2680/2764 co-relation queries the response was YES. [2023-12-05 21:09:51,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4091 conditions, 840 events. 245/840 cut-off events. For 2680/2764 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4969 event pairs, 19 based on Foata normal form. 2/713 useless extension candidates. Maximal degree in co-relation 3956. Up to 368 conditions per place. [2023-12-05 21:09:51,569 INFO L140 encePairwiseOnDemand]: 159/162 looper letters, 63 selfloop transitions, 2 changer transitions 2/171 dead transitions. [2023-12-05 21:09:51,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 171 transitions, 1455 flow [2023-12-05 21:09:51,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:51,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:51,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-12-05 21:09:51,571 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7448559670781894 [2023-12-05 21:09:51,571 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-12-05 21:09:51,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-12-05 21:09:51,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:51,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-12-05 21:09:51,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:51,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:51,573 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:51,574 INFO L308 CegarLoopForPetriNet]: 166 programPoint places, -6 predicate places. [2023-12-05 21:09:51,574 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 171 transitions, 1455 flow [2023-12-05 21:09:51,575 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:51,575 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:51,575 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:51,575 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:09:51,575 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:09:51,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:51,576 INFO L85 PathProgramCache]: Analyzing trace with hash 704609742, now seen corresponding path program 1 times [2023-12-05 21:09:51,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:51,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523687607] [2023-12-05 21:09:51,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:51,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:51,696 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:09:51,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:51,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523687607] [2023-12-05 21:09:51,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523687607] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:51,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:51,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:51,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007539287] [2023-12-05 21:09:51,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:51,697 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:51,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:51,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:51,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:51,699 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 162 [2023-12-05 21:09:51,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 171 transitions, 1455 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:51,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:51,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 162 [2023-12-05 21:09:51,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:51,832 INFO L124 PetriNetUnfolderBase]: 235/826 cut-off events. [2023-12-05 21:09:51,832 INFO L125 PetriNetUnfolderBase]: For 3225/3321 co-relation queries the response was YES. [2023-12-05 21:09:51,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4236 conditions, 826 events. 235/826 cut-off events. For 3225/3321 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4942 event pairs, 15 based on Foata normal form. 0/703 useless extension candidates. Maximal degree in co-relation 4098. Up to 368 conditions per place. [2023-12-05 21:09:51,839 INFO L140 encePairwiseOnDemand]: 158/162 looper letters, 61 selfloop transitions, 11 changer transitions 11/201 dead transitions. [2023-12-05 21:09:51,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 201 transitions, 2167 flow [2023-12-05 21:09:51,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:51,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2023-12-05 21:09:51,841 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8251028806584362 [2023-12-05 21:09:51,841 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2023-12-05 21:09:51,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2023-12-05 21:09:51,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:51,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2023-12-05 21:09:51,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:51,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:51,843 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:51,844 INFO L308 CegarLoopForPetriNet]: 166 programPoint places, -4 predicate places. [2023-12-05 21:09:51,844 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 201 transitions, 2167 flow [2023-12-05 21:09:51,844 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:09:51,844 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:51,844 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:51,844 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:09:51,845 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:09:51,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:51,847 INFO L85 PathProgramCache]: Analyzing trace with hash -441422687, now seen corresponding path program 1 times [2023-12-05 21:09:51,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:51,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061595086] [2023-12-05 21:09:51,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:51,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:51,948 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:09:51,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:51,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061595086] [2023-12-05 21:09:51,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061595086] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:51,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:51,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:09:51,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280638946] [2023-12-05 21:09:51,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:51,950 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:09:51,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:51,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:09:51,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:09:51,951 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 162 [2023-12-05 21:09:51,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 201 transitions, 2167 flow. Second operand has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:51,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:51,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 162 [2023-12-05 21:09:51,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:52,125 INFO L124 PetriNetUnfolderBase]: 233/801 cut-off events. [2023-12-05 21:09:52,126 INFO L125 PetriNetUnfolderBase]: For 4000/4108 co-relation queries the response was YES. [2023-12-05 21:09:52,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4526 conditions, 801 events. 233/801 cut-off events. For 4000/4108 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4635 event pairs, 13 based on Foata normal form. 0/681 useless extension candidates. Maximal degree in co-relation 4377. Up to 368 conditions per place. [2023-12-05 21:09:52,132 INFO L140 encePairwiseOnDemand]: 155/162 looper letters, 81 selfloop transitions, 16 changer transitions 11/209 dead transitions. [2023-12-05 21:09:52,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 209 transitions, 2495 flow [2023-12-05 21:09:52,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:09:52,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:09:52,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 478 transitions. [2023-12-05 21:09:52,134 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7376543209876543 [2023-12-05 21:09:52,134 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 478 transitions. [2023-12-05 21:09:52,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 478 transitions. [2023-12-05 21:09:52,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:52,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 478 transitions. [2023-12-05 21:09:52,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:52,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 162.0) internal successors, (810), 5 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:52,136 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 162.0) internal successors, (810), 5 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:52,137 INFO L308 CegarLoopForPetriNet]: 166 programPoint places, -2 predicate places. [2023-12-05 21:09:52,137 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 209 transitions, 2495 flow [2023-12-05 21:09:52,137 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:52,138 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:52,138 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:52,138 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:09:52,138 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:09:52,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:52,138 INFO L85 PathProgramCache]: Analyzing trace with hash -441422686, now seen corresponding path program 1 times [2023-12-05 21:09:52,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:52,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226823620] [2023-12-05 21:09:52,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:52,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:52,323 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:09:52,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:52,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226823620] [2023-12-05 21:09:52,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226823620] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:52,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:52,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:09:52,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489939869] [2023-12-05 21:09:52,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:52,324 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:09:52,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:52,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:09:52,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:09:52,326 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 162 [2023-12-05 21:09:52,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 209 transitions, 2495 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:52,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:52,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 162 [2023-12-05 21:09:52,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:52,480 INFO L124 PetriNetUnfolderBase]: 231/796 cut-off events. [2023-12-05 21:09:52,481 INFO L125 PetriNetUnfolderBase]: For 4847/4967 co-relation queries the response was YES. [2023-12-05 21:09:52,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4763 conditions, 796 events. 231/796 cut-off events. For 4847/4967 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4609 event pairs, 11 based on Foata normal form. 0/679 useless extension candidates. Maximal degree in co-relation 4604. Up to 368 conditions per place. [2023-12-05 21:09:52,487 INFO L140 encePairwiseOnDemand]: 159/162 looper letters, 73 selfloop transitions, 11 changer transitions 12/208 dead transitions. [2023-12-05 21:09:52,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 208 transitions, 2665 flow [2023-12-05 21:09:52,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:09:52,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:09:52,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2023-12-05 21:09:52,488 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7438271604938271 [2023-12-05 21:09:52,488 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2023-12-05 21:09:52,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2023-12-05 21:09:52,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:52,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2023-12-05 21:09:52,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:52,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 162.0) internal successors, (810), 5 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:52,491 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 162.0) internal successors, (810), 5 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:52,491 INFO L308 CegarLoopForPetriNet]: 166 programPoint places, 0 predicate places. [2023-12-05 21:09:52,491 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 208 transitions, 2665 flow [2023-12-05 21:09:52,492 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:52,492 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:52,492 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] [2023-12-05 21:09:52,492 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:09:52,493 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:09:52,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:52,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1993985751, now seen corresponding path program 1 times [2023-12-05 21:09:52,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:52,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258453043] [2023-12-05 21:09:52,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:52,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:52,657 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:09:52,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:52,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258453043] [2023-12-05 21:09:52,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258453043] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:52,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:52,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:09:52,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803687319] [2023-12-05 21:09:52,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:52,658 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:09:52,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:52,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:09:52,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:09:52,659 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 162 [2023-12-05 21:09:52,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 208 transitions, 2665 flow. Second operand has 7 states, 7 states have (on average 106.85714285714286) internal successors, (748), 7 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:52,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:52,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 162 [2023-12-05 21:09:52,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:52,837 INFO L124 PetriNetUnfolderBase]: 189/704 cut-off events. [2023-12-05 21:09:52,838 INFO L125 PetriNetUnfolderBase]: For 5486/5618 co-relation queries the response was YES. [2023-12-05 21:09:52,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4391 conditions, 704 events. 189/704 cut-off events. For 5486/5618 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3902 event pairs, 11 based on Foata normal form. 0/617 useless extension candidates. Maximal degree in co-relation 4221. Up to 309 conditions per place. [2023-12-05 21:09:52,844 INFO L140 encePairwiseOnDemand]: 149/162 looper letters, 77 selfloop transitions, 22 changer transitions 14/210 dead transitions. [2023-12-05 21:09:52,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 210 transitions, 2939 flow [2023-12-05 21:09:52,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 21:09:52,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 21:09:52,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 673 transitions. [2023-12-05 21:09:52,846 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6923868312757202 [2023-12-05 21:09:52,846 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 673 transitions. [2023-12-05 21:09:52,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 673 transitions. [2023-12-05 21:09:52,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:52,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 673 transitions. [2023-12-05 21:09:52,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:52,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:52,850 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:52,850 INFO L308 CegarLoopForPetriNet]: 166 programPoint places, 5 predicate places. [2023-12-05 21:09:52,850 INFO L500 AbstractCegarLoop]: Abstraction has has 171 places, 210 transitions, 2939 flow [2023-12-05 21:09:52,851 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.85714285714286) internal successors, (748), 7 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:52,851 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:52,851 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:52,851 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:09:52,851 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:09:52,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:52,852 INFO L85 PathProgramCache]: Analyzing trace with hash 660303901, now seen corresponding path program 1 times [2023-12-05 21:09:52,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:52,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273278858] [2023-12-05 21:09:52,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:52,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:53,155 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:09:53,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:53,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273278858] [2023-12-05 21:09:53,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273278858] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:53,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:53,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-05 21:09:53,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346706488] [2023-12-05 21:09:53,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:53,156 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-05 21:09:53,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:53,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-05 21:09:53,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-05 21:09:53,158 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 162 [2023-12-05 21:09:53,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 210 transitions, 2939 flow. Second operand has 9 states, 9 states have (on average 104.44444444444444) internal successors, (940), 9 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:53,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:53,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 162 [2023-12-05 21:09:53,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:53,330 INFO L124 PetriNetUnfolderBase]: 147/609 cut-off events. [2023-12-05 21:09:53,330 INFO L125 PetriNetUnfolderBase]: For 5481/5625 co-relation queries the response was YES. [2023-12-05 21:09:53,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3926 conditions, 609 events. 147/609 cut-off events. For 5481/5625 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3088 event pairs, 11 based on Foata normal form. 0/552 useless extension candidates. Maximal degree in co-relation 3745. Up to 250 conditions per place. [2023-12-05 21:09:53,338 INFO L140 encePairwiseOnDemand]: 148/162 looper letters, 79 selfloop transitions, 18 changer transitions 19/212 dead transitions. [2023-12-05 21:09:53,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 212 transitions, 3223 flow [2023-12-05 21:09:53,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:09:53,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:09:53,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 869 transitions. [2023-12-05 21:09:53,340 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6705246913580247 [2023-12-05 21:09:53,341 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 869 transitions. [2023-12-05 21:09:53,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 869 transitions. [2023-12-05 21:09:53,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:53,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 869 transitions. [2023-12-05 21:09:53,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 108.625) internal successors, (869), 8 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:53,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 162.0) internal successors, (1458), 9 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:53,344 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 162.0) internal successors, (1458), 9 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:53,345 INFO L308 CegarLoopForPetriNet]: 166 programPoint places, 12 predicate places. [2023-12-05 21:09:53,345 INFO L500 AbstractCegarLoop]: Abstraction has has 178 places, 212 transitions, 3223 flow [2023-12-05 21:09:53,346 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 104.44444444444444) internal successors, (940), 9 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:53,346 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:53,346 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:53,346 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:09:53,346 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:09:53,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:53,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1104423692, now seen corresponding path program 1 times [2023-12-05 21:09:53,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:53,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487900731] [2023-12-05 21:09:53,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:53,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:53,721 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:09:53,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:53,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487900731] [2023-12-05 21:09:53,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487900731] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:53,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:53,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-05 21:09:53,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275385479] [2023-12-05 21:09:53,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:53,722 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:09:53,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:53,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:09:53,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:09:53,724 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 162 [2023-12-05 21:09:53,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 212 transitions, 3223 flow. Second operand has 11 states, 11 states have (on average 102.18181818181819) internal successors, (1124), 11 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:53,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:53,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 162 [2023-12-05 21:09:53,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:53,885 INFO L124 PetriNetUnfolderBase]: 101/463 cut-off events. [2023-12-05 21:09:53,885 INFO L125 PetriNetUnfolderBase]: For 4776/4932 co-relation queries the response was YES. [2023-12-05 21:09:53,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2992 conditions, 463 events. 101/463 cut-off events. For 4776/4932 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1879 event pairs, 8 based on Foata normal form. 0/451 useless extension candidates. Maximal degree in co-relation 2800. Up to 153 conditions per place. [2023-12-05 21:09:53,888 INFO L140 encePairwiseOnDemand]: 150/162 looper letters, 0 selfloop transitions, 0 changer transitions 198/198 dead transitions. [2023-12-05 21:09:53,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 198 transitions, 3037 flow [2023-12-05 21:09:53,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 21:09:53,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 21:09:53,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 947 transitions. [2023-12-05 21:09:53,890 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.649519890260631 [2023-12-05 21:09:53,890 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 947 transitions. [2023-12-05 21:09:53,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 947 transitions. [2023-12-05 21:09:53,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:53,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 947 transitions. [2023-12-05 21:09:53,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 105.22222222222223) internal successors, (947), 9 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:53,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 162.0) internal successors, (1620), 10 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:53,894 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 162.0) internal successors, (1620), 10 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:53,895 INFO L308 CegarLoopForPetriNet]: 166 programPoint places, 16 predicate places. [2023-12-05 21:09:53,895 INFO L500 AbstractCegarLoop]: Abstraction has has 182 places, 198 transitions, 3037 flow [2023-12-05 21:09:53,896 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 102.18181818181819) internal successors, (1124), 11 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:53,904 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe018_rmo.oepc.i_BEv2_AllErrorsAtOnce [2023-12-05 21:09:53,952 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 51 remaining) [2023-12-05 21:09:53,952 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 51 remaining) [2023-12-05 21:09:53,952 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 51 remaining) [2023-12-05 21:09:53,952 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 51 remaining) [2023-12-05 21:09:53,952 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 51 remaining) [2023-12-05 21:09:53,952 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 51 remaining) [2023-12-05 21:09:53,952 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 51 remaining) [2023-12-05 21:09:53,952 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 51 remaining) [2023-12-05 21:09:53,953 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 51 remaining) [2023-12-05 21:09:53,953 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 51 remaining) [2023-12-05 21:09:53,953 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 51 remaining) [2023-12-05 21:09:53,953 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 51 remaining) [2023-12-05 21:09:53,953 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 51 remaining) [2023-12-05 21:09:53,953 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 51 remaining) [2023-12-05 21:09:53,953 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 51 remaining) [2023-12-05 21:09:53,953 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 51 remaining) [2023-12-05 21:09:53,953 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 51 remaining) [2023-12-05 21:09:53,953 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 51 remaining) [2023-12-05 21:09:53,953 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 51 remaining) [2023-12-05 21:09:53,953 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 51 remaining) [2023-12-05 21:09:53,953 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 51 remaining) [2023-12-05 21:09:53,953 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 51 remaining) [2023-12-05 21:09:53,954 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 51 remaining) [2023-12-05 21:09:53,954 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 51 remaining) [2023-12-05 21:09:53,954 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 51 remaining) [2023-12-05 21:09:53,954 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 51 remaining) [2023-12-05 21:09:53,954 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 51 remaining) [2023-12-05 21:09:53,954 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 51 remaining) [2023-12-05 21:09:53,954 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 51 remaining) [2023-12-05 21:09:53,954 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 51 remaining) [2023-12-05 21:09:53,954 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 51 remaining) [2023-12-05 21:09:53,954 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 51 remaining) [2023-12-05 21:09:53,954 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 51 remaining) [2023-12-05 21:09:53,954 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 51 remaining) [2023-12-05 21:09:53,954 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 51 remaining) [2023-12-05 21:09:53,954 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 51 remaining) [2023-12-05 21:09:53,955 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 51 remaining) [2023-12-05 21:09:53,955 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 51 remaining) [2023-12-05 21:09:53,955 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 51 remaining) [2023-12-05 21:09:53,955 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 51 remaining) [2023-12-05 21:09:53,955 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 51 remaining) [2023-12-05 21:09:53,955 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 51 remaining) [2023-12-05 21:09:53,955 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 51 remaining) [2023-12-05 21:09:53,955 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 51 remaining) [2023-12-05 21:09:53,955 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 51 remaining) [2023-12-05 21:09:53,955 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 51 remaining) [2023-12-05 21:09:53,955 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 51 remaining) [2023-12-05 21:09:53,955 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 51 remaining) [2023-12-05 21:09:53,955 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 51 remaining) [2023-12-05 21:09:53,955 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 51 remaining) [2023-12-05 21:09:53,956 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 51 remaining) [2023-12-05 21:09:53,956 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:09:53,956 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:53,960 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:09:53,960 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:09:53,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:09:53 BasicIcfg [2023-12-05 21:09:53,967 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:09:53,967 INFO L158 Benchmark]: Toolchain (without parser) took 7004.77ms. Allocated memory was 244.3MB in the beginning and 667.9MB in the end (delta: 423.6MB). Free memory was 190.6MB in the beginning and 359.4MB in the end (delta: -168.9MB). Peak memory consumption was 255.3MB. Max. memory is 8.0GB. [2023-12-05 21:09:53,967 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 191.9MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:09:53,967 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.83ms. Allocated memory is still 244.3MB. Free memory was 190.6MB in the beginning and 167.4MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-12-05 21:09:53,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.77ms. Allocated memory is still 244.3MB. Free memory was 167.4MB in the beginning and 164.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:09:53,968 INFO L158 Benchmark]: Boogie Preprocessor took 30.95ms. Allocated memory is still 244.3MB. Free memory was 164.9MB in the beginning and 162.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:09:53,968 INFO L158 Benchmark]: RCFGBuilder took 660.64ms. Allocated memory is still 244.3MB. Free memory was 162.8MB in the beginning and 164.8MB in the end (delta: -2.0MB). Peak memory consumption was 37.8MB. Max. memory is 8.0GB. [2023-12-05 21:09:53,968 INFO L158 Benchmark]: TraceAbstraction took 5886.63ms. Allocated memory was 244.3MB in the beginning and 667.9MB in the end (delta: 423.6MB). Free memory was 164.3MB in the beginning and 359.4MB in the end (delta: -195.2MB). Peak memory consumption was 227.9MB. Max. memory is 8.0GB. [2023-12-05 21:09:53,969 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.12ms. Allocated memory is still 191.9MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 367.83ms. Allocated memory is still 244.3MB. Free memory was 190.6MB in the beginning and 167.4MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.77ms. Allocated memory is still 244.3MB. Free memory was 167.4MB in the beginning and 164.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.95ms. Allocated memory is still 244.3MB. Free memory was 164.9MB in the beginning and 162.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 660.64ms. Allocated memory is still 244.3MB. Free memory was 162.8MB in the beginning and 164.8MB in the end (delta: -2.0MB). Peak memory consumption was 37.8MB. Max. memory is 8.0GB. * TraceAbstraction took 5886.63ms. Allocated memory was 244.3MB in the beginning and 667.9MB in the end (delta: 423.6MB). Free memory was 164.3MB in the beginning and 359.4MB in the end (delta: -195.2MB). Peak memory consumption was 227.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 204 locations, 51 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: 5.8s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 434 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 434 mSDsluCounter, 174 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 851 IncrementalHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 138 mSDtfsCounter, 851 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3223occurred in iteration=13, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1042 NumberOfCodeBlocks, 1042 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1028 ConstructedInterpolants, 0 QuantifiedInterpolants, 4279 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:09:53,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...