/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe012_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:48:40,457 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:48:40,533 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 04:48:40,558 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:48:40,560 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:48:40,560 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:48:40,560 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:48:40,561 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:48:40,561 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:48:40,564 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:48:40,564 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:48:40,565 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:48:40,565 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:48:40,566 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:48:40,566 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:48:40,566 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:48:40,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:48:40,566 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:48:40,567 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:48:40,567 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:48:40,567 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:48:40,567 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:48:40,568 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:48:40,568 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:48:40,568 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:48:40,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:48:40,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:48:40,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:48:40,569 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:48:40,569 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:48:40,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:48:40,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:48:40,570 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:48:40,570 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-11-30 04:48:40,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:48:40,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:48:40,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:48:40,785 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:48:40,786 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:48:40,786 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_power.opt.i [2023-11-30 04:48:41,737 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:48:41,978 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:48:41,978 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_power.opt.i [2023-11-30 04:48:41,995 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/835ec2ab3/facab7e8cf864d49ba3816d359cdc8af/FLAG6a73bba3b [2023-11-30 04:48:42,003 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/835ec2ab3/facab7e8cf864d49ba3816d359cdc8af [2023-11-30 04:48:42,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:48:42,006 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:48:42,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:48:42,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:48:42,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:48:42,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:48:42" (1/1) ... [2023-11-30 04:48:42,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b5f6da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:42, skipping insertion in model container [2023-11-30 04:48:42,011 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:48:42" (1/1) ... [2023-11-30 04:48:42,048 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:48:42,310 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:48:42,322 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:48:42,363 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:48:42,382 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:48:42,382 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:48:42,387 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:48:42,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:42 WrapperNode [2023-11-30 04:48:42,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:48:42,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:48:42,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:48:42,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:48:42,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:42" (1/1) ... [2023-11-30 04:48:42,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:42" (1/1) ... [2023-11-30 04:48:42,422 INFO L138 Inliner]: procedures = 176, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 187 [2023-11-30 04:48:42,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:48:42,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:48:42,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:48:42,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:48:42,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:42" (1/1) ... [2023-11-30 04:48:42,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:42" (1/1) ... [2023-11-30 04:48:42,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:42" (1/1) ... [2023-11-30 04:48:42,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:42" (1/1) ... [2023-11-30 04:48:42,440 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:42" (1/1) ... [2023-11-30 04:48:42,442 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:42" (1/1) ... [2023-11-30 04:48:42,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:42" (1/1) ... [2023-11-30 04:48:42,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:42" (1/1) ... [2023-11-30 04:48:42,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:48:42,448 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:48:42,448 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:48:42,448 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:48:42,449 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:42" (1/1) ... [2023-11-30 04:48:42,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:48:42,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:48:42,484 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 04:48:42,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 04:48:42,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 04:48:42,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:48:42,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:48:42,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:48:42,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:48:42,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:48:42,513 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-30 04:48:42,513 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-30 04:48:42,513 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-30 04:48:42,513 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-30 04:48:42,513 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-30 04:48:42,513 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-30 04:48:42,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:48:42,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:48:42,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:48:42,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:48:42,514 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 04:48:42,629 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:48:42,631 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:48:43,130 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:48:43,402 WARN L1821 r$LargeBlockEncoding]: Complex 4:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2023-11-30 04:48:43,482 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:48:43,482 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:48:43,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:48:43 BoogieIcfgContainer [2023-11-30 04:48:43,483 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:48:43,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:48:43,486 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:48:43,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:48:43,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:48:42" (1/3) ... [2023-11-30 04:48:43,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e6bbc3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:48:43, skipping insertion in model container [2023-11-30 04:48:43,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:42" (2/3) ... [2023-11-30 04:48:43,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e6bbc3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:48:43, skipping insertion in model container [2023-11-30 04:48:43,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:48:43" (3/3) ... [2023-11-30 04:48:43,490 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_power.opt.i [2023-11-30 04:48:43,503 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:48:43,503 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2023-11-30 04:48:43,504 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:48:43,620 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:48:43,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 197 transitions, 406 flow [2023-11-30 04:48:43,730 INFO L124 PetriNetUnfolderBase]: 30/194 cut-off events. [2023-11-30 04:48:43,730 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:48:43,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 30/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 282 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 137. Up to 4 conditions per place. [2023-11-30 04:48:43,736 INFO L82 GeneralOperation]: Start removeDead. Operand has 177 places, 197 transitions, 406 flow [2023-11-30 04:48:43,745 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 194 transitions, 397 flow [2023-11-30 04:48:43,755 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:48:43,762 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;@7782b5d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:48:43,762 INFO L363 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2023-11-30 04:48:43,773 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:48:43,773 INFO L124 PetriNetUnfolderBase]: 0/58 cut-off events. [2023-11-30 04:48:43,773 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:48:43,773 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:43,774 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:43,774 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-30 04:48:43,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:43,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1007369923, now seen corresponding path program 1 times [2023-11-30 04:48:43,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:43,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141822996] [2023-11-30 04:48:43,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:43,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:44,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:48:44,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:44,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141822996] [2023-11-30 04:48:44,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141822996] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:44,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:44,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:48:44,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494557713] [2023-11-30 04:48:44,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:44,102 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:44,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:44,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:44,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:44,128 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 197 [2023-11-30 04:48:44,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 194 transitions, 397 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:44,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:44,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 197 [2023-11-30 04:48:44,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:44,941 INFO L124 PetriNetUnfolderBase]: 1796/3930 cut-off events. [2023-11-30 04:48:44,941 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-30 04:48:44,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6671 conditions, 3930 events. 1796/3930 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 29941 event pairs, 952 based on Foata normal form. 133/2143 useless extension candidates. Maximal degree in co-relation 6595. Up to 1743 conditions per place. [2023-11-30 04:48:44,971 INFO L140 encePairwiseOnDemand]: 153/197 looper letters, 62 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2023-11-30 04:48:44,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 166 transitions, 469 flow [2023-11-30 04:48:44,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:44,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:44,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2023-11-30 04:48:44,984 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7868020304568528 [2023-11-30 04:48:44,984 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 465 transitions. [2023-11-30 04:48:44,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 465 transitions. [2023-11-30 04:48:44,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:44,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 465 transitions. [2023-11-30 04:48:44,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:44,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:44,996 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:44,999 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, -16 predicate places. [2023-11-30 04:48:44,999 INFO L500 AbstractCegarLoop]: Abstraction has has 158 places, 166 transitions, 469 flow [2023-11-30 04:48:44,999 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:44,999 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:45,000 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:45,000 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:48:45,000 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-30 04:48:45,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:45,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1007369924, now seen corresponding path program 1 times [2023-11-30 04:48:45,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:45,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216901780] [2023-11-30 04:48:45,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:45,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:45,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:48:45,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:45,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216901780] [2023-11-30 04:48:45,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216901780] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:45,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:45,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:48:45,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091398457] [2023-11-30 04:48:45,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:45,133 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:45,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:45,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:45,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:45,135 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 197 [2023-11-30 04:48:45,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 166 transitions, 469 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:45,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:45,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 197 [2023-11-30 04:48:45,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:45,866 INFO L124 PetriNetUnfolderBase]: 1802/3943 cut-off events. [2023-11-30 04:48:45,866 INFO L125 PetriNetUnfolderBase]: For 327/861 co-relation queries the response was YES. [2023-11-30 04:48:45,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9286 conditions, 3943 events. 1802/3943 cut-off events. For 327/861 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 30011 event pairs, 958 based on Foata normal form. 0/2018 useless extension candidates. Maximal degree in co-relation 9204. Up to 1942 conditions per place. [2023-11-30 04:48:45,899 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 75 selfloop transitions, 2 changer transitions 0/182 dead transitions. [2023-11-30 04:48:45,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 182 transitions, 687 flow [2023-11-30 04:48:45,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:45,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:45,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2023-11-30 04:48:45,901 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6615905245346869 [2023-11-30 04:48:45,901 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 391 transitions. [2023-11-30 04:48:45,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 391 transitions. [2023-11-30 04:48:45,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:45,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 391 transitions. [2023-11-30 04:48:45,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:45,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:45,904 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:45,905 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, -15 predicate places. [2023-11-30 04:48:45,905 INFO L500 AbstractCegarLoop]: Abstraction has has 159 places, 182 transitions, 687 flow [2023-11-30 04:48:45,905 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:45,905 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:45,906 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:45,906 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:48:45,906 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-30 04:48:45,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:45,907 INFO L85 PathProgramCache]: Analyzing trace with hash -628274324, now seen corresponding path program 1 times [2023-11-30 04:48:45,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:45,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294442672] [2023-11-30 04:48:45,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:45,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:46,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:48:46,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:46,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294442672] [2023-11-30 04:48:46,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294442672] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:46,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:46,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:48:46,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764817900] [2023-11-30 04:48:46,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:46,015 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:46,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:46,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:46,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:46,016 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 197 [2023-11-30 04:48:46,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 182 transitions, 687 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:46,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:46,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 197 [2023-11-30 04:48:46,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:46,763 INFO L124 PetriNetUnfolderBase]: 1933/4073 cut-off events. [2023-11-30 04:48:46,763 INFO L125 PetriNetUnfolderBase]: For 976/2074 co-relation queries the response was YES. [2023-11-30 04:48:46,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12532 conditions, 4073 events. 1933/4073 cut-off events. For 976/2074 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 30467 event pairs, 958 based on Foata normal form. 1/2050 useless extension candidates. Maximal degree in co-relation 12441. Up to 1942 conditions per place. [2023-11-30 04:48:46,801 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 78 selfloop transitions, 2 changer transitions 0/181 dead transitions. [2023-11-30 04:48:46,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 181 transitions, 843 flow [2023-11-30 04:48:46,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:46,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:46,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2023-11-30 04:48:46,802 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6514382402707276 [2023-11-30 04:48:46,803 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2023-11-30 04:48:46,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2023-11-30 04:48:46,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:46,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2023-11-30 04:48:46,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:46,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:46,806 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:46,806 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, -14 predicate places. [2023-11-30 04:48:46,806 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 181 transitions, 843 flow [2023-11-30 04:48:46,807 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:46,807 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:46,807 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:46,807 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:48:46,807 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-30 04:48:46,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:46,807 INFO L85 PathProgramCache]: Analyzing trace with hash -628274323, now seen corresponding path program 1 times [2023-11-30 04:48:46,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:46,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951209975] [2023-11-30 04:48:46,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:46,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:46,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:48:46,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:46,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951209975] [2023-11-30 04:48:46,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951209975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:46,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:46,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:48:46,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830736] [2023-11-30 04:48:46,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:46,876 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:46,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:46,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:46,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:46,877 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 197 [2023-11-30 04:48:46,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 181 transitions, 843 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:46,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:46,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 197 [2023-11-30 04:48:46,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:47,505 INFO L124 PetriNetUnfolderBase]: 1933/4072 cut-off events. [2023-11-30 04:48:47,505 INFO L125 PetriNetUnfolderBase]: For 1784/3446 co-relation queries the response was YES. [2023-11-30 04:48:47,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15256 conditions, 4072 events. 1933/4072 cut-off events. For 1784/3446 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 30367 event pairs, 958 based on Foata normal form. 1/2049 useless extension candidates. Maximal degree in co-relation 15157. Up to 2200 conditions per place. [2023-11-30 04:48:47,538 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 91 selfloop transitions, 2 changer transitions 0/197 dead transitions. [2023-11-30 04:48:47,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 197 transitions, 1159 flow [2023-11-30 04:48:47,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:47,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:47,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2023-11-30 04:48:47,540 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6598984771573604 [2023-11-30 04:48:47,540 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 390 transitions. [2023-11-30 04:48:47,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions. [2023-11-30 04:48:47,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:47,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions. [2023-11-30 04:48:47,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:47,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:47,542 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:47,543 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, -13 predicate places. [2023-11-30 04:48:47,543 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 197 transitions, 1159 flow [2023-11-30 04:48:47,543 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:47,543 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:47,544 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:47,544 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:48:47,544 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-30 04:48:47,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:47,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1656632728, now seen corresponding path program 1 times [2023-11-30 04:48:47,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:47,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571808275] [2023-11-30 04:48:47,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:47,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:47,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:48:47,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:47,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571808275] [2023-11-30 04:48:47,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571808275] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:47,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:47,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:48:47,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015753459] [2023-11-30 04:48:47,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:47,699 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:47,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:47,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:47,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:47,700 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 197 [2023-11-30 04:48:47,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 197 transitions, 1159 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:47,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:47,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 197 [2023-11-30 04:48:47,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:48,479 INFO L124 PetriNetUnfolderBase]: 2526/5043 cut-off events. [2023-11-30 04:48:48,479 INFO L125 PetriNetUnfolderBase]: For 3208/20932 co-relation queries the response was YES. [2023-11-30 04:48:48,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22937 conditions, 5043 events. 2526/5043 cut-off events. For 3208/20932 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 39078 event pairs, 515 based on Foata normal form. 0/2450 useless extension candidates. Maximal degree in co-relation 22834. Up to 2809 conditions per place. [2023-11-30 04:48:48,524 INFO L140 encePairwiseOnDemand]: 187/197 looper letters, 117 selfloop transitions, 25 changer transitions 0/258 dead transitions. [2023-11-30 04:48:48,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 258 transitions, 2056 flow [2023-11-30 04:48:48,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:48,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:48,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2023-11-30 04:48:48,526 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.727580372250423 [2023-11-30 04:48:48,526 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2023-11-30 04:48:48,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2023-11-30 04:48:48,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:48,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2023-11-30 04:48:48,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:48,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:48,529 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:48,529 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, -11 predicate places. [2023-11-30 04:48:48,529 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 258 transitions, 2056 flow [2023-11-30 04:48:48,530 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:48,530 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:48,530 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:48,530 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:48:48,530 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-30 04:48:48,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:48,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1656632726, now seen corresponding path program 1 times [2023-11-30 04:48:48,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:48,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870406846] [2023-11-30 04:48:48,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:48,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:48,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:48:48,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:48,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870406846] [2023-11-30 04:48:48,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870406846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:48,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:48,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 04:48:48,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042019691] [2023-11-30 04:48:48,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:48,718 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 04:48:48,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:48,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 04:48:48,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-30 04:48:48,721 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 197 [2023-11-30 04:48:48,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 258 transitions, 2056 flow. Second operand has 7 states, 7 states have (on average 105.14285714285714) internal successors, (736), 7 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:48,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:48,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 197 [2023-11-30 04:48:48,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:49,529 INFO L124 PetriNetUnfolderBase]: 1608/3423 cut-off events. [2023-11-30 04:48:49,529 INFO L125 PetriNetUnfolderBase]: For 3784/8594 co-relation queries the response was YES. [2023-11-30 04:48:49,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17323 conditions, 3423 events. 1608/3423 cut-off events. For 3784/8594 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 24673 event pairs, 231 based on Foata normal form. 0/2004 useless extension candidates. Maximal degree in co-relation 17209. Up to 1642 conditions per place. [2023-11-30 04:48:49,557 INFO L140 encePairwiseOnDemand]: 177/197 looper letters, 166 selfloop transitions, 30 changer transitions 0/294 dead transitions. [2023-11-30 04:48:49,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 294 transitions, 2866 flow [2023-11-30 04:48:49,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-30 04:48:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-30 04:48:49,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 960 transitions. [2023-11-30 04:48:49,560 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6091370558375635 [2023-11-30 04:48:49,560 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 960 transitions. [2023-11-30 04:48:49,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 960 transitions. [2023-11-30 04:48:49,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:49,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 960 transitions. [2023-11-30 04:48:49,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:49,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 197.0) internal successors, (1773), 9 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:49,564 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 197.0) internal successors, (1773), 9 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:49,564 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, -6 predicate places. [2023-11-30 04:48:49,565 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 294 transitions, 2866 flow [2023-11-30 04:48:49,565 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.14285714285714) internal successors, (736), 7 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:49,565 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:49,565 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:49,565 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:48:49,565 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-30 04:48:49,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:49,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1656632725, now seen corresponding path program 1 times [2023-11-30 04:48:49,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:49,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877797205] [2023-11-30 04:48:49,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:49,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:49,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-11-30 04:48:49,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:49,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877797205] [2023-11-30 04:48:49,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877797205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:49,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:49,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 04:48:49,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738684771] [2023-11-30 04:48:49,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:49,722 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 04:48:49,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:49,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 04:48:49,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-30 04:48:49,723 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 197 [2023-11-30 04:48:49,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 294 transitions, 2866 flow. Second operand has 7 states, 7 states have (on average 105.14285714285714) internal successors, (736), 7 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:49,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:49,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 197 [2023-11-30 04:48:49,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:50,090 INFO L124 PetriNetUnfolderBase]: 568/1379 cut-off events. [2023-11-30 04:48:50,090 INFO L125 PetriNetUnfolderBase]: For 2822/3444 co-relation queries the response was YES. [2023-11-30 04:48:50,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7176 conditions, 1379 events. 568/1379 cut-off events. For 2822/3444 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8013 event pairs, 56 based on Foata normal form. 26/1037 useless extension candidates. Maximal degree in co-relation 7051. Up to 687 conditions per place. [2023-11-30 04:48:50,100 INFO L140 encePairwiseOnDemand]: 178/197 looper letters, 102 selfloop transitions, 28 changer transitions 0/229 dead transitions. [2023-11-30 04:48:50,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 229 transitions, 2216 flow [2023-11-30 04:48:50,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 04:48:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 04:48:50,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 690 transitions. [2023-11-30 04:48:50,102 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.583756345177665 [2023-11-30 04:48:50,102 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 690 transitions. [2023-11-30 04:48:50,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 690 transitions. [2023-11-30 04:48:50,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:50,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 690 transitions. [2023-11-30 04:48:50,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:50,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:50,105 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:50,106 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, -8 predicate places. [2023-11-30 04:48:50,106 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 229 transitions, 2216 flow [2023-11-30 04:48:50,106 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.14285714285714) internal successors, (736), 7 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:50,106 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:50,106 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:50,106 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:48:50,107 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-30 04:48:50,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:50,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1875888069, now seen corresponding path program 1 times [2023-11-30 04:48:50,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:50,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438709049] [2023-11-30 04:48:50,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:50,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:50,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:48:50,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:50,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438709049] [2023-11-30 04:48:50,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438709049] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:50,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:50,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:48:50,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641413533] [2023-11-30 04:48:50,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:50,165 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:50,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:50,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:50,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:50,166 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 197 [2023-11-30 04:48:50,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 229 transitions, 2216 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:50,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:50,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 197 [2023-11-30 04:48:50,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:50,426 INFO L124 PetriNetUnfolderBase]: 672/1501 cut-off events. [2023-11-30 04:48:50,426 INFO L125 PetriNetUnfolderBase]: For 5159/5459 co-relation queries the response was YES. [2023-11-30 04:48:50,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8990 conditions, 1501 events. 672/1501 cut-off events. For 5159/5459 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8618 event pairs, 31 based on Foata normal form. 3/1080 useless extension candidates. Maximal degree in co-relation 8857. Up to 793 conditions per place. [2023-11-30 04:48:50,439 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 146 selfloop transitions, 2 changer transitions 8/260 dead transitions. [2023-11-30 04:48:50,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 260 transitions, 3032 flow [2023-11-30 04:48:50,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:50,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:50,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-11-30 04:48:50,440 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6362098138747885 [2023-11-30 04:48:50,440 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-11-30 04:48:50,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-11-30 04:48:50,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:50,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-11-30 04:48:50,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:50,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:50,445 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:50,447 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, -7 predicate places. [2023-11-30 04:48:50,448 INFO L500 AbstractCegarLoop]: Abstraction has has 167 places, 260 transitions, 3032 flow [2023-11-30 04:48:50,448 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:50,448 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:50,448 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:50,448 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:48:50,448 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-30 04:48:50,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:50,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1875888068, now seen corresponding path program 1 times [2023-11-30 04:48:50,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:50,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630106765] [2023-11-30 04:48:50,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:50,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:50,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:48:50,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:50,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630106765] [2023-11-30 04:48:50,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630106765] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:50,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:50,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:48:50,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678995212] [2023-11-30 04:48:50,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:50,483 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:50,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:50,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:50,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:50,484 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 197 [2023-11-30 04:48:50,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 260 transitions, 3032 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:50,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:50,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 197 [2023-11-30 04:48:50,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:50,755 INFO L124 PetriNetUnfolderBase]: 670/1491 cut-off events. [2023-11-30 04:48:50,756 INFO L125 PetriNetUnfolderBase]: For 6471/6835 co-relation queries the response was YES. [2023-11-30 04:48:50,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9942 conditions, 1491 events. 670/1491 cut-off events. For 6471/6835 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8531 event pairs, 31 based on Foata normal form. 3/1070 useless extension candidates. Maximal degree in co-relation 9800. Up to 798 conditions per place. [2023-11-30 04:48:50,769 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 148 selfloop transitions, 2 changer transitions 8/259 dead transitions. [2023-11-30 04:48:50,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 259 transitions, 3336 flow [2023-11-30 04:48:50,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:50,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:50,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-11-30 04:48:50,771 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6159052453468697 [2023-11-30 04:48:50,771 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-11-30 04:48:50,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-11-30 04:48:50,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:50,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-11-30 04:48:50,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:50,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:50,773 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:50,774 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, -6 predicate places. [2023-11-30 04:48:50,774 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 259 transitions, 3336 flow [2023-11-30 04:48:50,775 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:50,775 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:50,775 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:50,775 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 04:48:50,775 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-30 04:48:50,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:50,775 INFO L85 PathProgramCache]: Analyzing trace with hash -983351531, now seen corresponding path program 1 times [2023-11-30 04:48:50,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:50,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148389629] [2023-11-30 04:48:50,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:50,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:48:50,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:50,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148389629] [2023-11-30 04:48:50,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148389629] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:50,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:50,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:48:50,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358172826] [2023-11-30 04:48:50,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:50,916 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:50,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:50,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:50,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:50,917 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 197 [2023-11-30 04:48:50,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 259 transitions, 3336 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:50,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:50,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 197 [2023-11-30 04:48:50,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:51,197 INFO L124 PetriNetUnfolderBase]: 634/1408 cut-off events. [2023-11-30 04:48:51,198 INFO L125 PetriNetUnfolderBase]: For 7930/8532 co-relation queries the response was YES. [2023-11-30 04:48:51,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10200 conditions, 1408 events. 634/1408 cut-off events. For 7930/8532 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8046 event pairs, 15 based on Foata normal form. 3/1019 useless extension candidates. Maximal degree in co-relation 10055. Up to 798 conditions per place. [2023-11-30 04:48:51,210 INFO L140 encePairwiseOnDemand]: 190/197 looper letters, 113 selfloop transitions, 51 changer transitions 8/290 dead transitions. [2023-11-30 04:48:51,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 290 transitions, 4300 flow [2023-11-30 04:48:51,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:51,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:51,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-11-30 04:48:51,212 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6869712351945855 [2023-11-30 04:48:51,212 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-11-30 04:48:51,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-11-30 04:48:51,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:51,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-11-30 04:48:51,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:51,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:51,214 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:51,215 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, -4 predicate places. [2023-11-30 04:48:51,215 INFO L500 AbstractCegarLoop]: Abstraction has has 170 places, 290 transitions, 4300 flow [2023-11-30 04:48:51,215 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:51,215 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:51,215 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:51,215 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 04:48:51,215 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-30 04:48:51,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:51,216 INFO L85 PathProgramCache]: Analyzing trace with hash -107792965, now seen corresponding path program 1 times [2023-11-30 04:48:51,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:51,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271041512] [2023-11-30 04:48:51,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:51,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:51,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:48:51,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:51,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271041512] [2023-11-30 04:48:51,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271041512] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:51,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:51,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:48:51,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399761064] [2023-11-30 04:48:51,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:51,313 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:51,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:51,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:51,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:51,314 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 197 [2023-11-30 04:48:51,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 290 transitions, 4300 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:51,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:51,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 197 [2023-11-30 04:48:51,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:51,594 INFO L124 PetriNetUnfolderBase]: 575/1379 cut-off events. [2023-11-30 04:48:51,594 INFO L125 PetriNetUnfolderBase]: For 9412/9922 co-relation queries the response was YES. [2023-11-30 04:48:51,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10259 conditions, 1379 events. 575/1379 cut-off events. For 9412/9922 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8273 event pairs, 19 based on Foata normal form. 3/1049 useless extension candidates. Maximal degree in co-relation 10111. Up to 750 conditions per place. [2023-11-30 04:48:51,608 INFO L140 encePairwiseOnDemand]: 195/197 looper letters, 149 selfloop transitions, 1 changer transitions 7/275 dead transitions. [2023-11-30 04:48:51,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 275 transitions, 4284 flow [2023-11-30 04:48:51,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:51,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:51,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-11-30 04:48:51,610 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6734348561759729 [2023-11-30 04:48:51,610 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-11-30 04:48:51,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-11-30 04:48:51,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:51,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-11-30 04:48:51,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:51,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:51,613 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:51,613 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, -2 predicate places. [2023-11-30 04:48:51,613 INFO L500 AbstractCegarLoop]: Abstraction has has 172 places, 275 transitions, 4284 flow [2023-11-30 04:48:51,613 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:51,613 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:51,613 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:51,614 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 04:48:51,614 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-30 04:48:51,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:51,614 INFO L85 PathProgramCache]: Analyzing trace with hash -309657518, now seen corresponding path program 1 times [2023-11-30 04:48:51,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:51,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322385247] [2023-11-30 04:48:51,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:51,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:51,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:48:51,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:51,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322385247] [2023-11-30 04:48:51,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322385247] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:51,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:51,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:48:51,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354155441] [2023-11-30 04:48:51,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:51,715 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:51,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:51,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:51,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:51,716 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 197 [2023-11-30 04:48:51,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 275 transitions, 4284 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:51,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:51,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 197 [2023-11-30 04:48:51,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:52,039 INFO L124 PetriNetUnfolderBase]: 704/1860 cut-off events. [2023-11-30 04:48:52,040 INFO L125 PetriNetUnfolderBase]: For 14913/15677 co-relation queries the response was YES. [2023-11-30 04:48:52,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14004 conditions, 1860 events. 704/1860 cut-off events. For 14913/15677 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 13262 event pairs, 32 based on Foata normal form. 8/1462 useless extension candidates. Maximal degree in co-relation 13853. Up to 980 conditions per place. [2023-11-30 04:48:52,059 INFO L140 encePairwiseOnDemand]: 192/197 looper letters, 170 selfloop transitions, 24 changer transitions 9/321 dead transitions. [2023-11-30 04:48:52,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 321 transitions, 5797 flow [2023-11-30 04:48:52,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:52,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:52,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-11-30 04:48:52,061 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6971235194585449 [2023-11-30 04:48:52,061 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-11-30 04:48:52,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-11-30 04:48:52,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:52,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-11-30 04:48:52,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:52,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:52,063 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:52,064 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, 0 predicate places. [2023-11-30 04:48:52,064 INFO L500 AbstractCegarLoop]: Abstraction has has 174 places, 321 transitions, 5797 flow [2023-11-30 04:48:52,065 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:52,065 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:52,065 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:52,065 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 04:48:52,065 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-30 04:48:52,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:52,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1661820836, now seen corresponding path program 1 times [2023-11-30 04:48:52,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:52,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718370637] [2023-11-30 04:48:52,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:52,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:48:52,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:52,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718370637] [2023-11-30 04:48:52,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718370637] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:52,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:52,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 04:48:52,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984171927] [2023-11-30 04:48:52,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:52,240 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 04:48:52,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:52,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 04:48:52,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-30 04:48:52,242 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 197 [2023-11-30 04:48:52,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 321 transitions, 5797 flow. Second operand has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:52,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:52,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 197 [2023-11-30 04:48:52,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:52,594 INFO L124 PetriNetUnfolderBase]: 690/1834 cut-off events. [2023-11-30 04:48:52,595 INFO L125 PetriNetUnfolderBase]: For 17688/18482 co-relation queries the response was YES. [2023-11-30 04:48:52,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14502 conditions, 1834 events. 690/1834 cut-off events. For 17688/18482 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 13070 event pairs, 27 based on Foata normal form. 20/1460 useless extension candidates. Maximal degree in co-relation 14341. Up to 980 conditions per place. [2023-11-30 04:48:52,613 INFO L140 encePairwiseOnDemand]: 192/197 looper letters, 160 selfloop transitions, 42 changer transitions 9/318 dead transitions. [2023-11-30 04:48:52,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 318 transitions, 6141 flow [2023-11-30 04:48:52,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:48:52,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:48:52,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 484 transitions. [2023-11-30 04:48:52,614 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6142131979695431 [2023-11-30 04:48:52,614 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 484 transitions. [2023-11-30 04:48:52,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 484 transitions. [2023-11-30 04:48:52,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:52,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 484 transitions. [2023-11-30 04:48:52,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:52,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:52,617 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:52,618 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, 2 predicate places. [2023-11-30 04:48:52,618 INFO L500 AbstractCegarLoop]: Abstraction has has 176 places, 318 transitions, 6141 flow [2023-11-30 04:48:52,618 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:52,618 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:52,618 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:52,618 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 04:48:52,618 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-30 04:48:52,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:52,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1661820835, now seen corresponding path program 1 times [2023-11-30 04:48:52,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:52,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684060359] [2023-11-30 04:48:52,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:52,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:52,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:48:52,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:52,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684060359] [2023-11-30 04:48:52,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684060359] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:52,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:52,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:48:52,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970750308] [2023-11-30 04:48:52,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:52,700 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 04:48:52,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:52,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 04:48:52,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 04:48:52,701 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 197 [2023-11-30 04:48:52,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 318 transitions, 6141 flow. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:52,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:52,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 197 [2023-11-30 04:48:52,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:53,213 INFO L124 PetriNetUnfolderBase]: 722/2070 cut-off events. [2023-11-30 04:48:53,213 INFO L125 PetriNetUnfolderBase]: For 22865/23775 co-relation queries the response was YES. [2023-11-30 04:48:53,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16511 conditions, 2070 events. 722/2070 cut-off events. For 22865/23775 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 16441 event pairs, 20 based on Foata normal form. 20/1709 useless extension candidates. Maximal degree in co-relation 16339. Up to 1086 conditions per place. [2023-11-30 04:48:53,236 INFO L140 encePairwiseOnDemand]: 190/197 looper letters, 179 selfloop transitions, 44 changer transitions 25/350 dead transitions. [2023-11-30 04:48:53,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 350 transitions, 7491 flow [2023-11-30 04:48:53,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:53,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:53,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-11-30 04:48:53,239 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6175972927241963 [2023-11-30 04:48:53,239 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-11-30 04:48:53,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-11-30 04:48:53,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:53,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-11-30 04:48:53,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:53,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:53,242 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:53,243 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, 3 predicate places. [2023-11-30 04:48:53,243 INFO L500 AbstractCegarLoop]: Abstraction has has 177 places, 350 transitions, 7491 flow [2023-11-30 04:48:53,243 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:53,243 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:53,243 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:53,243 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 04:48:53,243 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-30 04:48:53,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:53,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1540706259, now seen corresponding path program 1 times [2023-11-30 04:48:53,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:53,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995575165] [2023-11-30 04:48:53,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:53,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:53,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:48:53,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:53,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995575165] [2023-11-30 04:48:53,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995575165] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:53,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:53,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-30 04:48:53,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082364493] [2023-11-30 04:48:53,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:53,530 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-30 04:48:53,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:53,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-30 04:48:53,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-11-30 04:48:53,532 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 197 [2023-11-30 04:48:53,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 350 transitions, 7491 flow. Second operand has 11 states, 11 states have (on average 103.0909090909091) internal successors, (1134), 11 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-11-30 04:48:53,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:53,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 197 [2023-11-30 04:48:53,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:54,913 INFO L124 PetriNetUnfolderBase]: 1895/4982 cut-off events. [2023-11-30 04:48:54,914 INFO L125 PetriNetUnfolderBase]: For 66807/71626 co-relation queries the response was YES. [2023-11-30 04:48:54,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38294 conditions, 4982 events. 1895/4982 cut-off events. For 66807/71626 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 45097 event pairs, 40 based on Foata normal form. 43/4335 useless extension candidates. Maximal degree in co-relation 38110. Up to 2180 conditions per place. [2023-11-30 04:48:54,999 INFO L140 encePairwiseOnDemand]: 175/197 looper letters, 467 selfloop transitions, 137 changer transitions 80/779 dead transitions. [2023-11-30 04:48:54,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 779 transitions, 21142 flow [2023-11-30 04:48:55,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-30 04:48:55,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-30 04:48:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1572 transitions. [2023-11-30 04:48:55,003 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5699782451051486 [2023-11-30 04:48:55,003 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1572 transitions. [2023-11-30 04:48:55,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1572 transitions. [2023-11-30 04:48:55,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:55,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1572 transitions. [2023-11-30 04:48:55,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 112.28571428571429) internal successors, (1572), 14 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:55,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 197.0) internal successors, (2955), 15 states have internal predecessors, (2955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:55,010 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 197.0) internal successors, (2955), 15 states have internal predecessors, (2955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:55,011 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, 16 predicate places. [2023-11-30 04:48:55,011 INFO L500 AbstractCegarLoop]: Abstraction has has 190 places, 779 transitions, 21142 flow [2023-11-30 04:48:55,011 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 103.0909090909091) internal successors, (1134), 11 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-11-30 04:48:55,011 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:55,011 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:55,011 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 04:48:55,012 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-30 04:48:55,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:55,012 INFO L85 PathProgramCache]: Analyzing trace with hash -990346146, now seen corresponding path program 1 times [2023-11-30 04:48:55,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:55,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757918854] [2023-11-30 04:48:55,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:55,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:55,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:48:55,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:55,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757918854] [2023-11-30 04:48:55,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757918854] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:55,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:55,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-30 04:48:55,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311612112] [2023-11-30 04:48:55,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:55,260 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-30 04:48:55,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:55,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-30 04:48:55,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-30 04:48:55,261 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 197 [2023-11-30 04:48:55,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 779 transitions, 21142 flow. Second operand has 9 states, 9 states have (on average 105.44444444444444) internal successors, (949), 9 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:55,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:55,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 197 [2023-11-30 04:48:55,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:56,604 INFO L124 PetriNetUnfolderBase]: 1729/4596 cut-off events. [2023-11-30 04:48:56,605 INFO L125 PetriNetUnfolderBase]: For 69330/74550 co-relation queries the response was YES. [2023-11-30 04:48:56,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37001 conditions, 4596 events. 1729/4596 cut-off events. For 69330/74550 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 40458 event pairs, 42 based on Foata normal form. 14/4034 useless extension candidates. Maximal degree in co-relation 36806. Up to 1955 conditions per place. [2023-11-30 04:48:56,655 INFO L140 encePairwiseOnDemand]: 180/197 looper letters, 522 selfloop transitions, 74 changer transitions 95/794 dead transitions. [2023-11-30 04:48:56,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 794 transitions, 23004 flow [2023-11-30 04:48:56,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-30 04:48:56,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-30 04:48:56,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 894 transitions. [2023-11-30 04:48:56,657 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.567258883248731 [2023-11-30 04:48:56,657 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 894 transitions. [2023-11-30 04:48:56,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 894 transitions. [2023-11-30 04:48:56,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:56,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 894 transitions. [2023-11-30 04:48:56,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.75) internal successors, (894), 8 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:56,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 197.0) internal successors, (1773), 9 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:56,661 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 197.0) internal successors, (1773), 9 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:56,661 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, 23 predicate places. [2023-11-30 04:48:56,661 INFO L500 AbstractCegarLoop]: Abstraction has has 197 places, 794 transitions, 23004 flow [2023-11-30 04:48:56,662 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 105.44444444444444) internal successors, (949), 9 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:56,662 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:56,662 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:56,662 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 04:48:56,662 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-30 04:48:56,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:56,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1150785868, now seen corresponding path program 1 times [2023-11-30 04:48:56,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:56,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979513095] [2023-11-30 04:48:56,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:56,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:48:57,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:57,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979513095] [2023-11-30 04:48:57,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979513095] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:57,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:57,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-30 04:48:57,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675892082] [2023-11-30 04:48:57,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:57,134 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-30 04:48:57,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:57,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-30 04:48:57,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-30 04:48:57,135 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 197 [2023-11-30 04:48:57,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 794 transitions, 23004 flow. Second operand has 11 states, 11 states have (on average 103.18181818181819) internal successors, (1135), 11 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:57,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:57,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 197 [2023-11-30 04:48:57,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:57,946 INFO L124 PetriNetUnfolderBase]: 1231/3390 cut-off events. [2023-11-30 04:48:57,946 INFO L125 PetriNetUnfolderBase]: For 63226/69850 co-relation queries the response was YES. [2023-11-30 04:48:57,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28042 conditions, 3390 events. 1231/3390 cut-off events. For 63226/69850 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 27632 event pairs, 14 based on Foata normal form. 14/3191 useless extension candidates. Maximal degree in co-relation 27836. Up to 1248 conditions per place. [2023-11-30 04:48:57,967 INFO L140 encePairwiseOnDemand]: 184/197 looper letters, 0 selfloop transitions, 0 changer transitions 726/726 dead transitions. [2023-11-30 04:48:57,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 726 transitions, 21940 flow [2023-11-30 04:48:57,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 04:48:57,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 04:48:57,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 970 transitions. [2023-11-30 04:48:57,970 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5470953186689227 [2023-11-30 04:48:57,970 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 970 transitions. [2023-11-30 04:48:57,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 970 transitions. [2023-11-30 04:48:57,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:57,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 970 transitions. [2023-11-30 04:48:57,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 107.77777777777777) internal successors, (970), 9 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:57,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 197.0) internal successors, (1970), 10 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:57,975 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 197.0) internal successors, (1970), 10 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:57,976 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, 26 predicate places. [2023-11-30 04:48:57,976 INFO L500 AbstractCegarLoop]: Abstraction has has 200 places, 726 transitions, 21940 flow [2023-11-30 04:48:57,976 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 103.18181818181819) internal successors, (1135), 11 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:57,991 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe012_power.opt.i_BEv2_AllErrorsAtOnce [2023-11-30 04:48:58,027 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 63 remaining) [2023-11-30 04:48:58,028 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 63 remaining) [2023-11-30 04:48:58,028 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 63 remaining) [2023-11-30 04:48:58,028 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 63 remaining) [2023-11-30 04:48:58,028 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 63 remaining) [2023-11-30 04:48:58,028 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 63 remaining) [2023-11-30 04:48:58,028 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 63 remaining) [2023-11-30 04:48:58,028 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 63 remaining) [2023-11-30 04:48:58,029 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 63 remaining) [2023-11-30 04:48:58,029 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 63 remaining) [2023-11-30 04:48:58,029 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 63 remaining) [2023-11-30 04:48:58,029 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 63 remaining) [2023-11-30 04:48:58,029 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 63 remaining) [2023-11-30 04:48:58,029 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 63 remaining) [2023-11-30 04:48:58,029 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 63 remaining) [2023-11-30 04:48:58,029 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 63 remaining) [2023-11-30 04:48:58,029 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 63 remaining) [2023-11-30 04:48:58,029 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 63 remaining) [2023-11-30 04:48:58,029 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 63 remaining) [2023-11-30 04:48:58,029 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 63 remaining) [2023-11-30 04:48:58,029 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 63 remaining) [2023-11-30 04:48:58,030 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 63 remaining) [2023-11-30 04:48:58,030 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 63 remaining) [2023-11-30 04:48:58,030 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 63 remaining) [2023-11-30 04:48:58,030 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 63 remaining) [2023-11-30 04:48:58,030 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 63 remaining) [2023-11-30 04:48:58,030 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 63 remaining) [2023-11-30 04:48:58,030 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 63 remaining) [2023-11-30 04:48:58,030 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 63 remaining) [2023-11-30 04:48:58,030 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 63 remaining) [2023-11-30 04:48:58,030 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 63 remaining) [2023-11-30 04:48:58,030 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 63 remaining) [2023-11-30 04:48:58,030 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 63 remaining) [2023-11-30 04:48:58,030 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 63 remaining) [2023-11-30 04:48:58,031 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 63 remaining) [2023-11-30 04:48:58,031 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 63 remaining) [2023-11-30 04:48:58,031 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 63 remaining) [2023-11-30 04:48:58,031 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 63 remaining) [2023-11-30 04:48:58,031 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 63 remaining) [2023-11-30 04:48:58,031 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 63 remaining) [2023-11-30 04:48:58,031 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 63 remaining) [2023-11-30 04:48:58,031 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 63 remaining) [2023-11-30 04:48:58,031 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 63 remaining) [2023-11-30 04:48:58,031 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 63 remaining) [2023-11-30 04:48:58,031 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 63 remaining) [2023-11-30 04:48:58,032 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 63 remaining) [2023-11-30 04:48:58,032 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 63 remaining) [2023-11-30 04:48:58,032 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 63 remaining) [2023-11-30 04:48:58,032 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 63 remaining) [2023-11-30 04:48:58,032 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 63 remaining) [2023-11-30 04:48:58,032 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 63 remaining) [2023-11-30 04:48:58,032 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 63 remaining) [2023-11-30 04:48:58,032 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 63 remaining) [2023-11-30 04:48:58,032 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 63 remaining) [2023-11-30 04:48:58,032 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 63 remaining) [2023-11-30 04:48:58,032 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 63 remaining) [2023-11-30 04:48:58,032 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 63 remaining) [2023-11-30 04:48:58,032 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 63 remaining) [2023-11-30 04:48:58,033 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 63 remaining) [2023-11-30 04:48:58,033 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 63 remaining) [2023-11-30 04:48:58,033 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 63 remaining) [2023-11-30 04:48:58,033 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 63 remaining) [2023-11-30 04:48:58,033 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 63 remaining) [2023-11-30 04:48:58,033 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 04:48:58,033 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:58,038 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:48:58,038 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:48:58,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:48:58 BasicIcfg [2023-11-30 04:48:58,043 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:48:58,043 INFO L158 Benchmark]: Toolchain (without parser) took 16037.46ms. Allocated memory was 354.4MB in the beginning and 3.0GB in the end (delta: 2.6GB). Free memory was 303.1MB in the beginning and 2.2GB in the end (delta: -1.9GB). Peak memory consumption was 730.0MB. Max. memory is 16.0GB. [2023-11-30 04:48:58,044 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 354.4MB. Free memory is still 309.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:48:58,044 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.98ms. Allocated memory is still 354.4MB. Free memory was 303.1MB in the beginning and 278.8MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-11-30 04:48:58,044 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.29ms. Allocated memory is still 354.4MB. Free memory was 278.8MB in the beginning and 276.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:48:58,044 INFO L158 Benchmark]: Boogie Preprocessor took 24.69ms. Allocated memory is still 354.4MB. Free memory was 275.9MB in the beginning and 273.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:48:58,044 INFO L158 Benchmark]: RCFGBuilder took 1035.01ms. Allocated memory was 354.4MB in the beginning and 501.2MB in the end (delta: 146.8MB). Free memory was 273.8MB in the beginning and 357.7MB in the end (delta: -83.9MB). Peak memory consumption was 66.5MB. Max. memory is 16.0GB. [2023-11-30 04:48:58,044 INFO L158 Benchmark]: TraceAbstraction took 14557.63ms. Allocated memory was 501.2MB in the beginning and 3.0GB in the end (delta: 2.5GB). Free memory was 356.6MB in the beginning and 2.2GB in the end (delta: -1.8GB). Peak memory consumption was 638.4MB. Max. memory is 16.0GB. [2023-11-30 04:48:58,045 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.11ms. Allocated memory is still 354.4MB. Free memory is still 309.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 380.98ms. Allocated memory is still 354.4MB. Free memory was 303.1MB in the beginning and 278.8MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 34.29ms. Allocated memory is still 354.4MB. Free memory was 278.8MB in the beginning and 276.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 24.69ms. Allocated memory is still 354.4MB. Free memory was 275.9MB in the beginning and 273.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1035.01ms. Allocated memory was 354.4MB in the beginning and 501.2MB in the end (delta: 146.8MB). Free memory was 273.8MB in the beginning and 357.7MB in the end (delta: -83.9MB). Peak memory consumption was 66.5MB. Max. memory is 16.0GB. * TraceAbstraction took 14557.63ms. Allocated memory was 501.2MB in the beginning and 3.0GB in the end (delta: 2.5GB). Free memory was 356.6MB in the beginning and 2.2GB in the end (delta: -1.8GB). Peak memory consumption was 638.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 219 locations, 63 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: 14.4s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 843 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 843 mSDsluCounter, 231 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 81 mSDsCounter, 234 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1474 IncrementalHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 234 mSolverCounterUnsat, 150 mSDtfsCounter, 1474 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23004occurred in iteration=16, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1320 NumberOfCodeBlocks, 1320 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1303 ConstructedInterpolants, 0 QuantifiedInterpolants, 5542 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 36 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 04:48:58,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...