/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:08:40,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:08:40,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 21:08:40,726 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:08:40,727 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:08:40,727 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:08:40,728 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:08:40,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:08:40,729 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:08:40,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:08:40,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:08:40,732 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:08:40,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:08:40,733 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:08:40,733 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:08:40,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:08:40,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:08:40,734 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:08:40,734 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:08:40,734 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:08:40,734 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:08:40,735 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:08:40,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:08:40,735 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:08:40,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:08:40,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:08:40,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:08:40,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:08:40,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:08:40,736 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:08:40,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:08:40,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:08:40,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:08:40,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 21:08:40,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:08:40,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:08:40,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:08:40,944 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:08:40,944 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:08:40,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i [2023-12-05 21:08:42,005 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:08:42,242 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:08:42,243 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i [2023-12-05 21:08:42,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25fc79163/9f2e202db4ba41d28d3276189de6e059/FLAG1f14ee0ce [2023-12-05 21:08:42,281 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25fc79163/9f2e202db4ba41d28d3276189de6e059 [2023-12-05 21:08:42,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:08:42,284 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:08:42,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:08:42,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:08:42,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:08:42,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:08:42" (1/1) ... [2023-12-05 21:08:42,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24a03142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:42, skipping insertion in model container [2023-12-05 21:08:42,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:08:42" (1/1) ... [2023-12-05 21:08:42,340 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:08:42,627 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:08:42,638 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:08:42,676 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:08:42,703 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:08:42,703 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:08:42,708 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:08:42,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:42 WrapperNode [2023-12-05 21:08:42,708 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:08:42,709 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:08:42,709 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:08:42,709 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:08:42,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:42" (1/1) ... [2023-12-05 21:08:42,727 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:42" (1/1) ... [2023-12-05 21:08:42,756 INFO L138 Inliner]: procedures = 176, calls = 74, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 186 [2023-12-05 21:08:42,757 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:08:42,757 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:08:42,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:08:42,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:08:42,774 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:42" (1/1) ... [2023-12-05 21:08:42,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:42" (1/1) ... [2023-12-05 21:08:42,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:42" (1/1) ... [2023-12-05 21:08:42,788 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:42" (1/1) ... [2023-12-05 21:08:42,796 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:42" (1/1) ... [2023-12-05 21:08:42,810 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:42" (1/1) ... [2023-12-05 21:08:42,812 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:42" (1/1) ... [2023-12-05 21:08:42,813 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:42" (1/1) ... [2023-12-05 21:08:42,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:08:42,821 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:08:42,821 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:08:42,821 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:08:42,822 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:42" (1/1) ... [2023-12-05 21:08:42,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:08:42,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:08:42,845 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 21:08:42,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 21:08:42,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:08:42,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:08:42,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:08:42,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:08:42,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:08:42,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:08:42,872 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-05 21:08:42,873 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-05 21:08:42,873 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-05 21:08:42,873 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-05 21:08:42,873 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-05 21:08:42,873 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-05 21:08:42,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:08:42,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:08:42,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:08:42,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:08:42,875 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:08:43,016 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:08:43,018 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:08:43,448 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:08:43,797 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:08:43,798 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:08:43,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:08:43 BoogieIcfgContainer [2023-12-05 21:08:43,799 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:08:43,802 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:08:43,802 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:08:43,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:08:43,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:08:42" (1/3) ... [2023-12-05 21:08:43,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153e66fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:08:43, skipping insertion in model container [2023-12-05 21:08:43,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:42" (2/3) ... [2023-12-05 21:08:43,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153e66fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:08:43, skipping insertion in model container [2023-12-05 21:08:43,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:08:43" (3/3) ... [2023-12-05 21:08:43,807 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.opt.i [2023-12-05 21:08:43,820 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:08:43,820 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 40 error locations. [2023-12-05 21:08:43,820 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:08:43,930 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:08:43,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 173 transitions, 358 flow [2023-12-05 21:08:44,049 INFO L124 PetriNetUnfolderBase]: 3/170 cut-off events. [2023-12-05 21:08:44,049 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:08:44,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 170 events. 3/170 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 238 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2023-12-05 21:08:44,055 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 173 transitions, 358 flow [2023-12-05 21:08:44,063 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 170 transitions, 349 flow [2023-12-05 21:08:44,072 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:08:44,078 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;@2001e100, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:08:44,078 INFO L363 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2023-12-05 21:08:44,089 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:08:44,089 INFO L124 PetriNetUnfolderBase]: 0/57 cut-off events. [2023-12-05 21:08:44,089 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:08:44,089 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:44,090 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:44,090 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 21:08:44,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:44,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1671940769, now seen corresponding path program 1 times [2023-12-05 21:08:44,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:44,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493488844] [2023-12-05 21:08:44,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:44,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:44,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:44,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:44,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493488844] [2023-12-05 21:08:44,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493488844] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:44,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:44,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:44,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562131689] [2023-12-05 21:08:44,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:44,391 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:44,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:44,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:44,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:44,423 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 173 [2023-12-05 21:08:44,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 170 transitions, 349 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-12-05 21:08:44,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:44,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 173 [2023-12-05 21:08:44,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:48,356 INFO L124 PetriNetUnfolderBase]: 13737/26785 cut-off events. [2023-12-05 21:08:48,356 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-12-05 21:08:48,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46249 conditions, 26785 events. 13737/26785 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 2257. Compared 267069 event pairs, 8862 based on Foata normal form. 819/14059 useless extension candidates. Maximal degree in co-relation 46174. Up to 12547 conditions per place. [2023-12-05 21:08:48,576 INFO L140 encePairwiseOnDemand]: 153/173 looper letters, 66 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2023-12-05 21:08:48,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 168 transitions, 481 flow [2023-12-05 21:08:48,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:48,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:48,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-12-05 21:08:48,587 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7996146435452793 [2023-12-05 21:08:48,588 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-12-05 21:08:48,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-12-05 21:08:48,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:48,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-12-05 21:08:48,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:48,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:48,596 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:48,599 INFO L308 CegarLoopForPetriNet]: 177 programPoint places, -16 predicate places. [2023-12-05 21:08:48,599 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 168 transitions, 481 flow [2023-12-05 21:08:48,599 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-12-05 21:08:48,599 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:48,600 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:48,600 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:08:48,600 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 21:08:48,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:48,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1671940770, now seen corresponding path program 1 times [2023-12-05 21:08:48,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:48,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946022244] [2023-12-05 21:08:48,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:48,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:48,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:48,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:48,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946022244] [2023-12-05 21:08:48,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946022244] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:48,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:48,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:48,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721469101] [2023-12-05 21:08:48,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:48,756 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:48,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:48,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:48,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:48,759 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 173 [2023-12-05 21:08:48,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 168 transitions, 481 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-12-05 21:08:48,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:48,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 173 [2023-12-05 21:08:48,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:52,323 INFO L124 PetriNetUnfolderBase]: 13853/26993 cut-off events. [2023-12-05 21:08:52,324 INFO L125 PetriNetUnfolderBase]: For 1895/3953 co-relation queries the response was YES. [2023-12-05 21:08:52,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65248 conditions, 26993 events. 13853/26993 cut-off events. For 1895/3953 co-relation queries the response was YES. Maximal size of possible extension queue 2257. Compared 268758 event pairs, 8978 based on Foata normal form. 0/13395 useless extension candidates. Maximal degree in co-relation 65167. Up to 14015 conditions per place. [2023-12-05 21:08:52,485 INFO L140 encePairwiseOnDemand]: 170/173 looper letters, 81 selfloop transitions, 2 changer transitions 0/186 dead transitions. [2023-12-05 21:08:52,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 186 transitions, 719 flow [2023-12-05 21:08:52,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:52,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:52,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2023-12-05 21:08:52,487 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7495183044315993 [2023-12-05 21:08:52,488 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2023-12-05 21:08:52,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2023-12-05 21:08:52,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:52,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2023-12-05 21:08:52,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:52,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:52,491 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:52,492 INFO L308 CegarLoopForPetriNet]: 177 programPoint places, -15 predicate places. [2023-12-05 21:08:52,492 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 186 transitions, 719 flow [2023-12-05 21:08:52,492 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-12-05 21:08:52,492 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:52,493 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:52,493 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:08:52,493 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 21:08:52,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:52,495 INFO L85 PathProgramCache]: Analyzing trace with hash -977933688, now seen corresponding path program 1 times [2023-12-05 21:08:52,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:52,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203866723] [2023-12-05 21:08:52,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:52,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:52,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:52,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:52,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203866723] [2023-12-05 21:08:52,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203866723] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:52,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:52,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:08:52,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190485707] [2023-12-05 21:08:52,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:52,641 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:08:52,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:52,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:08:52,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:08:52,642 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 173 [2023-12-05 21:08:52,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 186 transitions, 719 flow. Second operand has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:52,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:52,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 173 [2023-12-05 21:08:52,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:55,923 INFO L124 PetriNetUnfolderBase]: 8362/18057 cut-off events. [2023-12-05 21:08:55,923 INFO L125 PetriNetUnfolderBase]: For 3818/5088 co-relation queries the response was YES. [2023-12-05 21:08:55,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54062 conditions, 18057 events. 8362/18057 cut-off events. For 3818/5088 co-relation queries the response was YES. Maximal size of possible extension queue 1455. Compared 187968 event pairs, 2250 based on Foata normal form. 0/11271 useless extension candidates. Maximal degree in co-relation 53970. Up to 9250 conditions per place. [2023-12-05 21:08:56,031 INFO L140 encePairwiseOnDemand]: 154/173 looper letters, 92 selfloop transitions, 15 changer transitions 0/205 dead transitions. [2023-12-05 21:08:56,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 205 transitions, 1043 flow [2023-12-05 21:08:56,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:08:56,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:08:56,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 851 transitions. [2023-12-05 21:08:56,034 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7027250206440958 [2023-12-05 21:08:56,034 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 851 transitions. [2023-12-05 21:08:56,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 851 transitions. [2023-12-05 21:08:56,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:56,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 851 transitions. [2023-12-05 21:08:56,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.57142857142857) internal successors, (851), 7 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:56,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 173.0) internal successors, (1384), 8 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:56,038 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 173.0) internal successors, (1384), 8 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:56,038 INFO L308 CegarLoopForPetriNet]: 177 programPoint places, -11 predicate places. [2023-12-05 21:08:56,038 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 205 transitions, 1043 flow [2023-12-05 21:08:56,039 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:56,039 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:56,039 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:56,039 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:08:56,039 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 21:08:56,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:56,040 INFO L85 PathProgramCache]: Analyzing trace with hash -977933687, now seen corresponding path program 1 times [2023-12-05 21:08:56,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:56,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87048634] [2023-12-05 21:08:56,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:56,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:56,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:56,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87048634] [2023-12-05 21:08:56,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87048634] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:56,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:56,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:56,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403620984] [2023-12-05 21:08:56,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:56,146 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:56,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:56,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:56,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:56,150 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 173 [2023-12-05 21:08:56,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 205 transitions, 1043 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:56,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:56,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 173 [2023-12-05 21:08:56,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:59,086 INFO L124 PetriNetUnfolderBase]: 11708/23116 cut-off events. [2023-12-05 21:08:59,086 INFO L125 PetriNetUnfolderBase]: For 8461/13457 co-relation queries the response was YES. [2023-12-05 21:08:59,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86466 conditions, 23116 events. 11708/23116 cut-off events. For 8461/13457 co-relation queries the response was YES. Maximal size of possible extension queue 1928. Compared 235215 event pairs, 1913 based on Foata normal form. 0/13726 useless extension candidates. Maximal degree in co-relation 86370. Up to 12993 conditions per place. [2023-12-05 21:08:59,277 INFO L140 encePairwiseOnDemand]: 165/173 looper letters, 129 selfloop transitions, 26 changer transitions 0/275 dead transitions. [2023-12-05 21:08:59,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 275 transitions, 1919 flow [2023-12-05 21:08:59,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:59,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:59,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-12-05 21:08:59,279 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8188824662813102 [2023-12-05 21:08:59,279 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-12-05 21:08:59,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-12-05 21:08:59,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:59,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-12-05 21:08:59,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:59,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:59,281 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:59,282 INFO L308 CegarLoopForPetriNet]: 177 programPoint places, -9 predicate places. [2023-12-05 21:08:59,282 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 275 transitions, 1919 flow [2023-12-05 21:08:59,282 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:59,282 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:59,283 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:59,283 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:08:59,283 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 21:08:59,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:59,283 INFO L85 PathProgramCache]: Analyzing trace with hash -977933685, now seen corresponding path program 1 times [2023-12-05 21:08:59,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:59,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238298325] [2023-12-05 21:08:59,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:59,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:59,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:59,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238298325] [2023-12-05 21:08:59,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238298325] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:59,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:59,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:08:59,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817764755] [2023-12-05 21:08:59,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:59,441 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:08:59,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:59,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:08:59,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:08:59,443 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 173 [2023-12-05 21:08:59,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 275 transitions, 1919 flow. Second operand has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:59,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:59,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 173 [2023-12-05 21:08:59,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:00,539 INFO L124 PetriNetUnfolderBase]: 2536/5959 cut-off events. [2023-12-05 21:09:00,540 INFO L125 PetriNetUnfolderBase]: For 4848/5388 co-relation queries the response was YES. [2023-12-05 21:09:00,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23817 conditions, 5959 events. 2536/5959 cut-off events. For 4848/5388 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 54992 event pairs, 293 based on Foata normal form. 0/4656 useless extension candidates. Maximal degree in co-relation 23711. Up to 3513 conditions per place. [2023-12-05 21:09:00,586 INFO L140 encePairwiseOnDemand]: 161/173 looper letters, 102 selfloop transitions, 3 changer transitions 0/206 dead transitions. [2023-12-05 21:09:00,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 206 transitions, 1439 flow [2023-12-05 21:09:00,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-05 21:09:00,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-05 21:09:00,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 579 transitions. [2023-12-05 21:09:00,589 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.669364161849711 [2023-12-05 21:09:00,589 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 579 transitions. [2023-12-05 21:09:00,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 579 transitions. [2023-12-05 21:09:00,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:00,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 579 transitions. [2023-12-05 21:09:00,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:00,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:00,592 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:00,593 INFO L308 CegarLoopForPetriNet]: 177 programPoint places, -14 predicate places. [2023-12-05 21:09:00,593 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 206 transitions, 1439 flow [2023-12-05 21:09:00,593 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:00,593 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:00,593 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:00,593 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:09:00,594 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 21:09:00,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:00,594 INFO L85 PathProgramCache]: Analyzing trace with hash -62317385, now seen corresponding path program 1 times [2023-12-05 21:09:00,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:00,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910111372] [2023-12-05 21:09:00,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:00,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:00,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:00,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:00,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910111372] [2023-12-05 21:09:00,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910111372] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:00,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:00,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:00,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043489706] [2023-12-05 21:09:00,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:00,660 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:00,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:00,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:00,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:00,661 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 173 [2023-12-05 21:09:00,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 206 transitions, 1439 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:00,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:00,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 173 [2023-12-05 21:09:00,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:02,023 INFO L124 PetriNetUnfolderBase]: 3029/6626 cut-off events. [2023-12-05 21:09:02,023 INFO L125 PetriNetUnfolderBase]: For 10496/11192 co-relation queries the response was YES. [2023-12-05 21:09:02,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31412 conditions, 6626 events. 3029/6626 cut-off events. For 10496/11192 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 60210 event pairs, 312 based on Foata normal form. 3/5083 useless extension candidates. Maximal degree in co-relation 31297. Up to 4013 conditions per place. [2023-12-05 21:09:02,062 INFO L140 encePairwiseOnDemand]: 170/173 looper letters, 105 selfloop transitions, 2 changer transitions 0/207 dead transitions. [2023-12-05 21:09:02,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 207 transitions, 1669 flow [2023-12-05 21:09:02,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:02,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:02,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-12-05 21:09:02,064 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6897880539499036 [2023-12-05 21:09:02,064 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-12-05 21:09:02,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-12-05 21:09:02,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:02,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-12-05 21:09:02,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:02,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:02,067 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:02,068 INFO L308 CegarLoopForPetriNet]: 177 programPoint places, -13 predicate places. [2023-12-05 21:09:02,068 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 207 transitions, 1669 flow [2023-12-05 21:09:02,068 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:02,068 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:02,068 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:02,068 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:09:02,068 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 21:09:02,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:02,069 INFO L85 PathProgramCache]: Analyzing trace with hash -62317384, now seen corresponding path program 1 times [2023-12-05 21:09:02,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:02,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804333825] [2023-12-05 21:09:02,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:02,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:02,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:02,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:02,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804333825] [2023-12-05 21:09:02,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804333825] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:02,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:02,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:02,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029721219] [2023-12-05 21:09:02,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:02,127 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:02,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:02,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:02,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:02,128 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 173 [2023-12-05 21:09:02,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 207 transitions, 1669 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:02,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:02,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 173 [2023-12-05 21:09:02,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:03,097 INFO L124 PetriNetUnfolderBase]: 3027/6639 cut-off events. [2023-12-05 21:09:03,097 INFO L125 PetriNetUnfolderBase]: For 14731/15723 co-relation queries the response was YES. [2023-12-05 21:09:03,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35594 conditions, 6639 events. 3027/6639 cut-off events. For 14731/15723 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 60056 event pairs, 216 based on Foata normal form. 3/5096 useless extension candidates. Maximal degree in co-relation 35471. Up to 4013 conditions per place. [2023-12-05 21:09:03,149 INFO L140 encePairwiseOnDemand]: 170/173 looper letters, 131 selfloop transitions, 2 changer transitions 0/237 dead transitions. [2023-12-05 21:09:03,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 237 transitions, 2361 flow [2023-12-05 21:09:03,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:03,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-12-05 21:09:03,151 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7129094412331407 [2023-12-05 21:09:03,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-12-05 21:09:03,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-12-05 21:09:03,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:03,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-12-05 21:09:03,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:03,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:03,153 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:03,153 INFO L308 CegarLoopForPetriNet]: 177 programPoint places, -12 predicate places. [2023-12-05 21:09:03,153 INFO L500 AbstractCegarLoop]: Abstraction has has 165 places, 237 transitions, 2361 flow [2023-12-05 21:09:03,154 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:03,154 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:03,154 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:03,154 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:09:03,154 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 21:09:03,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:03,154 INFO L85 PathProgramCache]: Analyzing trace with hash 366359176, now seen corresponding path program 1 times [2023-12-05 21:09:03,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:03,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614635058] [2023-12-05 21:09:03,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:03,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:03,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:03,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:03,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614635058] [2023-12-05 21:09:03,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614635058] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:03,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:03,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:03,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582016710] [2023-12-05 21:09:03,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:03,206 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:03,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:03,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:03,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:03,206 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 173 [2023-12-05 21:09:03,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 237 transitions, 2361 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:03,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:03,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 173 [2023-12-05 21:09:03,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:04,619 INFO L124 PetriNetUnfolderBase]: 3507/7075 cut-off events. [2023-12-05 21:09:04,620 INFO L125 PetriNetUnfolderBase]: For 28660/29040 co-relation queries the response was YES. [2023-12-05 21:09:04,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44027 conditions, 7075 events. 3507/7075 cut-off events. For 28660/29040 co-relation queries the response was YES. Maximal size of possible extension queue 678. Compared 61874 event pairs, 137 based on Foata normal form. 11/5312 useless extension candidates. Maximal degree in co-relation 43896. Up to 4508 conditions per place. [2023-12-05 21:09:04,714 INFO L140 encePairwiseOnDemand]: 170/173 looper letters, 167 selfloop transitions, 2 changer transitions 2/274 dead transitions. [2023-12-05 21:09:04,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 274 transitions, 3303 flow [2023-12-05 21:09:04,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:04,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:04,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-12-05 21:09:04,717 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7129094412331407 [2023-12-05 21:09:04,717 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-12-05 21:09:04,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-12-05 21:09:04,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:04,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-12-05 21:09:04,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:04,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:04,720 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:04,720 INFO L308 CegarLoopForPetriNet]: 177 programPoint places, -11 predicate places. [2023-12-05 21:09:04,720 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 274 transitions, 3303 flow [2023-12-05 21:09:04,721 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:04,721 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:04,721 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:04,721 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:09:04,721 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 21:09:04,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:04,722 INFO L85 PathProgramCache]: Analyzing trace with hash 366359175, now seen corresponding path program 1 times [2023-12-05 21:09:04,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:04,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539617275] [2023-12-05 21:09:04,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:04,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:04,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:04,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:04,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539617275] [2023-12-05 21:09:04,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539617275] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:04,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:04,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:04,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832990453] [2023-12-05 21:09:04,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:04,773 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:04,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:04,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:04,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:04,774 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 173 [2023-12-05 21:09:04,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 274 transitions, 3303 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:04,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:04,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 173 [2023-12-05 21:09:04,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:06,137 INFO L124 PetriNetUnfolderBase]: 3492/7064 cut-off events. [2023-12-05 21:09:06,137 INFO L125 PetriNetUnfolderBase]: For 35720/36174 co-relation queries the response was YES. [2023-12-05 21:09:06,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48762 conditions, 7064 events. 3492/7064 cut-off events. For 35720/36174 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 61859 event pairs, 137 based on Foata normal form. 11/5301 useless extension candidates. Maximal degree in co-relation 48622. Up to 4536 conditions per place. [2023-12-05 21:09:06,208 INFO L140 encePairwiseOnDemand]: 170/173 looper letters, 170 selfloop transitions, 2 changer transitions 2/273 dead transitions. [2023-12-05 21:09:06,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 273 transitions, 3639 flow [2023-12-05 21:09:06,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:06,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:06,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-12-05 21:09:06,209 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6859344894026975 [2023-12-05 21:09:06,209 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-12-05 21:09:06,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-12-05 21:09:06,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:06,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-12-05 21:09:06,210 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-12-05 21:09:06,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:06,212 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:06,212 INFO L308 CegarLoopForPetriNet]: 177 programPoint places, -10 predicate places. [2023-12-05 21:09:06,212 INFO L500 AbstractCegarLoop]: Abstraction has has 167 places, 273 transitions, 3639 flow [2023-12-05 21:09:06,212 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:06,212 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:06,213 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:06,213 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:09:06,213 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 21:09:06,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:06,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1936919999, now seen corresponding path program 1 times [2023-12-05 21:09:06,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:06,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402448781] [2023-12-05 21:09:06,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:06,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:06,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:06,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:06,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402448781] [2023-12-05 21:09:06,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402448781] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:06,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:06,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:06,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259551125] [2023-12-05 21:09:06,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:06,281 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:06,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:06,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:06,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:06,282 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 173 [2023-12-05 21:09:06,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 273 transitions, 3639 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-12-05 21:09:06,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:06,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 173 [2023-12-05 21:09:06,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:07,400 INFO L124 PetriNetUnfolderBase]: 3456/7049 cut-off events. [2023-12-05 21:09:07,401 INFO L125 PetriNetUnfolderBase]: For 44261/44791 co-relation queries the response was YES. [2023-12-05 21:09:07,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52082 conditions, 7049 events. 3456/7049 cut-off events. For 44261/44791 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 62109 event pairs, 121 based on Foata normal form. 1/5293 useless extension candidates. Maximal degree in co-relation 51939. Up to 4536 conditions per place. [2023-12-05 21:09:07,473 INFO L140 encePairwiseOnDemand]: 169/173 looper letters, 211 selfloop transitions, 20 changer transitions 2/350 dead transitions. [2023-12-05 21:09:07,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 350 transitions, 5651 flow [2023-12-05 21:09:07,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:07,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2023-12-05 21:09:07,475 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7784200385356455 [2023-12-05 21:09:07,475 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 404 transitions. [2023-12-05 21:09:07,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions. [2023-12-05 21:09:07,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:07,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions. [2023-12-05 21:09:07,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:07,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:07,477 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:07,477 INFO L308 CegarLoopForPetriNet]: 177 programPoint places, -8 predicate places. [2023-12-05 21:09:07,477 INFO L500 AbstractCegarLoop]: Abstraction has has 169 places, 350 transitions, 5651 flow [2023-12-05 21:09:07,478 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-12-05 21:09:07,478 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:07,478 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:07,478 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:09:07,478 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 21:09:07,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:07,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1249221582, now seen corresponding path program 1 times [2023-12-05 21:09:07,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:07,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025696429] [2023-12-05 21:09:07,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:07,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:07,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:07,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:07,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025696429] [2023-12-05 21:09:07,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025696429] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:07,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:07,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:09:07,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171060667] [2023-12-05 21:09:07,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:07,564 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:09:07,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:07,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:09:07,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:09:07,565 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 173 [2023-12-05 21:09:07,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 350 transitions, 5651 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:07,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:07,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 173 [2023-12-05 21:09:07,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:09,236 INFO L124 PetriNetUnfolderBase]: 3428/7041 cut-off events. [2023-12-05 21:09:09,236 INFO L125 PetriNetUnfolderBase]: For 54123/54663 co-relation queries the response was YES. [2023-12-05 21:09:09,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55957 conditions, 7041 events. 3428/7041 cut-off events. For 54123/54663 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 62705 event pairs, 119 based on Foata normal form. 0/5302 useless extension candidates. Maximal degree in co-relation 55803. Up to 4536 conditions per place. [2023-12-05 21:09:09,322 INFO L140 encePairwiseOnDemand]: 165/173 looper letters, 207 selfloop transitions, 46 changer transitions 2/355 dead transitions. [2023-12-05 21:09:09,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 355 transitions, 6223 flow [2023-12-05 21:09:09,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:09:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:09:09,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 480 transitions. [2023-12-05 21:09:09,324 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6936416184971098 [2023-12-05 21:09:09,324 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 480 transitions. [2023-12-05 21:09:09,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 480 transitions. [2023-12-05 21:09:09,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:09,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 480 transitions. [2023-12-05 21:09:09,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:09,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:09,326 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:09,327 INFO L308 CegarLoopForPetriNet]: 177 programPoint places, -6 predicate places. [2023-12-05 21:09:09,327 INFO L500 AbstractCegarLoop]: Abstraction has has 171 places, 355 transitions, 6223 flow [2023-12-05 21:09:09,327 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:09,327 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:09,327 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:09,327 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:09:09,327 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 21:09:09,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:09,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1906544653, now seen corresponding path program 1 times [2023-12-05 21:09:09,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:09,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356945335] [2023-12-05 21:09:09,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:09,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:09,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:09,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:09,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356945335] [2023-12-05 21:09:09,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356945335] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:09,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:09,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:09:09,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721105251] [2023-12-05 21:09:09,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:09,527 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:09:09,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:09,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:09:09,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:09:09,528 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 173 [2023-12-05 21:09:09,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 355 transitions, 6223 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:09,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:09,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 173 [2023-12-05 21:09:09,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:10,972 INFO L124 PetriNetUnfolderBase]: 3400/6984 cut-off events. [2023-12-05 21:09:10,973 INFO L125 PetriNetUnfolderBase]: For 65938/66744 co-relation queries the response was YES. [2023-12-05 21:09:10,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59166 conditions, 6984 events. 3400/6984 cut-off events. For 65938/66744 co-relation queries the response was YES. Maximal size of possible extension queue 692. Compared 61879 event pairs, 110 based on Foata normal form. 13/5277 useless extension candidates. Maximal degree in co-relation 59002. Up to 4536 conditions per place. [2023-12-05 21:09:11,043 INFO L140 encePairwiseOnDemand]: 170/173 looper letters, 220 selfloop transitions, 20 changer transitions 2/353 dead transitions. [2023-12-05 21:09:11,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 353 transitions, 6659 flow [2023-12-05 21:09:11,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:09:11,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:09:11,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2023-12-05 21:09:11,045 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6965317919075145 [2023-12-05 21:09:11,045 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2023-12-05 21:09:11,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2023-12-05 21:09:11,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:11,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2023-12-05 21:09:11,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:11,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:11,047 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:11,047 INFO L308 CegarLoopForPetriNet]: 177 programPoint places, -4 predicate places. [2023-12-05 21:09:11,047 INFO L500 AbstractCegarLoop]: Abstraction has has 173 places, 353 transitions, 6659 flow [2023-12-05 21:09:11,048 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:11,048 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:11,048 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:11,048 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:09:11,048 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 21:09:11,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:11,048 INFO L85 PathProgramCache]: Analyzing trace with hash -154924640, now seen corresponding path program 1 times [2023-12-05 21:09:11,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:11,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458145567] [2023-12-05 21:09:11,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:11,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:11,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:11,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:11,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458145567] [2023-12-05 21:09:11,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458145567] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:11,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:11,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:09:11,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512876317] [2023-12-05 21:09:11,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:11,176 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:09:11,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:11,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:09:11,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:09:11,177 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 173 [2023-12-05 21:09:11,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 353 transitions, 6659 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-12-05 21:09:11,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:11,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 173 [2023-12-05 21:09:11,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:12,279 INFO L124 PetriNetUnfolderBase]: 2576/5464 cut-off events. [2023-12-05 21:09:12,279 INFO L125 PetriNetUnfolderBase]: For 65567/66447 co-relation queries the response was YES. [2023-12-05 21:09:12,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49233 conditions, 5464 events. 2576/5464 cut-off events. For 65567/66447 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 46992 event pairs, 110 based on Foata normal form. 1/4225 useless extension candidates. Maximal degree in co-relation 49058. Up to 3505 conditions per place. [2023-12-05 21:09:12,349 INFO L140 encePairwiseOnDemand]: 156/173 looper letters, 215 selfloop transitions, 47 changer transitions 2/360 dead transitions. [2023-12-05 21:09:12,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 360 transitions, 7369 flow [2023-12-05 21:09:12,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 21:09:12,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 21:09:12,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 684 transitions. [2023-12-05 21:09:12,351 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6589595375722543 [2023-12-05 21:09:12,351 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 684 transitions. [2023-12-05 21:09:12,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 684 transitions. [2023-12-05 21:09:12,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:12,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 684 transitions. [2023-12-05 21:09:12,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:12,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:12,356 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:12,357 INFO L308 CegarLoopForPetriNet]: 177 programPoint places, 1 predicate places. [2023-12-05 21:09:12,357 INFO L500 AbstractCegarLoop]: Abstraction has has 178 places, 360 transitions, 7369 flow [2023-12-05 21:09:12,357 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-12-05 21:09:12,357 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:12,357 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:12,357 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:09:12,358 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 21:09:12,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:12,358 INFO L85 PathProgramCache]: Analyzing trace with hash -832892561, now seen corresponding path program 1 times [2023-12-05 21:09:12,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:12,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378921471] [2023-12-05 21:09:12,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:12,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:12,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:12,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:12,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378921471] [2023-12-05 21:09:12,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378921471] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:12,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:12,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-05 21:09:12,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368619168] [2023-12-05 21:09:12,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:12,849 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-05 21:09:12,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:12,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-05 21:09:12,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-05 21:09:12,850 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 173 [2023-12-05 21:09:12,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 360 transitions, 7369 flow. Second operand has 9 states, 9 states have (on average 103.44444444444444) internal successors, (931), 9 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:12,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:12,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 173 [2023-12-05 21:09:12,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:13,816 INFO L124 PetriNetUnfolderBase]: 1752/4091 cut-off events. [2023-12-05 21:09:13,816 INFO L125 PetriNetUnfolderBase]: For 53874/54896 co-relation queries the response was YES. [2023-12-05 21:09:13,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37637 conditions, 4091 events. 1752/4091 cut-off events. For 53874/54896 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 34240 event pairs, 110 based on Foata normal form. 1/3332 useless extension candidates. Maximal degree in co-relation 37451. Up to 2474 conditions per place. [2023-12-05 21:09:13,862 INFO L140 encePairwiseOnDemand]: 155/173 looper letters, 233 selfloop transitions, 35 changer transitions 4/367 dead transitions. [2023-12-05 21:09:13,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 367 transitions, 8109 flow [2023-12-05 21:09:13,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:09:13,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:09:13,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 881 transitions. [2023-12-05 21:09:13,865 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6365606936416185 [2023-12-05 21:09:13,865 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 881 transitions. [2023-12-05 21:09:13,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 881 transitions. [2023-12-05 21:09:13,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:13,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 881 transitions. [2023-12-05 21:09:13,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 110.125) internal successors, (881), 8 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:13,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 173.0) internal successors, (1557), 9 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:13,870 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 173.0) internal successors, (1557), 9 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:13,871 INFO L308 CegarLoopForPetriNet]: 177 programPoint places, 8 predicate places. [2023-12-05 21:09:13,871 INFO L500 AbstractCegarLoop]: Abstraction has has 185 places, 367 transitions, 8109 flow [2023-12-05 21:09:13,872 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 103.44444444444444) internal successors, (931), 9 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:13,872 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:13,872 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:13,872 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:09:13,872 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 21:09:13,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:13,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1547213353, now seen corresponding path program 1 times [2023-12-05 21:09:13,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:13,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073726207] [2023-12-05 21:09:13,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:13,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:14,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:14,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:14,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073726207] [2023-12-05 21:09:14,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073726207] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:14,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:14,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-05 21:09:14,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835740038] [2023-12-05 21:09:14,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:14,378 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-05 21:09:14,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:14,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-05 21:09:14,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-12-05 21:09:14,379 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 173 [2023-12-05 21:09:14,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 367 transitions, 8109 flow. Second operand has 13 states, 13 states have (on average 98.92307692307692) internal successors, (1286), 13 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:14,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:14,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 173 [2023-12-05 21:09:14,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:16,472 INFO L124 PetriNetUnfolderBase]: 2764/6408 cut-off events. [2023-12-05 21:09:16,472 INFO L125 PetriNetUnfolderBase]: For 84841/92281 co-relation queries the response was YES. [2023-12-05 21:09:16,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60036 conditions, 6408 events. 2764/6408 cut-off events. For 84841/92281 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 55071 event pairs, 128 based on Foata normal form. 23/5627 useless extension candidates. Maximal degree in co-relation 59838. Up to 3456 conditions per place. [2023-12-05 21:09:16,536 INFO L140 encePairwiseOnDemand]: 148/173 looper letters, 177 selfloop transitions, 92 changer transitions 347/708 dead transitions. [2023-12-05 21:09:16,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 708 transitions, 19009 flow [2023-12-05 21:09:16,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-05 21:09:16,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-12-05 21:09:16,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1892 transitions. [2023-12-05 21:09:16,541 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6075786769428388 [2023-12-05 21:09:16,541 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1892 transitions. [2023-12-05 21:09:16,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1892 transitions. [2023-12-05 21:09:16,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:16,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1892 transitions. [2023-12-05 21:09:16,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 105.11111111111111) internal successors, (1892), 18 states have internal predecessors, (1892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:16,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 173.0) internal successors, (3287), 19 states have internal predecessors, (3287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:16,552 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 173.0) internal successors, (3287), 19 states have internal predecessors, (3287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:16,552 INFO L308 CegarLoopForPetriNet]: 177 programPoint places, 25 predicate places. [2023-12-05 21:09:16,552 INFO L500 AbstractCegarLoop]: Abstraction has has 202 places, 708 transitions, 19009 flow [2023-12-05 21:09:16,553 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 98.92307692307692) internal successors, (1286), 13 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:16,553 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:16,553 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:16,553 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-05 21:09:16,553 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 21:09:16,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:16,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1127655770, now seen corresponding path program 1 times [2023-12-05 21:09:16,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:16,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476325442] [2023-12-05 21:09:16,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:16,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:16,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:16,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:16,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476325442] [2023-12-05 21:09:16,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476325442] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:16,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:16,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-05 21:09:16,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518888957] [2023-12-05 21:09:16,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:16,944 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-05 21:09:16,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:16,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-05 21:09:16,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-12-05 21:09:16,945 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 173 [2023-12-05 21:09:16,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 708 transitions, 19009 flow. Second operand has 14 states, 14 states have (on average 95.0) internal successors, (1330), 14 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:16,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:16,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 173 [2023-12-05 21:09:16,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:22,396 INFO L124 PetriNetUnfolderBase]: 9061/19102 cut-off events. [2023-12-05 21:09:22,396 INFO L125 PetriNetUnfolderBase]: For 328251/518934 co-relation queries the response was YES. [2023-12-05 21:09:22,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170434 conditions, 19102 events. 9061/19102 cut-off events. For 328251/518934 co-relation queries the response was YES. Maximal size of possible extension queue 805. Compared 178578 event pairs, 654 based on Foata normal form. 60/17913 useless extension candidates. Maximal degree in co-relation 170223. Up to 7933 conditions per place. [2023-12-05 21:09:22,538 INFO L140 encePairwiseOnDemand]: 147/173 looper letters, 193 selfloop transitions, 86 changer transitions 1187/1554 dead transitions. [2023-12-05 21:09:22,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 1554 transitions, 46093 flow [2023-12-05 21:09:22,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-05 21:09:22,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-12-05 21:09:22,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1674 transitions. [2023-12-05 21:09:22,542 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6047687861271677 [2023-12-05 21:09:22,542 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1674 transitions. [2023-12-05 21:09:22,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1674 transitions. [2023-12-05 21:09:22,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:22,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1674 transitions. [2023-12-05 21:09:22,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 104.625) internal successors, (1674), 16 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:22,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 173.0) internal successors, (2941), 17 states have internal predecessors, (2941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:22,548 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 173.0) internal successors, (2941), 17 states have internal predecessors, (2941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:22,548 INFO L308 CegarLoopForPetriNet]: 177 programPoint places, 40 predicate places. [2023-12-05 21:09:22,549 INFO L500 AbstractCegarLoop]: Abstraction has has 217 places, 1554 transitions, 46093 flow [2023-12-05 21:09:22,549 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 95.0) internal successors, (1330), 14 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:22,549 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:22,549 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:22,549 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-05 21:09:22,549 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 21:09:22,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:22,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1173287353, now seen corresponding path program 1 times [2023-12-05 21:09:22,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:22,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060124319] [2023-12-05 21:09:22,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:22,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:22,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:22,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:22,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060124319] [2023-12-05 21:09:22,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060124319] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:22,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:22,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-05 21:09:22,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485375759] [2023-12-05 21:09:22,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:22,854 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:09:22,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:22,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:09:22,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:09:22,856 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 173 [2023-12-05 21:09:22,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 1554 transitions, 46093 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-12-05 21:09:22,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:22,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 173 [2023-12-05 21:09:22,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:28,621 INFO L124 PetriNetUnfolderBase]: 7831/16498 cut-off events. [2023-12-05 21:09:28,621 INFO L125 PetriNetUnfolderBase]: For 325097/460184 co-relation queries the response was YES. [2023-12-05 21:09:28,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151264 conditions, 16498 events. 7831/16498 cut-off events. For 325097/460184 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 150368 event pairs, 614 based on Foata normal form. 17/16068 useless extension candidates. Maximal degree in co-relation 151042. Up to 6170 conditions per place. [2023-12-05 21:09:28,731 INFO L140 encePairwiseOnDemand]: 158/173 looper letters, 0 selfloop transitions, 0 changer transitions 1514/1514 dead transitions. [2023-12-05 21:09:28,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 1514 transitions, 47467 flow [2023-12-05 21:09:28,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 21:09:28,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 21:09:28,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 956 transitions. [2023-12-05 21:09:28,734 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6140012845215157 [2023-12-05 21:09:28,734 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 956 transitions. [2023-12-05 21:09:28,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 956 transitions. [2023-12-05 21:09:28,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:28,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 956 transitions. [2023-12-05 21:09:28,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 106.22222222222223) internal successors, (956), 9 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:28,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 173.0) internal successors, (1730), 10 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:28,737 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 173.0) internal successors, (1730), 10 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:28,738 INFO L308 CegarLoopForPetriNet]: 177 programPoint places, 41 predicate places. [2023-12-05 21:09:28,738 INFO L500 AbstractCegarLoop]: Abstraction has has 218 places, 1514 transitions, 47467 flow [2023-12-05 21:09:28,738 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-12-05 21:09:28,751 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe003_power.opt.i_BEv2_AllErrorsAtOnce [2023-12-05 21:09:28,804 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 71 remaining) [2023-12-05 21:09:28,805 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 71 remaining) [2023-12-05 21:09:28,805 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 71 remaining) [2023-12-05 21:09:28,805 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 71 remaining) [2023-12-05 21:09:28,805 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 71 remaining) [2023-12-05 21:09:28,805 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 71 remaining) [2023-12-05 21:09:28,805 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 71 remaining) [2023-12-05 21:09:28,805 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 71 remaining) [2023-12-05 21:09:28,805 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 71 remaining) [2023-12-05 21:09:28,806 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 71 remaining) [2023-12-05 21:09:28,806 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 71 remaining) [2023-12-05 21:09:28,806 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 71 remaining) [2023-12-05 21:09:28,806 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 71 remaining) [2023-12-05 21:09:28,806 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 71 remaining) [2023-12-05 21:09:28,806 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 71 remaining) [2023-12-05 21:09:28,806 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 71 remaining) [2023-12-05 21:09:28,806 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 71 remaining) [2023-12-05 21:09:28,807 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 71 remaining) [2023-12-05 21:09:28,807 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 71 remaining) [2023-12-05 21:09:28,807 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 71 remaining) [2023-12-05 21:09:28,807 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 71 remaining) [2023-12-05 21:09:28,807 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 71 remaining) [2023-12-05 21:09:28,807 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 71 remaining) [2023-12-05 21:09:28,807 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 71 remaining) [2023-12-05 21:09:28,807 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 71 remaining) [2023-12-05 21:09:28,807 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 71 remaining) [2023-12-05 21:09:28,807 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 71 remaining) [2023-12-05 21:09:28,808 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 71 remaining) [2023-12-05 21:09:28,808 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 71 remaining) [2023-12-05 21:09:28,808 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 71 remaining) [2023-12-05 21:09:28,808 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 71 remaining) [2023-12-05 21:09:28,808 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 71 remaining) [2023-12-05 21:09:28,808 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 71 remaining) [2023-12-05 21:09:28,808 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 71 remaining) [2023-12-05 21:09:28,808 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 71 remaining) [2023-12-05 21:09:28,808 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 71 remaining) [2023-12-05 21:09:28,808 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 71 remaining) [2023-12-05 21:09:28,808 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 71 remaining) [2023-12-05 21:09:28,808 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 71 remaining) [2023-12-05 21:09:28,808 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 71 remaining) [2023-12-05 21:09:28,809 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 71 remaining) [2023-12-05 21:09:28,809 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 71 remaining) [2023-12-05 21:09:28,809 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 71 remaining) [2023-12-05 21:09:28,809 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 71 remaining) [2023-12-05 21:09:28,809 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 71 remaining) [2023-12-05 21:09:28,809 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 71 remaining) [2023-12-05 21:09:28,809 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 71 remaining) [2023-12-05 21:09:28,810 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 71 remaining) [2023-12-05 21:09:28,810 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 71 remaining) [2023-12-05 21:09:28,810 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 71 remaining) [2023-12-05 21:09:28,810 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 71 remaining) [2023-12-05 21:09:28,810 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 71 remaining) [2023-12-05 21:09:28,810 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 71 remaining) [2023-12-05 21:09:28,810 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 71 remaining) [2023-12-05 21:09:28,810 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 71 remaining) [2023-12-05 21:09:28,810 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 71 remaining) [2023-12-05 21:09:28,810 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 71 remaining) [2023-12-05 21:09:28,810 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 71 remaining) [2023-12-05 21:09:28,810 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 71 remaining) [2023-12-05 21:09:28,810 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 71 remaining) [2023-12-05 21:09:28,810 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 71 remaining) [2023-12-05 21:09:28,811 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 71 remaining) [2023-12-05 21:09:28,811 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 71 remaining) [2023-12-05 21:09:28,811 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 71 remaining) [2023-12-05 21:09:28,811 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 71 remaining) [2023-12-05 21:09:28,811 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 71 remaining) [2023-12-05 21:09:28,811 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 71 remaining) [2023-12-05 21:09:28,811 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 71 remaining) [2023-12-05 21:09:28,811 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 71 remaining) [2023-12-05 21:09:28,811 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 71 remaining) [2023-12-05 21:09:28,811 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 71 remaining) [2023-12-05 21:09:28,811 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-05 21:09:28,812 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:28,817 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:09:28,817 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:09:28,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:09:28 BasicIcfg [2023-12-05 21:09:28,823 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:09:28,824 INFO L158 Benchmark]: Toolchain (without parser) took 46539.63ms. Allocated memory was 381.7MB in the beginning and 4.8GB in the end (delta: 4.4GB). Free memory was 336.5MB in the beginning and 3.0GB in the end (delta: -2.6GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2023-12-05 21:09:28,824 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 226.5MB. Free memory is still 171.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:09:28,824 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.83ms. Allocated memory is still 381.7MB. Free memory was 336.3MB in the beginning and 311.5MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-12-05 21:09:28,824 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.52ms. Allocated memory is still 381.7MB. Free memory was 311.5MB in the beginning and 309.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:09:28,824 INFO L158 Benchmark]: Boogie Preprocessor took 63.24ms. Allocated memory is still 381.7MB. Free memory was 309.0MB in the beginning and 306.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-05 21:09:28,824 INFO L158 Benchmark]: RCFGBuilder took 978.12ms. Allocated memory is still 381.7MB. Free memory was 306.4MB in the beginning and 296.6MB in the end (delta: 9.8MB). Peak memory consumption was 100.0MB. Max. memory is 8.0GB. [2023-12-05 21:09:28,825 INFO L158 Benchmark]: TraceAbstraction took 45021.71ms. Allocated memory was 381.7MB in the beginning and 4.8GB in the end (delta: 4.4GB). Free memory was 296.1MB in the beginning and 3.0GB in the end (delta: -2.7GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2023-12-05 21:09:28,825 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 226.5MB. Free memory is still 171.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 423.83ms. Allocated memory is still 381.7MB. Free memory was 336.3MB in the beginning and 311.5MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.52ms. Allocated memory is still 381.7MB. Free memory was 311.5MB in the beginning and 309.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 63.24ms. Allocated memory is still 381.7MB. Free memory was 309.0MB in the beginning and 306.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 978.12ms. Allocated memory is still 381.7MB. Free memory was 306.4MB in the beginning and 296.6MB in the end (delta: 9.8MB). Peak memory consumption was 100.0MB. Max. memory is 8.0GB. * TraceAbstraction took 45021.71ms. Allocated memory was 381.7MB in the beginning and 4.8GB in the end (delta: 4.4GB). Free memory was 296.1MB in the beginning and 3.0GB in the end (delta: -2.7GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 226 locations, 71 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: 44.9s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 41.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 969 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 969 mSDsluCounter, 345 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 169 mSDsCounter, 279 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1964 IncrementalHoareTripleChecker+Invalid, 2243 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 279 mSolverCounterUnsat, 176 mSDtfsCounter, 1964 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47467occurred in iteration=17, InterpolantAutomatonStates: 101, 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.8s InterpolantComputationTime, 1308 NumberOfCodeBlocks, 1308 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1291 ConstructedInterpolants, 0 QuantifiedInterpolants, 6876 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 40 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:09:28,842 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...