/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/safe028_power.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:51:41,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:51:41,739 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:51:41,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:51:41,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:51:41,760 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:51:41,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:51:41,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:51:41,761 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:51:41,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:51:41,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:51:41,761 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:51:41,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:51:41,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:51:41,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:51:41,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:51:41,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:51:41,762 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:51:41,763 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:51:41,763 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:51:41,763 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:51:41,766 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:51:41,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:51:41,766 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:51:41,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:51:41,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:51:41,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:51:41,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:51:41,767 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:51:41,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:51:41,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:51:41,768 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:51:41,768 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:51:41,768 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:51:41,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:51:41,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:51:41,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:51:41,967 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:51:41,968 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:51:41,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe028_power.i [2023-11-30 04:51:42,912 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:51:43,098 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:51:43,108 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe028_power.i [2023-11-30 04:51:43,122 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fe83f7fd/ebb0e0e22c2f4571a5c96c35434996e7/FLAG0cc384abe [2023-11-30 04:51:43,132 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fe83f7fd/ebb0e0e22c2f4571a5c96c35434996e7 [2023-11-30 04:51:43,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:51:43,134 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:51:43,135 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:51:43,135 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:51:43,138 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:51:43,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:51:43" (1/1) ... [2023-11-30 04:51:43,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e420292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:43, skipping insertion in model container [2023-11-30 04:51:43,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:51:43" (1/1) ... [2023-11-30 04:51:43,172 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:51:43,446 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:51:43,456 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:51:43,519 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:51:43,545 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:51:43,545 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:51:43,550 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:51:43,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:43 WrapperNode [2023-11-30 04:51:43,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:51:43,552 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:51:43,552 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:51:43,553 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:51:43,557 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:51:43" (1/1) ... [2023-11-30 04:51:43,584 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:51:43" (1/1) ... [2023-11-30 04:51:43,611 INFO L138 Inliner]: procedures = 176, calls = 78, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 183 [2023-11-30 04:51:43,612 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:51:43,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:51:43,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:51:43,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:51:43,622 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:43" (1/1) ... [2023-11-30 04:51:43,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:43" (1/1) ... [2023-11-30 04:51:43,634 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:43" (1/1) ... [2023-11-30 04:51:43,635 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:43" (1/1) ... [2023-11-30 04:51:43,644 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:43" (1/1) ... [2023-11-30 04:51:43,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:43" (1/1) ... [2023-11-30 04:51:43,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:43" (1/1) ... [2023-11-30 04:51:43,650 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:43" (1/1) ... [2023-11-30 04:51:43,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:51:43,668 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:51:43,668 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:51:43,668 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:51:43,670 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:43" (1/1) ... [2023-11-30 04:51:43,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:51:43,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:51:43,690 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:51:43,709 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:51:43,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 04:51:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:51:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:51:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:51:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:51:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:51:43,715 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-30 04:51:43,715 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-30 04:51:43,715 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-30 04:51:43,715 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-30 04:51:43,715 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-30 04:51:43,715 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-30 04:51:43,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:51:43,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:51:43,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:51:43,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:51:43,717 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:51:43,847 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:51:43,849 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:51:44,202 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:51:44,580 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:51:44,580 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:51:44,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:51:44 BoogieIcfgContainer [2023-11-30 04:51:44,581 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:51:44,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:51:44,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:51:44,585 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:51:44,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:51:43" (1/3) ... [2023-11-30 04:51:44,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b790c89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:51:44, skipping insertion in model container [2023-11-30 04:51:44,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:43" (2/3) ... [2023-11-30 04:51:44,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b790c89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:51:44, skipping insertion in model container [2023-11-30 04:51:44,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:51:44" (3/3) ... [2023-11-30 04:51:44,587 INFO L112 eAbstractionObserver]: Analyzing ICFG safe028_power.i [2023-11-30 04:51:44,601 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:51:44,601 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2023-11-30 04:51:44,601 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:51:44,707 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:51:44,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 188 places, 181 transitions, 374 flow [2023-11-30 04:51:44,817 INFO L124 PetriNetUnfolderBase]: 3/178 cut-off events. [2023-11-30 04:51:44,818 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:51:44,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 178 events. 3/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 289 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 122. Up to 2 conditions per place. [2023-11-30 04:51:44,824 INFO L82 GeneralOperation]: Start removeDead. Operand has 188 places, 181 transitions, 374 flow [2023-11-30 04:51:44,833 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 185 places, 178 transitions, 365 flow [2023-11-30 04:51:44,841 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:51:44,846 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;@77b972aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:51:44,846 INFO L363 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2023-11-30 04:51:44,856 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:51:44,856 INFO L124 PetriNetUnfolderBase]: 0/57 cut-off events. [2023-11-30 04:51:44,856 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:51:44,856 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:51:44,857 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:51:44,857 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:51:44,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:51:44,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1468573129, now seen corresponding path program 1 times [2023-11-30 04:51:44,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:51:44,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836807781] [2023-11-30 04:51:44,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:51:44,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:51:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:51:45,202 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:51:45,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:51:45,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836807781] [2023-11-30 04:51:45,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836807781] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:51:45,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:51:45,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:51:45,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712888697] [2023-11-30 04:51:45,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:51:45,210 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:51:45,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:51:45,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:51:45,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:51:45,253 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 181 [2023-11-30 04:51:45,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 178 transitions, 365 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 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:51:45,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:51:45,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 181 [2023-11-30 04:51:45,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:51:47,683 INFO L124 PetriNetUnfolderBase]: 8747/17062 cut-off events. [2023-11-30 04:51:47,683 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-30 04:51:47,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29544 conditions, 17062 events. 8747/17062 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 1455. Compared 165679 event pairs, 5602 based on Foata normal form. 532/9281 useless extension candidates. Maximal degree in co-relation 29469. Up to 8001 conditions per place. [2023-11-30 04:51:47,798 INFO L140 encePairwiseOnDemand]: 151/181 looper letters, 62 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2023-11-30 04:51:47,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 164 transitions, 465 flow [2023-11-30 04:51:47,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:51:47,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:51:47,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2023-11-30 04:51:47,807 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7937384898710865 [2023-11-30 04:51:47,808 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2023-11-30 04:51:47,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2023-11-30 04:51:47,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:51:47,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2023-11-30 04:51:47,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 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:51:47,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 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:51:47,817 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 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:51:47,819 INFO L307 CegarLoopForPetriNet]: 185 programPoint places, -26 predicate places. [2023-11-30 04:51:47,820 INFO L500 AbstractCegarLoop]: Abstraction has has 159 places, 164 transitions, 465 flow [2023-11-30 04:51:47,820 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 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:51:47,820 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:51:47,820 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:51:47,820 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:51:47,820 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:51:47,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:51:47,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1468573128, now seen corresponding path program 1 times [2023-11-30 04:51:47,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:51:47,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714013815] [2023-11-30 04:51:47,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:51:47,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:51:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:51:47,962 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:51:47,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:51:47,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714013815] [2023-11-30 04:51:47,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714013815] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:51:47,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:51:47,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:51:47,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270470203] [2023-11-30 04:51:47,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:51:47,965 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:51:47,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:51:47,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:51:47,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:51:47,967 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 181 [2023-11-30 04:51:47,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 164 transitions, 465 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 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:51:47,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:51:47,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 181 [2023-11-30 04:51:47,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:51:50,004 INFO L124 PetriNetUnfolderBase]: 8795/17145 cut-off events. [2023-11-30 04:51:50,004 INFO L125 PetriNetUnfolderBase]: For 1397/3421 co-relation queries the response was YES. [2023-11-30 04:51:50,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41628 conditions, 17145 events. 8795/17145 cut-off events. For 1397/3421 co-relation queries the response was YES. Maximal size of possible extension queue 1455. Compared 166613 event pairs, 5650 based on Foata normal form. 0/8825 useless extension candidates. Maximal degree in co-relation 41547. Up to 8929 conditions per place. [2023-11-30 04:51:50,102 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 75 selfloop transitions, 2 changer transitions 0/180 dead transitions. [2023-11-30 04:51:50,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 180 transitions, 683 flow [2023-11-30 04:51:50,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:51:50,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:51:50,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2023-11-30 04:51:50,103 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7090239410681399 [2023-11-30 04:51:50,103 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2023-11-30 04:51:50,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2023-11-30 04:51:50,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:51:50,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2023-11-30 04:51:50,105 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:51:50,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 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:51:50,106 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 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:51:50,107 INFO L307 CegarLoopForPetriNet]: 185 programPoint places, -25 predicate places. [2023-11-30 04:51:50,107 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 180 transitions, 683 flow [2023-11-30 04:51:50,107 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 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:51:50,107 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:51:50,107 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] [2023-11-30 04:51:50,107 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:51:50,107 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:51:50,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:51:50,108 INFO L85 PathProgramCache]: Analyzing trace with hash 882155536, now seen corresponding path program 1 times [2023-11-30 04:51:50,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:51:50,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942083432] [2023-11-30 04:51:50,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:51:50,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:51:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:51:50,261 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:51:50,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:51:50,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942083432] [2023-11-30 04:51:50,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942083432] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:51:50,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:51:50,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:51:50,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822651644] [2023-11-30 04:51:50,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:51:50,266 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:51:50,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:51:50,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:51:50,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:51:50,269 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 181 [2023-11-30 04:51:50,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 180 transitions, 683 flow. Second operand has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 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:51:50,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:51:50,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 181 [2023-11-30 04:51:50,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:51:52,270 INFO L124 PetriNetUnfolderBase]: 5571/12118 cut-off events. [2023-11-30 04:51:52,271 INFO L125 PetriNetUnfolderBase]: For 2826/4064 co-relation queries the response was YES. [2023-11-30 04:51:52,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36386 conditions, 12118 events. 5571/12118 cut-off events. For 2826/4064 co-relation queries the response was YES. Maximal size of possible extension queue 935. Compared 119064 event pairs, 1537 based on Foata normal form. 0/7833 useless extension candidates. Maximal degree in co-relation 36294. Up to 6167 conditions per place. [2023-11-30 04:51:52,349 INFO L140 encePairwiseOnDemand]: 163/181 looper letters, 85 selfloop transitions, 15 changer transitions 0/198 dead transitions. [2023-11-30 04:51:52,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 198 transitions, 987 flow [2023-11-30 04:51:52,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 04:51:52,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 04:51:52,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 841 transitions. [2023-11-30 04:51:52,352 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6637726913970008 [2023-11-30 04:51:52,352 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 841 transitions. [2023-11-30 04:51:52,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 841 transitions. [2023-11-30 04:51:52,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:51:52,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 841 transitions. [2023-11-30 04:51:52,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.14285714285714) internal successors, (841), 7 states have internal predecessors, (841), 0 states have call successors, (0), 0 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:51:52,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 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:51:52,356 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 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:51:52,356 INFO L307 CegarLoopForPetriNet]: 185 programPoint places, -21 predicate places. [2023-11-30 04:51:52,356 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 198 transitions, 987 flow [2023-11-30 04:51:52,357 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 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:51:52,357 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:51:52,357 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] [2023-11-30 04:51:52,357 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:51:52,357 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:51:52,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:51:52,357 INFO L85 PathProgramCache]: Analyzing trace with hash 882155537, now seen corresponding path program 1 times [2023-11-30 04:51:52,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:51:52,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450922860] [2023-11-30 04:51:52,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:51:52,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:51:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:51:52,438 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:51:52,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:51:52,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450922860] [2023-11-30 04:51:52,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450922860] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:51:52,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:51:52,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 04:51:52,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357074955] [2023-11-30 04:51:52,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:51:52,439 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 04:51:52,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:51:52,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 04:51:52,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-30 04:51:52,440 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 181 [2023-11-30 04:51:52,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 198 transitions, 987 flow. Second operand has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 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:51:52,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:51:52,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 181 [2023-11-30 04:51:52,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:51:53,017 INFO L124 PetriNetUnfolderBase]: 1373/3807 cut-off events. [2023-11-30 04:51:53,018 INFO L125 PetriNetUnfolderBase]: For 2146/2454 co-relation queries the response was YES. [2023-11-30 04:51:53,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11896 conditions, 3807 events. 1373/3807 cut-off events. For 2146/2454 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 34355 event pairs, 227 based on Foata normal form. 0/3171 useless extension candidates. Maximal degree in co-relation 11795. Up to 1931 conditions per place. [2023-11-30 04:51:53,036 INFO L140 encePairwiseOnDemand]: 171/181 looper letters, 55 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2023-11-30 04:51:53,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 166 transitions, 845 flow [2023-11-30 04:51:53,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:51:53,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:51:53,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2023-11-30 04:51:53,038 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6671270718232044 [2023-11-30 04:51:53,038 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2023-11-30 04:51:53,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2023-11-30 04:51:53,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:51:53,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2023-11-30 04:51:53,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 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:51:53,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:53,041 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:53,041 INFO L307 CegarLoopForPetriNet]: 185 programPoint places, -26 predicate places. [2023-11-30 04:51:53,041 INFO L500 AbstractCegarLoop]: Abstraction has has 159 places, 166 transitions, 845 flow [2023-11-30 04:51:53,042 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 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:51:53,042 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:51:53,042 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:51:53,042 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:51:53,042 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:51:53,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:51:53,042 INFO L85 PathProgramCache]: Analyzing trace with hash -24780812, now seen corresponding path program 1 times [2023-11-30 04:51:53,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:51:53,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381937039] [2023-11-30 04:51:53,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:51:53,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:51:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:51:53,088 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:51:53,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:51:53,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381937039] [2023-11-30 04:51:53,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381937039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:51:53,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:51:53,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:51:53,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009791449] [2023-11-30 04:51:53,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:51:53,089 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:51:53,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:51:53,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:51:53,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:51:53,090 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 181 [2023-11-30 04:51:53,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 166 transitions, 845 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:53,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:51:53,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 181 [2023-11-30 04:51:53,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:51:53,612 INFO L124 PetriNetUnfolderBase]: 1635/4125 cut-off events. [2023-11-30 04:51:53,612 INFO L125 PetriNetUnfolderBase]: For 5199/5641 co-relation queries the response was YES. [2023-11-30 04:51:53,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15596 conditions, 4125 events. 1635/4125 cut-off events. For 5199/5641 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 36326 event pairs, 163 based on Foata normal form. 2/3380 useless extension candidates. Maximal degree in co-relation 15487. Up to 2194 conditions per place. [2023-11-30 04:51:53,641 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 76 selfloop transitions, 2 changer transitions 0/182 dead transitions. [2023-11-30 04:51:53,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 182 transitions, 1165 flow [2023-11-30 04:51:53,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:51:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:51:53,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-11-30 04:51:53,642 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6795580110497238 [2023-11-30 04:51:53,643 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-11-30 04:51:53,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-11-30 04:51:53,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:51:53,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-11-30 04:51:53,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 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:51:53,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 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:51:53,645 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 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:51:53,645 INFO L307 CegarLoopForPetriNet]: 185 programPoint places, -25 predicate places. [2023-11-30 04:51:53,645 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 182 transitions, 1165 flow [2023-11-30 04:51:53,645 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:53,646 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:51:53,646 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:51:53,646 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:51:53,646 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:51:53,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:51:53,646 INFO L85 PathProgramCache]: Analyzing trace with hash -24780813, now seen corresponding path program 1 times [2023-11-30 04:51:53,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:51:53,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658879645] [2023-11-30 04:51:53,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:51:53,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:51:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:51:53,676 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:51:53,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:51:53,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658879645] [2023-11-30 04:51:53,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658879645] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:51:53,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:51:53,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:51:53,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455677188] [2023-11-30 04:51:53,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:51:53,678 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:51:53,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:51:53,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:51:53,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:51:53,678 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 181 [2023-11-30 04:51:53,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 182 transitions, 1165 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:53,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:51:53,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 181 [2023-11-30 04:51:53,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:51:54,316 INFO L124 PetriNetUnfolderBase]: 1634/4122 cut-off events. [2023-11-30 04:51:54,317 INFO L125 PetriNetUnfolderBase]: For 6893/7559 co-relation queries the response was YES. [2023-11-30 04:51:54,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18084 conditions, 4122 events. 1634/4122 cut-off events. For 6893/7559 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 36331 event pairs, 163 based on Foata normal form. 2/3377 useless extension candidates. Maximal degree in co-relation 17966. Up to 2198 conditions per place. [2023-11-30 04:51:54,344 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 79 selfloop transitions, 2 changer transitions 0/181 dead transitions. [2023-11-30 04:51:54,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 181 transitions, 1319 flow [2023-11-30 04:51:54,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:51:54,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:51:54,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-11-30 04:51:54,345 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6556169429097606 [2023-11-30 04:51:54,345 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-11-30 04:51:54,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-11-30 04:51:54,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:51:54,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-11-30 04:51:54,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 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:51:54,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 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:51:54,347 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 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:51:54,348 INFO L307 CegarLoopForPetriNet]: 185 programPoint places, -24 predicate places. [2023-11-30 04:51:54,348 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 181 transitions, 1319 flow [2023-11-30 04:51:54,348 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:54,348 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:51:54,348 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:51:54,348 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:51:54,348 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:51:54,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:51:54,349 INFO L85 PathProgramCache]: Analyzing trace with hash 344833103, now seen corresponding path program 1 times [2023-11-30 04:51:54,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:51:54,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393015208] [2023-11-30 04:51:54,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:51:54,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:51:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:51:54,401 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:51:54,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:51:54,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393015208] [2023-11-30 04:51:54,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393015208] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:51:54,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:51:54,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:51:54,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918993477] [2023-11-30 04:51:54,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:51:54,402 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:51:54,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:51:54,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:51:54,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:51:54,403 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 181 [2023-11-30 04:51:54,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 181 transitions, 1319 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:51:54,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:51:54,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 181 [2023-11-30 04:51:54,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:51:55,125 INFO L124 PetriNetUnfolderBase]: 1890/4370 cut-off events. [2023-11-30 04:51:55,125 INFO L125 PetriNetUnfolderBase]: For 13319/13535 co-relation queries the response was YES. [2023-11-30 04:51:55,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22441 conditions, 4370 events. 1890/4370 cut-off events. For 13319/13535 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 37788 event pairs, 87 based on Foata normal form. 6/3527 useless extension candidates. Maximal degree in co-relation 22315. Up to 2461 conditions per place. [2023-11-30 04:51:55,156 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 94 selfloop transitions, 2 changer transitions 0/199 dead transitions. [2023-11-30 04:51:55,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 199 transitions, 1769 flow [2023-11-30 04:51:55,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:51:55,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:51:55,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-11-30 04:51:55,170 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6777163904235728 [2023-11-30 04:51:55,171 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-11-30 04:51:55,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-11-30 04:51:55,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:51:55,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-11-30 04:51:55,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 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:51:55,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 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:51:55,173 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 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:51:55,173 INFO L307 CegarLoopForPetriNet]: 185 programPoint places, -23 predicate places. [2023-11-30 04:51:55,173 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 199 transitions, 1769 flow [2023-11-30 04:51:55,174 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:51:55,174 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:51:55,178 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:51:55,178 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:51:55,178 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:51:55,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:51:55,178 INFO L85 PathProgramCache]: Analyzing trace with hash 344833102, now seen corresponding path program 1 times [2023-11-30 04:51:55,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:51:55,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99862985] [2023-11-30 04:51:55,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:51:55,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:51:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:51:55,221 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:51:55,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:51:55,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99862985] [2023-11-30 04:51:55,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99862985] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:51:55,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:51:55,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:51:55,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558195711] [2023-11-30 04:51:55,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:51:55,222 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:51:55,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:51:55,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:51:55,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:51:55,224 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 181 [2023-11-30 04:51:55,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 199 transitions, 1769 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:51:55,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:51:55,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 181 [2023-11-30 04:51:55,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:51:56,045 INFO L124 PetriNetUnfolderBase]: 1883/4357 cut-off events. [2023-11-30 04:51:56,045 INFO L125 PetriNetUnfolderBase]: For 17045/17297 co-relation queries the response was YES. [2023-11-30 04:51:56,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25100 conditions, 4357 events. 1883/4357 cut-off events. For 17045/17297 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 37726 event pairs, 87 based on Foata normal form. 6/3514 useless extension candidates. Maximal degree in co-relation 24965. Up to 2476 conditions per place. [2023-11-30 04:51:56,081 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 97 selfloop transitions, 2 changer transitions 0/198 dead transitions. [2023-11-30 04:51:56,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 198 transitions, 1957 flow [2023-11-30 04:51:56,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:51:56,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:51:56,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-11-30 04:51:56,083 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6537753222836096 [2023-11-30 04:51:56,083 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-11-30 04:51:56,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-11-30 04:51:56,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:51:56,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-11-30 04:51:56,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 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:51:56,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 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:51:56,085 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 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:51:56,086 INFO L307 CegarLoopForPetriNet]: 185 programPoint places, -22 predicate places. [2023-11-30 04:51:56,086 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 198 transitions, 1957 flow [2023-11-30 04:51:56,086 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:51:56,086 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:51:56,086 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:51:56,086 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:51:56,087 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:51:56,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:51:56,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1084904571, now seen corresponding path program 1 times [2023-11-30 04:51:56,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:51:56,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311834196] [2023-11-30 04:51:56,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:51:56,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:51:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:51:56,174 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:51:56,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:51:56,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311834196] [2023-11-30 04:51:56,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311834196] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:51:56,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:51:56,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:51:56,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372668098] [2023-11-30 04:51:56,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:51:56,176 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:51:56,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:51:56,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:51:56,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:51:56,177 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 181 [2023-11-30 04:51:56,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 198 transitions, 1957 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 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:51:56,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:51:56,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 181 [2023-11-30 04:51:56,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:51:56,937 INFO L124 PetriNetUnfolderBase]: 1857/4325 cut-off events. [2023-11-30 04:51:56,937 INFO L125 PetriNetUnfolderBase]: For 21488/21776 co-relation queries the response was YES. [2023-11-30 04:51:56,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26839 conditions, 4325 events. 1857/4325 cut-off events. For 21488/21776 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 37665 event pairs, 63 based on Foata normal form. 0/3494 useless extension candidates. Maximal degree in co-relation 26701. Up to 2476 conditions per place. [2023-11-30 04:51:56,975 INFO L140 encePairwiseOnDemand]: 177/181 looper letters, 112 selfloop transitions, 10 changer transitions 0/239 dead transitions. [2023-11-30 04:51:56,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 239 transitions, 2939 flow [2023-11-30 04:51:56,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:51:56,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:51:56,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2023-11-30 04:51:56,978 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7384898710865562 [2023-11-30 04:51:56,978 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2023-11-30 04:51:56,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2023-11-30 04:51:56,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:51:56,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2023-11-30 04:51:56,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:56,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 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:51:56,980 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 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:51:56,980 INFO L307 CegarLoopForPetriNet]: 185 programPoint places, -20 predicate places. [2023-11-30 04:51:56,980 INFO L500 AbstractCegarLoop]: Abstraction has has 165 places, 239 transitions, 2939 flow [2023-11-30 04:51:56,980 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 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:51:56,980 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:51:56,981 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:51:56,981 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 04:51:56,981 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:51:56,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:51:56,981 INFO L85 PathProgramCache]: Analyzing trace with hash -250485740, now seen corresponding path program 1 times [2023-11-30 04:51:56,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:51:56,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251651774] [2023-11-30 04:51:56,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:51:56,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:51:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:51:57,146 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:51:57,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:51:57,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251651774] [2023-11-30 04:51:57,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251651774] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:51:57,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:51:57,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:51:57,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728427069] [2023-11-30 04:51:57,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:51:57,150 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 04:51:57,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:51:57,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 04:51:57,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 04:51:57,151 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 181 [2023-11-30 04:51:57,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 239 transitions, 2939 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 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:51:57,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:51:57,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 181 [2023-11-30 04:51:57,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:51:58,133 INFO L124 PetriNetUnfolderBase]: 1962/4902 cut-off events. [2023-11-30 04:51:58,133 INFO L125 PetriNetUnfolderBase]: For 29248/29572 co-relation queries the response was YES. [2023-11-30 04:51:58,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31551 conditions, 4902 events. 1962/4902 cut-off events. For 29248/29572 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 46560 event pairs, 57 based on Foata normal form. 12/4095 useless extension candidates. Maximal degree in co-relation 31402. Up to 2711 conditions per place. [2023-11-30 04:51:58,176 INFO L140 encePairwiseOnDemand]: 176/181 looper letters, 145 selfloop transitions, 12 changer transitions 0/257 dead transitions. [2023-11-30 04:51:58,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 257 transitions, 3589 flow [2023-11-30 04:51:58,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:51:58,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:51:58,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-11-30 04:51:58,178 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6648250460405156 [2023-11-30 04:51:58,178 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-11-30 04:51:58,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-11-30 04:51:58,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:51:58,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-11-30 04:51:58,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 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:51:58,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 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:51:58,180 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 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:51:58,180 INFO L307 CegarLoopForPetriNet]: 185 programPoint places, -19 predicate places. [2023-11-30 04:51:58,181 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 257 transitions, 3589 flow [2023-11-30 04:51:58,181 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 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:51:58,181 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:51:58,181 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:51:58,181 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 04:51:58,181 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:51:58,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:51:58,182 INFO L85 PathProgramCache]: Analyzing trace with hash -250485739, now seen corresponding path program 1 times [2023-11-30 04:51:58,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:51:58,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591424140] [2023-11-30 04:51:58,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:51:58,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:51:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:51:58,394 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:51:58,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:51:58,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591424140] [2023-11-30 04:51:58,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591424140] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:51:58,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:51:58,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 04:51:58,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147308816] [2023-11-30 04:51:58,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:51:58,395 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 04:51:58,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:51:58,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 04:51:58,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-30 04:51:58,396 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 181 [2023-11-30 04:51:58,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 257 transitions, 3589 flow. Second operand has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 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:51:58,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:51:58,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 181 [2023-11-30 04:51:58,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:51:59,175 INFO L124 PetriNetUnfolderBase]: 1942/4780 cut-off events. [2023-11-30 04:51:59,176 INFO L125 PetriNetUnfolderBase]: For 36651/37167 co-relation queries the response was YES. [2023-11-30 04:51:59,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33290 conditions, 4780 events. 1942/4780 cut-off events. For 36651/37167 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 45134 event pairs, 39 based on Foata normal form. 12/3991 useless extension candidates. Maximal degree in co-relation 33131. Up to 2711 conditions per place. [2023-11-30 04:51:59,209 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 137 selfloop transitions, 10 changer transitions 0/256 dead transitions. [2023-11-30 04:51:59,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 256 transitions, 3861 flow [2023-11-30 04:51:59,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:51:59,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:51:59,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 477 transitions. [2023-11-30 04:51:59,212 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6588397790055248 [2023-11-30 04:51:59,212 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 477 transitions. [2023-11-30 04:51:59,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 477 transitions. [2023-11-30 04:51:59,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:51:59,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 477 transitions. [2023-11-30 04:51:59,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 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:51:59,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:59,214 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:59,214 INFO L307 CegarLoopForPetriNet]: 185 programPoint places, -17 predicate places. [2023-11-30 04:51:59,214 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 256 transitions, 3861 flow [2023-11-30 04:51:59,214 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 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:51:59,214 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:51:59,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, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:51:59,215 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 04:51:59,215 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:51:59,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:51:59,215 INFO L85 PathProgramCache]: Analyzing trace with hash -2125526304, now seen corresponding path program 1 times [2023-11-30 04:51:59,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:51:59,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432809194] [2023-11-30 04:51:59,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:51:59,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:51:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:51:59,321 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:51:59,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:51:59,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432809194] [2023-11-30 04:51:59,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432809194] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:51:59,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:51:59,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 04:51:59,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396977179] [2023-11-30 04:51:59,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:51:59,322 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 04:51:59,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:51:59,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 04:51:59,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-30 04:51:59,323 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 181 [2023-11-30 04:51:59,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 256 transitions, 3861 flow. Second operand has 7 states, 7 states have (on average 105.85714285714286) internal successors, (741), 7 states have internal predecessors, (741), 0 states have call successors, (0), 0 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:51:59,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:51:59,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 181 [2023-11-30 04:51:59,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:00,003 INFO L124 PetriNetUnfolderBase]: 1522/3788 cut-off events. [2023-11-30 04:52:00,004 INFO L125 PetriNetUnfolderBase]: For 38738/39302 co-relation queries the response was YES. [2023-11-30 04:52:00,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28752 conditions, 3788 events. 1522/3788 cut-off events. For 38738/39302 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 33938 event pairs, 39 based on Foata normal form. 0/3209 useless extension candidates. Maximal degree in co-relation 28582. Up to 2165 conditions per place. [2023-11-30 04:52:00,041 INFO L140 encePairwiseOnDemand]: 165/181 looper letters, 143 selfloop transitions, 28 changer transitions 0/267 dead transitions. [2023-11-30 04:52:00,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 267 transitions, 4467 flow [2023-11-30 04:52:00,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 04:52:00,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 04:52:00,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 681 transitions. [2023-11-30 04:52:00,048 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6270718232044199 [2023-11-30 04:52:00,048 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 681 transitions. [2023-11-30 04:52:00,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 681 transitions. [2023-11-30 04:52:00,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:00,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 681 transitions. [2023-11-30 04:52:00,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 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:52:00,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 181.0) internal successors, (1267), 7 states have internal predecessors, (1267), 0 states have call successors, (0), 0 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:52:00,059 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 181.0) internal successors, (1267), 7 states have internal predecessors, (1267), 0 states have call successors, (0), 0 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:52:00,059 INFO L307 CegarLoopForPetriNet]: 185 programPoint places, -12 predicate places. [2023-11-30 04:52:00,059 INFO L500 AbstractCegarLoop]: Abstraction has has 173 places, 267 transitions, 4467 flow [2023-11-30 04:52:00,060 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.85714285714286) internal successors, (741), 7 states have internal predecessors, (741), 0 states have call successors, (0), 0 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:52:00,060 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:00,060 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:52:00,060 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 04:52:00,060 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:52:00,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:00,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1768718383, now seen corresponding path program 1 times [2023-11-30 04:52:00,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:00,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997928677] [2023-11-30 04:52:00,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:00,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:00,754 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:52:00,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:00,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997928677] [2023-11-30 04:52:00,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997928677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:00,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:00,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-30 04:52:00,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494543982] [2023-11-30 04:52:00,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:00,755 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-30 04:52:00,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:00,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-30 04:52:00,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-11-30 04:52:00,756 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 181 [2023-11-30 04:52:00,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 267 transitions, 4467 flow. Second operand has 14 states, 14 states have (on average 100.71428571428571) internal successors, (1410), 14 states have internal predecessors, (1410), 0 states have call successors, (0), 0 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:52:00,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:00,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 181 [2023-11-30 04:52:00,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:01,492 INFO L124 PetriNetUnfolderBase]: 1102/3052 cut-off events. [2023-11-30 04:52:01,493 INFO L125 PetriNetUnfolderBase]: For 32694/33114 co-relation queries the response was YES. [2023-11-30 04:52:01,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23550 conditions, 3052 events. 1102/3052 cut-off events. For 32694/33114 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 26493 event pairs, 51 based on Foata normal form. 12/2701 useless extension candidates. Maximal degree in co-relation 23367. Up to 1619 conditions per place. [2023-11-30 04:52:01,517 INFO L140 encePairwiseOnDemand]: 161/181 looper letters, 145 selfloop transitions, 41 changer transitions 0/279 dead transitions. [2023-11-30 04:52:01,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 279 transitions, 5043 flow [2023-11-30 04:52:01,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-30 04:52:01,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-30 04:52:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1486 transitions. [2023-11-30 04:52:01,520 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5864246250986582 [2023-11-30 04:52:01,520 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1486 transitions. [2023-11-30 04:52:01,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1486 transitions. [2023-11-30 04:52:01,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:01,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1486 transitions. [2023-11-30 04:52:01,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 106.14285714285714) internal successors, (1486), 14 states have internal predecessors, (1486), 0 states have call successors, (0), 0 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:52:01,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 181.0) internal successors, (2715), 15 states have internal predecessors, (2715), 0 states have call successors, (0), 0 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:52:01,526 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 181.0) internal successors, (2715), 15 states have internal predecessors, (2715), 0 states have call successors, (0), 0 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:52:01,526 INFO L307 CegarLoopForPetriNet]: 185 programPoint places, 1 predicate places. [2023-11-30 04:52:01,526 INFO L500 AbstractCegarLoop]: Abstraction has has 186 places, 279 transitions, 5043 flow [2023-11-30 04:52:01,527 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 100.71428571428571) internal successors, (1410), 14 states have internal predecessors, (1410), 0 states have call successors, (0), 0 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:52:01,527 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:01,527 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:52:01,527 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 04:52:01,527 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:52:01,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:01,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1073782892, now seen corresponding path program 1 times [2023-11-30 04:52:01,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:01,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690563659] [2023-11-30 04:52:01,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:01,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:01,801 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:52:01,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:01,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690563659] [2023-11-30 04:52:01,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690563659] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:01,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:01,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-30 04:52:01,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619946612] [2023-11-30 04:52:01,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:01,802 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-30 04:52:01,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:01,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-30 04:52:01,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-30 04:52:01,803 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 181 [2023-11-30 04:52:01,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 279 transitions, 5043 flow. Second operand has 11 states, 11 states have (on average 101.18181818181819) internal successors, (1113), 11 states have internal predecessors, (1113), 0 states have call successors, (0), 0 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:52:01,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:01,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 181 [2023-11-30 04:52:01,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:02,252 INFO L124 PetriNetUnfolderBase]: 598/1732 cut-off events. [2023-11-30 04:52:02,252 INFO L125 PetriNetUnfolderBase]: For 21906/22302 co-relation queries the response was YES. [2023-11-30 04:52:02,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13648 conditions, 1732 events. 598/1732 cut-off events. For 21906/22302 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12363 event pairs, 12 based on Foata normal form. 0/1702 useless extension candidates. Maximal degree in co-relation 13454. Up to 737 conditions per place. [2023-11-30 04:52:02,260 INFO L140 encePairwiseOnDemand]: 167/181 looper letters, 0 selfloop transitions, 0 changer transitions 261/261 dead transitions. [2023-11-30 04:52:02,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 261 transitions, 4873 flow [2023-11-30 04:52:02,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 04:52:02,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 04:52:02,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 952 transitions. [2023-11-30 04:52:02,262 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5844076120319214 [2023-11-30 04:52:02,262 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 952 transitions. [2023-11-30 04:52:02,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 952 transitions. [2023-11-30 04:52:02,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:02,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 952 transitions. [2023-11-30 04:52:02,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 105.77777777777777) internal successors, (952), 9 states have internal predecessors, (952), 0 states have call successors, (0), 0 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:52:02,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 181.0) internal successors, (1810), 10 states have internal predecessors, (1810), 0 states have call successors, (0), 0 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:52:02,266 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 181.0) internal successors, (1810), 10 states have internal predecessors, (1810), 0 states have call successors, (0), 0 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:52:02,266 INFO L307 CegarLoopForPetriNet]: 185 programPoint places, 3 predicate places. [2023-11-30 04:52:02,266 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 261 transitions, 4873 flow [2023-11-30 04:52:02,267 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 101.18181818181819) internal successors, (1113), 11 states have internal predecessors, (1113), 0 states have call successors, (0), 0 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:52:02,277 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe028_power.i_BEv2_AllErrorsAtOnce [2023-11-30 04:52:02,301 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 87 remaining) [2023-11-30 04:52:02,302 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 87 remaining) [2023-11-30 04:52:02,302 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 87 remaining) [2023-11-30 04:52:02,302 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 87 remaining) [2023-11-30 04:52:02,302 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 87 remaining) [2023-11-30 04:52:02,302 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 87 remaining) [2023-11-30 04:52:02,302 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 87 remaining) [2023-11-30 04:52:02,302 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 87 remaining) [2023-11-30 04:52:02,303 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 87 remaining) [2023-11-30 04:52:02,303 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 87 remaining) [2023-11-30 04:52:02,303 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 87 remaining) [2023-11-30 04:52:02,303 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 87 remaining) [2023-11-30 04:52:02,303 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 87 remaining) [2023-11-30 04:52:02,303 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 87 remaining) [2023-11-30 04:52:02,303 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 87 remaining) [2023-11-30 04:52:02,303 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 87 remaining) [2023-11-30 04:52:02,303 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 87 remaining) [2023-11-30 04:52:02,303 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 87 remaining) [2023-11-30 04:52:02,304 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 87 remaining) [2023-11-30 04:52:02,304 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 87 remaining) [2023-11-30 04:52:02,304 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 87 remaining) [2023-11-30 04:52:02,304 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 87 remaining) [2023-11-30 04:52:02,304 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 87 remaining) [2023-11-30 04:52:02,304 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 87 remaining) [2023-11-30 04:52:02,304 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 87 remaining) [2023-11-30 04:52:02,304 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 87 remaining) [2023-11-30 04:52:02,304 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 87 remaining) [2023-11-30 04:52:02,304 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 87 remaining) [2023-11-30 04:52:02,305 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 87 remaining) [2023-11-30 04:52:02,305 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 87 remaining) [2023-11-30 04:52:02,305 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 87 remaining) [2023-11-30 04:52:02,305 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 87 remaining) [2023-11-30 04:52:02,305 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 87 remaining) [2023-11-30 04:52:02,305 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 87 remaining) [2023-11-30 04:52:02,305 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 87 remaining) [2023-11-30 04:52:02,305 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 87 remaining) [2023-11-30 04:52:02,305 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 87 remaining) [2023-11-30 04:52:02,306 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 87 remaining) [2023-11-30 04:52:02,306 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 87 remaining) [2023-11-30 04:52:02,306 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 87 remaining) [2023-11-30 04:52:02,306 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 87 remaining) [2023-11-30 04:52:02,306 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 87 remaining) [2023-11-30 04:52:02,306 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 87 remaining) [2023-11-30 04:52:02,306 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 87 remaining) [2023-11-30 04:52:02,306 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 87 remaining) [2023-11-30 04:52:02,306 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 87 remaining) [2023-11-30 04:52:02,306 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 87 remaining) [2023-11-30 04:52:02,307 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 87 remaining) [2023-11-30 04:52:02,307 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 87 remaining) [2023-11-30 04:52:02,307 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 87 remaining) [2023-11-30 04:52:02,307 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 87 remaining) [2023-11-30 04:52:02,307 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 87 remaining) [2023-11-30 04:52:02,307 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 87 remaining) [2023-11-30 04:52:02,307 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 87 remaining) [2023-11-30 04:52:02,307 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 87 remaining) [2023-11-30 04:52:02,307 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 87 remaining) [2023-11-30 04:52:02,307 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 87 remaining) [2023-11-30 04:52:02,308 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 87 remaining) [2023-11-30 04:52:02,308 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 87 remaining) [2023-11-30 04:52:02,308 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 87 remaining) [2023-11-30 04:52:02,308 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 87 remaining) [2023-11-30 04:52:02,308 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 87 remaining) [2023-11-30 04:52:02,308 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 87 remaining) [2023-11-30 04:52:02,308 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 87 remaining) [2023-11-30 04:52:02,308 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 87 remaining) [2023-11-30 04:52:02,308 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 87 remaining) [2023-11-30 04:52:02,308 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 87 remaining) [2023-11-30 04:52:02,309 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 87 remaining) [2023-11-30 04:52:02,309 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 87 remaining) [2023-11-30 04:52:02,309 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 87 remaining) [2023-11-30 04:52:02,309 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 87 remaining) [2023-11-30 04:52:02,309 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 87 remaining) [2023-11-30 04:52:02,309 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 87 remaining) [2023-11-30 04:52:02,309 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 87 remaining) [2023-11-30 04:52:02,309 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 87 remaining) [2023-11-30 04:52:02,309 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 87 remaining) [2023-11-30 04:52:02,309 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 87 remaining) [2023-11-30 04:52:02,310 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 87 remaining) [2023-11-30 04:52:02,310 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 87 remaining) [2023-11-30 04:52:02,310 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 87 remaining) [2023-11-30 04:52:02,310 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 87 remaining) [2023-11-30 04:52:02,310 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 87 remaining) [2023-11-30 04:52:02,310 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 87 remaining) [2023-11-30 04:52:02,310 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 87 remaining) [2023-11-30 04:52:02,310 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 87 remaining) [2023-11-30 04:52:02,310 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 87 remaining) [2023-11-30 04:52:02,310 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 87 remaining) [2023-11-30 04:52:02,311 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 04:52:02,311 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:52:02,315 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:52:02,315 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:52:02,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:52:02 BasicIcfg [2023-11-30 04:52:02,319 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:52:02,320 INFO L158 Benchmark]: Toolchain (without parser) took 19185.51ms. Allocated memory was 417.3MB in the beginning and 4.1GB in the end (delta: 3.7GB). Free memory was 369.7MB in the beginning and 1.7GB in the end (delta: -1.3GB). Peak memory consumption was 2.4GB. Max. memory is 16.0GB. [2023-11-30 04:52:02,320 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 337.6MB. Free memory is still 293.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:52:02,320 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.78ms. Allocated memory is still 417.3MB. Free memory was 369.7MB in the beginning and 344.0MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-11-30 04:52:02,320 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.46ms. Allocated memory is still 417.3MB. Free memory was 344.0MB in the beginning and 341.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 04:52:02,320 INFO L158 Benchmark]: Boogie Preprocessor took 55.41ms. Allocated memory is still 417.3MB. Free memory was 341.2MB in the beginning and 339.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:52:02,320 INFO L158 Benchmark]: RCFGBuilder took 913.12ms. Allocated memory is still 417.3MB. Free memory was 339.1MB in the beginning and 291.9MB in the end (delta: 47.3MB). Peak memory consumption was 73.1MB. Max. memory is 16.0GB. [2023-11-30 04:52:02,321 INFO L158 Benchmark]: TraceAbstraction took 17736.35ms. Allocated memory was 417.3MB in the beginning and 4.1GB in the end (delta: 3.7GB). Free memory was 290.8MB in the beginning and 1.7GB in the end (delta: -1.4GB). Peak memory consumption was 2.3GB. Max. memory is 16.0GB. [2023-11-30 04:52:02,321 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.10ms. Allocated memory is still 337.6MB. Free memory is still 293.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 416.78ms. Allocated memory is still 417.3MB. Free memory was 369.7MB in the beginning and 344.0MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 59.46ms. Allocated memory is still 417.3MB. Free memory was 344.0MB in the beginning and 341.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 55.41ms. Allocated memory is still 417.3MB. Free memory was 341.2MB in the beginning and 339.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 913.12ms. Allocated memory is still 417.3MB. Free memory was 339.1MB in the beginning and 291.9MB in the end (delta: 47.3MB). Peak memory consumption was 73.1MB. Max. memory is 16.0GB. * TraceAbstraction took 17736.35ms. Allocated memory was 417.3MB in the beginning and 4.1GB in the end (delta: 3.7GB). Free memory was 290.8MB in the beginning and 1.7GB in the end (delta: -1.4GB). Peak memory consumption was 2.3GB. 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 - 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, 242 locations, 87 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: 17.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 541 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 541 mSDsluCounter, 183 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 164 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1139 IncrementalHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 164 mSolverCounterUnsat, 137 mSDtfsCounter, 1139 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5043occurred in iteration=13, InterpolantAutomatonStates: 68, 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.1s InterpolantComputationTime, 1046 NumberOfCodeBlocks, 1046 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1032 ConstructedInterpolants, 0 QuantifiedInterpolants, 5104 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 48 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 04:52:02,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...