/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/safe014_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:09:23,239 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:09:23,321 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 21:09:23,350 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:09:23,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:09:23,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:09:23,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:09:23,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:09:23,352 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:09:23,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:09:23,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:09:23,353 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:09:23,354 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:09:23,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:09:23,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:09:23,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:09:23,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:09:23,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:09:23,356 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:09:23,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:09:23,356 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:09:23,357 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:09:23,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:09:23,358 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:09:23,358 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:09:23,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:09:23,359 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:09:23,359 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:09:23,359 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:09:23,360 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:09:23,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:09:23,360 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:09:23,360 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:09:23,361 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 21:09:23,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:09:23,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:09:23,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:09:23,601 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:09:23,601 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:09:23,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe014_power.oepc.i [2023-12-05 21:09:24,755 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:09:25,008 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:09:25,009 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe014_power.oepc.i [2023-12-05 21:09:25,026 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8db93bad0/a5f40c12fdf747e6b180adddac7e2cd0/FLAGb981527f2 [2023-12-05 21:09:25,045 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8db93bad0/a5f40c12fdf747e6b180adddac7e2cd0 [2023-12-05 21:09:25,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:09:25,048 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:09:25,049 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:09:25,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:09:25,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:09:25,056 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:09:25" (1/1) ... [2023-12-05 21:09:25,057 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c55c7c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:25, skipping insertion in model container [2023-12-05 21:09:25,057 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:09:25" (1/1) ... [2023-12-05 21:09:25,126 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:09:25,516 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:09:25,530 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:09:25,587 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:09:25,622 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:09:25,622 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:09:25,629 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:09:25,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:25 WrapperNode [2023-12-05 21:09:25,630 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:09:25,631 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:09:25,632 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:09:25,632 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:09:25,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:25" (1/1) ... [2023-12-05 21:09:25,673 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:25" (1/1) ... [2023-12-05 21:09:25,705 INFO L138 Inliner]: procedures = 176, calls = 70, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2023-12-05 21:09:25,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:09:25,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:09:25,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:09:25,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:09:25,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:25" (1/1) ... [2023-12-05 21:09:25,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:25" (1/1) ... [2023-12-05 21:09:25,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:25" (1/1) ... [2023-12-05 21:09:25,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:25" (1/1) ... [2023-12-05 21:09:25,744 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:25" (1/1) ... [2023-12-05 21:09:25,746 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:25" (1/1) ... [2023-12-05 21:09:25,749 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:25" (1/1) ... [2023-12-05 21:09:25,750 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:25" (1/1) ... [2023-12-05 21:09:25,754 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:09:25,755 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:09:25,755 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:09:25,756 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:09:25,756 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:25" (1/1) ... [2023-12-05 21:09:25,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:09:25,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:09:25,784 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 21:09:25,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 21:09:25,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:09:25,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:09:25,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:09:25,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:09:25,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:09:25,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:09:25,821 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-05 21:09:25,821 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-05 21:09:25,821 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-05 21:09:25,821 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-05 21:09:25,821 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-05 21:09:25,821 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-05 21:09:25,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:09:25,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:09:25,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:09:25,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:09:25,823 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:09:25,935 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:09:25,937 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:09:26,470 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:09:26,896 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:09:26,897 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:09:26,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:09:26 BoogieIcfgContainer [2023-12-05 21:09:26,898 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:09:26,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:09:26,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:09:26,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:09:26,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:09:25" (1/3) ... [2023-12-05 21:09:26,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10cfc146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:09:26, skipping insertion in model container [2023-12-05 21:09:26,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:25" (2/3) ... [2023-12-05 21:09:26,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10cfc146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:09:26, skipping insertion in model container [2023-12-05 21:09:26,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:09:26" (3/3) ... [2023-12-05 21:09:26,908 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_power.oepc.i [2023-12-05 21:09:26,926 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:09:26,926 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2023-12-05 21:09:26,926 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:09:27,035 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:09:27,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 167 transitions, 346 flow [2023-12-05 21:09:27,173 INFO L124 PetriNetUnfolderBase]: 3/164 cut-off events. [2023-12-05 21:09:27,173 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:09:27,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 164 events. 3/164 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 222 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 108. Up to 2 conditions per place. [2023-12-05 21:09:27,180 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 167 transitions, 346 flow [2023-12-05 21:09:27,188 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 171 places, 164 transitions, 337 flow [2023-12-05 21:09:27,201 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:09:27,209 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;@21fbcd93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:09:27,209 INFO L363 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2023-12-05 21:09:27,224 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:09:27,224 INFO L124 PetriNetUnfolderBase]: 0/57 cut-off events. [2023-12-05 21:09:27,224 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:09:27,225 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:27,225 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:27,226 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-05 21:09:27,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:27,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1550432755, now seen corresponding path program 1 times [2023-12-05 21:09:27,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:27,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858422692] [2023-12-05 21:09:27,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:27,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:27,586 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:27,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:27,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858422692] [2023-12-05 21:09:27,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858422692] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:27,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:27,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:27,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956874909] [2023-12-05 21:09:27,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:27,600 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:27,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:27,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:27,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:27,637 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 167 [2023-12-05 21:09:27,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 164 transitions, 337 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:27,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:27,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 167 [2023-12-05 21:09:27,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:28,443 INFO L124 PetriNetUnfolderBase]: 815/2107 cut-off events. [2023-12-05 21:09:28,444 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-05 21:09:28,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3489 conditions, 2107 events. 815/2107 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 15159 event pairs, 520 based on Foata normal form. 76/1279 useless extension candidates. Maximal degree in co-relation 3414. Up to 879 conditions per place. [2023-12-05 21:09:28,472 INFO L140 encePairwiseOnDemand]: 147/167 looper letters, 50 selfloop transitions, 2 changer transitions 0/154 dead transitions. [2023-12-05 21:09:28,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 154 transitions, 421 flow [2023-12-05 21:09:28,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:28,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:28,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2023-12-05 21:09:28,490 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8083832335329342 [2023-12-05 21:09:28,491 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2023-12-05 21:09:28,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2023-12-05 21:09:28,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:28,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2023-12-05 21:09:28,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 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,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 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,506 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 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,510 INFO L308 CegarLoopForPetriNet]: 171 programPoint places, -16 predicate places. [2023-12-05 21:09:28,511 INFO L500 AbstractCegarLoop]: Abstraction has has 155 places, 154 transitions, 421 flow [2023-12-05 21:09:28,511 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:28,511 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:28,511 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:28,512 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:09:28,512 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-05 21:09:28,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:28,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1550432754, now seen corresponding path program 1 times [2023-12-05 21:09:28,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:28,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714745369] [2023-12-05 21:09:28,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:28,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:28,730 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:28,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:28,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714745369] [2023-12-05 21:09:28,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714745369] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:28,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:28,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:28,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163823871] [2023-12-05 21:09:28,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:28,733 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:28,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:28,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:28,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:28,735 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 167 [2023-12-05 21:09:28,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 154 transitions, 421 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:28,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:28,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 167 [2023-12-05 21:09:28,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:29,219 INFO L124 PetriNetUnfolderBase]: 821/2120 cut-off events. [2023-12-05 21:09:29,219 INFO L125 PetriNetUnfolderBase]: For 172/472 co-relation queries the response was YES. [2023-12-05 21:09:29,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4799 conditions, 2120 events. 821/2120 cut-off events. For 172/472 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 15271 event pairs, 526 based on Foata normal form. 0/1215 useless extension candidates. Maximal degree in co-relation 4718. Up to 979 conditions per place. [2023-12-05 21:09:29,242 INFO L140 encePairwiseOnDemand]: 164/167 looper letters, 57 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2023-12-05 21:09:29,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 164 transitions, 579 flow [2023-12-05 21:09:29,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:29,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:29,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-12-05 21:09:29,244 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7564870259481038 [2023-12-05 21:09:29,244 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-12-05 21:09:29,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-12-05 21:09:29,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:29,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-12-05 21:09:29,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 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:29,247 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 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:29,248 INFO L308 CegarLoopForPetriNet]: 171 programPoint places, -15 predicate places. [2023-12-05 21:09:29,248 INFO L500 AbstractCegarLoop]: Abstraction has has 156 places, 164 transitions, 579 flow [2023-12-05 21:09:29,249 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:29,249 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:29,250 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:29,250 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:09:29,250 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-05 21:09:29,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:29,251 INFO L85 PathProgramCache]: Analyzing trace with hash -863157692, now seen corresponding path program 1 times [2023-12-05 21:09:29,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:29,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981447362] [2023-12-05 21:09:29,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:29,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:29,517 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:29,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:29,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981447362] [2023-12-05 21:09:29,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981447362] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:29,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:29,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:09:29,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973552265] [2023-12-05 21:09:29,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:29,521 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:09:29,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:29,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:09:29,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:09:29,523 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 167 [2023-12-05 21:09:29,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 164 transitions, 579 flow. Second operand has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 0 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:29,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:29,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 167 [2023-12-05 21:09:29,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:29,808 INFO L124 PetriNetUnfolderBase]: 327/1017 cut-off events. [2023-12-05 21:09:29,809 INFO L125 PetriNetUnfolderBase]: For 269/467 co-relation queries the response was YES. [2023-12-05 21:09:29,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2633 conditions, 1017 events. 327/1017 cut-off events. For 269/467 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5951 event pairs, 192 based on Foata normal form. 0/713 useless extension candidates. Maximal degree in co-relation 2543. Up to 481 conditions per place. [2023-12-05 21:09:29,820 INFO L140 encePairwiseOnDemand]: 159/167 looper letters, 41 selfloop transitions, 2 changer transitions 0/150 dead transitions. [2023-12-05 21:09:29,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 150 transitions, 581 flow [2023-12-05 21:09:29,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:09:29,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:09:29,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2023-12-05 21:09:29,823 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7290419161676647 [2023-12-05 21:09:29,823 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 487 transitions. [2023-12-05 21:09:29,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 487 transitions. [2023-12-05 21:09:29,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:29,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 487 transitions. [2023-12-05 21:09:29,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 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:29,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 0 states have call successors, (0), 0 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:29,827 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 0 states have call successors, (0), 0 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:29,829 INFO L308 CegarLoopForPetriNet]: 171 programPoint places, -18 predicate places. [2023-12-05 21:09:29,829 INFO L500 AbstractCegarLoop]: Abstraction has has 153 places, 150 transitions, 581 flow [2023-12-05 21:09:29,829 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 0 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:29,829 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:29,830 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:29,830 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:09:29,830 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-05 21:09:29,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:29,831 INFO L85 PathProgramCache]: Analyzing trace with hash -863157693, now seen corresponding path program 1 times [2023-12-05 21:09:29,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:29,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801915336] [2023-12-05 21:09:29,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:29,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:29,960 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:29,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:29,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801915336] [2023-12-05 21:09:29,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801915336] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:29,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:29,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:09:29,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867986099] [2023-12-05 21:09:29,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:29,962 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:09:29,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:29,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:09:29,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:09:29,963 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 167 [2023-12-05 21:09:29,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 150 transitions, 581 flow. Second operand has 6 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 0 states have call successors, (0), 0 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:29,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:29,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 167 [2023-12-05 21:09:29,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:30,305 INFO L124 PetriNetUnfolderBase]: 183/775 cut-off events. [2023-12-05 21:09:30,305 INFO L125 PetriNetUnfolderBase]: For 363/437 co-relation queries the response was YES. [2023-12-05 21:09:30,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2124 conditions, 775 events. 183/775 cut-off events. For 363/437 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4501 event pairs, 43 based on Foata normal form. 0/673 useless extension candidates. Maximal degree in co-relation 2023. Up to 289 conditions per place. [2023-12-05 21:09:30,312 INFO L140 encePairwiseOnDemand]: 152/167 looper letters, 41 selfloop transitions, 13 changer transitions 0/154 dead transitions. [2023-12-05 21:09:30,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 154 transitions, 709 flow [2023-12-05 21:09:30,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:09:30,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:09:30,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 803 transitions. [2023-12-05 21:09:30,315 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6869118905047049 [2023-12-05 21:09:30,315 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 803 transitions. [2023-12-05 21:09:30,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 803 transitions. [2023-12-05 21:09:30,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:30,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 803 transitions. [2023-12-05 21:09:30,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 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:30,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 167.0) internal successors, (1336), 8 states have internal predecessors, (1336), 0 states have call successors, (0), 0 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:30,320 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 167.0) internal successors, (1336), 8 states have internal predecessors, (1336), 0 states have call successors, (0), 0 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:30,321 INFO L308 CegarLoopForPetriNet]: 171 programPoint places, -14 predicate places. [2023-12-05 21:09:30,321 INFO L500 AbstractCegarLoop]: Abstraction has has 157 places, 154 transitions, 709 flow [2023-12-05 21:09:30,321 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 0 states have call successors, (0), 0 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:30,321 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:30,322 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:30,322 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:09:30,322 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-05 21:09:30,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:30,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1282946173, now seen corresponding path program 1 times [2023-12-05 21:09:30,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:30,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010767902] [2023-12-05 21:09:30,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:30,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:30,397 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:30,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:30,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010767902] [2023-12-05 21:09:30,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010767902] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:30,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:30,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:30,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55003731] [2023-12-05 21:09:30,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:30,399 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:30,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:30,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:30,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:30,401 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 167 [2023-12-05 21:09:30,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 154 transitions, 709 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:30,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:30,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 167 [2023-12-05 21:09:30,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:30,622 INFO L124 PetriNetUnfolderBase]: 215/826 cut-off events. [2023-12-05 21:09:30,623 INFO L125 PetriNetUnfolderBase]: For 746/836 co-relation queries the response was YES. [2023-12-05 21:09:30,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2708 conditions, 826 events. 215/826 cut-off events. For 746/836 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4901 event pairs, 29 based on Foata normal form. 2/714 useless extension candidates. Maximal degree in co-relation 2598. Up to 326 conditions per place. [2023-12-05 21:09:30,632 INFO L140 encePairwiseOnDemand]: 164/167 looper letters, 50 selfloop transitions, 2 changer transitions 0/154 dead transitions. [2023-12-05 21:09:30,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 154 transitions, 817 flow [2023-12-05 21:09:30,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:30,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:30,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-12-05 21:09:30,634 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7125748502994012 [2023-12-05 21:09:30,634 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-12-05 21:09:30,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-12-05 21:09:30,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:30,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-12-05 21:09:30,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 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:30,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 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:30,637 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 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:30,638 INFO L308 CegarLoopForPetriNet]: 171 programPoint places, -13 predicate places. [2023-12-05 21:09:30,638 INFO L500 AbstractCegarLoop]: Abstraction has has 158 places, 154 transitions, 817 flow [2023-12-05 21:09:30,638 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:30,638 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:30,639 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:30,639 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:09:30,639 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-05 21:09:30,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:30,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1282946172, now seen corresponding path program 1 times [2023-12-05 21:09:30,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:30,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398309734] [2023-12-05 21:09:30,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:30,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:30,705 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:30,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:30,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398309734] [2023-12-05 21:09:30,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398309734] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:30,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:30,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:30,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088760470] [2023-12-05 21:09:30,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:30,707 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:30,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:30,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:30,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:30,708 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 167 [2023-12-05 21:09:30,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 154 transitions, 817 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:30,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:30,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 167 [2023-12-05 21:09:30,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:30,959 INFO L124 PetriNetUnfolderBase]: 214/795 cut-off events. [2023-12-05 21:09:30,959 INFO L125 PetriNetUnfolderBase]: For 1091/1221 co-relation queries the response was YES. [2023-12-05 21:09:30,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3037 conditions, 795 events. 214/795 cut-off events. For 1091/1221 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4646 event pairs, 19 based on Foata normal form. 2/683 useless extension candidates. Maximal degree in co-relation 2919. Up to 326 conditions per place. [2023-12-05 21:09:30,972 INFO L140 encePairwiseOnDemand]: 164/167 looper letters, 55 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2023-12-05 21:09:30,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 163 transitions, 1043 flow [2023-12-05 21:09:30,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:30,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:30,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-12-05 21:09:30,975 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7305389221556886 [2023-12-05 21:09:30,975 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-12-05 21:09:30,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-12-05 21:09:30,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:30,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-12-05 21:09:30,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 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:30,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 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:30,979 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 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:30,981 INFO L308 CegarLoopForPetriNet]: 171 programPoint places, -12 predicate places. [2023-12-05 21:09:30,981 INFO L500 AbstractCegarLoop]: Abstraction has has 159 places, 163 transitions, 1043 flow [2023-12-05 21:09:30,982 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:30,982 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:30,982 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:30,982 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:09:30,982 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-05 21:09:30,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:30,983 INFO L85 PathProgramCache]: Analyzing trace with hash 619833242, now seen corresponding path program 1 times [2023-12-05 21:09:30,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:30,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024819522] [2023-12-05 21:09:30,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:30,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:31,054 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:31,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:31,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024819522] [2023-12-05 21:09:31,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024819522] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:31,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:31,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:31,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283213882] [2023-12-05 21:09:31,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:31,058 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:31,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:31,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:31,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:31,061 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 167 [2023-12-05 21:09:31,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 163 transitions, 1043 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:31,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:31,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 167 [2023-12-05 21:09:31,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:31,319 INFO L124 PetriNetUnfolderBase]: 246/870 cut-off events. [2023-12-05 21:09:31,319 INFO L125 PetriNetUnfolderBase]: For 1926/1998 co-relation queries the response was YES. [2023-12-05 21:09:31,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3736 conditions, 870 events. 246/870 cut-off events. For 1926/1998 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5169 event pairs, 29 based on Foata normal form. 2/743 useless extension candidates. Maximal degree in co-relation 3609. Up to 368 conditions per place. [2023-12-05 21:09:31,329 INFO L140 encePairwiseOnDemand]: 164/167 looper letters, 60 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2023-12-05 21:09:31,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 163 transitions, 1173 flow [2023-12-05 21:09:31,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:31,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:31,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-12-05 21:09:31,331 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7105788423153693 [2023-12-05 21:09:31,331 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-12-05 21:09:31,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-12-05 21:09:31,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:31,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-12-05 21:09:31,332 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:31,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 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:31,334 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 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:31,334 INFO L308 CegarLoopForPetriNet]: 171 programPoint places, -11 predicate places. [2023-12-05 21:09:31,334 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 163 transitions, 1173 flow [2023-12-05 21:09:31,335 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:31,335 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:31,335 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:31,335 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:09:31,335 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-05 21:09:31,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:31,336 INFO L85 PathProgramCache]: Analyzing trace with hash 619833243, now seen corresponding path program 1 times [2023-12-05 21:09:31,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:31,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685921612] [2023-12-05 21:09:31,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:31,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:31,425 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:31,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:31,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685921612] [2023-12-05 21:09:31,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685921612] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:31,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:31,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:31,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394902458] [2023-12-05 21:09:31,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:31,427 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:31,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:31,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:31,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:31,429 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 167 [2023-12-05 21:09:31,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 163 transitions, 1173 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:31,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:31,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 167 [2023-12-05 21:09:31,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:31,687 INFO L124 PetriNetUnfolderBase]: 245/842 cut-off events. [2023-12-05 21:09:31,688 INFO L125 PetriNetUnfolderBase]: For 2611/2695 co-relation queries the response was YES. [2023-12-05 21:09:31,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4093 conditions, 842 events. 245/842 cut-off events. For 2611/2695 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4980 event pairs, 19 based on Foata normal form. 2/715 useless extension candidates. Maximal degree in co-relation 3958. Up to 368 conditions per place. [2023-12-05 21:09:31,696 INFO L140 encePairwiseOnDemand]: 164/167 looper letters, 63 selfloop transitions, 2 changer transitions 2/172 dead transitions. [2023-12-05 21:09:31,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 172 transitions, 1457 flow [2023-12-05 21:09:31,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:31,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:31,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-12-05 21:09:31,699 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7285429141716567 [2023-12-05 21:09:31,699 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-12-05 21:09:31,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-12-05 21:09:31,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:31,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-12-05 21:09:31,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:31,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 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:31,702 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 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:31,702 INFO L308 CegarLoopForPetriNet]: 171 programPoint places, -10 predicate places. [2023-12-05 21:09:31,703 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 172 transitions, 1457 flow [2023-12-05 21:09:31,703 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:31,703 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:31,703 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:31,703 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:09:31,703 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-05 21:09:31,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:31,704 INFO L85 PathProgramCache]: Analyzing trace with hash -138802294, now seen corresponding path program 1 times [2023-12-05 21:09:31,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:31,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981311825] [2023-12-05 21:09:31,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:31,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:31,810 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:31,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:31,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981311825] [2023-12-05 21:09:31,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981311825] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:31,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:31,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:31,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178285824] [2023-12-05 21:09:31,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:31,812 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:31,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:31,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:31,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:31,813 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 167 [2023-12-05 21:09:31,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 172 transitions, 1457 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:31,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:31,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 167 [2023-12-05 21:09:31,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:32,011 INFO L124 PetriNetUnfolderBase]: 235/828 cut-off events. [2023-12-05 21:09:32,011 INFO L125 PetriNetUnfolderBase]: For 3156/3252 co-relation queries the response was YES. [2023-12-05 21:09:32,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4238 conditions, 828 events. 235/828 cut-off events. For 3156/3252 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4916 event pairs, 15 based on Foata normal form. 0/705 useless extension candidates. Maximal degree in co-relation 4100. Up to 368 conditions per place. [2023-12-05 21:09:32,021 INFO L140 encePairwiseOnDemand]: 163/167 looper letters, 61 selfloop transitions, 11 changer transitions 11/202 dead transitions. [2023-12-05 21:09:32,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 202 transitions, 2169 flow [2023-12-05 21:09:32,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:32,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:32,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2023-12-05 21:09:32,023 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8063872255489022 [2023-12-05 21:09:32,023 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 404 transitions. [2023-12-05 21:09:32,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions. [2023-12-05 21:09:32,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:32,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions. [2023-12-05 21:09:32,024 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:32,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 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:32,025 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 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:32,026 INFO L308 CegarLoopForPetriNet]: 171 programPoint places, -8 predicate places. [2023-12-05 21:09:32,026 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 202 transitions, 2169 flow [2023-12-05 21:09:32,026 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:32,026 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:32,027 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:32,027 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:09:32,027 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-05 21:09:32,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:32,027 INFO L85 PathProgramCache]: Analyzing trace with hash -530742055, now seen corresponding path program 1 times [2023-12-05 21:09:32,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:32,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691779758] [2023-12-05 21:09:32,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:32,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:32,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:32,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691779758] [2023-12-05 21:09:32,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691779758] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:32,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:32,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:09:32,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82045575] [2023-12-05 21:09:32,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:32,133 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:09:32,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:32,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:09:32,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:09:32,134 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 167 [2023-12-05 21:09:32,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 202 transitions, 2169 flow. Second operand has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:32,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:32,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 167 [2023-12-05 21:09:32,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:32,402 INFO L124 PetriNetUnfolderBase]: 233/823 cut-off events. [2023-12-05 21:09:32,402 INFO L125 PetriNetUnfolderBase]: For 3948/4056 co-relation queries the response was YES. [2023-12-05 21:09:32,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4548 conditions, 823 events. 233/823 cut-off events. For 3948/4056 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4888 event pairs, 13 based on Foata normal form. 0/703 useless extension candidates. Maximal degree in co-relation 4399. Up to 368 conditions per place. [2023-12-05 21:09:32,437 INFO L140 encePairwiseOnDemand]: 160/167 looper letters, 81 selfloop transitions, 16 changer transitions 11/210 dead transitions. [2023-12-05 21:09:32,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 210 transitions, 2497 flow [2023-12-05 21:09:32,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:09:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:09:32,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2023-12-05 21:09:32,442 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7215568862275449 [2023-12-05 21:09:32,442 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2023-12-05 21:09:32,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2023-12-05 21:09:32,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:32,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2023-12-05 21:09:32,443 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:32,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 0 states have call successors, (0), 0 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:32,445 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 0 states have call successors, (0), 0 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:32,446 INFO L308 CegarLoopForPetriNet]: 171 programPoint places, -6 predicate places. [2023-12-05 21:09:32,446 INFO L500 AbstractCegarLoop]: Abstraction has has 165 places, 210 transitions, 2497 flow [2023-12-05 21:09:32,446 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:32,446 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:32,446 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:32,447 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:09:32,447 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-05 21:09:32,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:32,447 INFO L85 PathProgramCache]: Analyzing trace with hash -530742054, now seen corresponding path program 1 times [2023-12-05 21:09:32,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:32,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567487189] [2023-12-05 21:09:32,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:32,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:32,720 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:32,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:32,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567487189] [2023-12-05 21:09:32,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567487189] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:32,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:32,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:09:32,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435358616] [2023-12-05 21:09:32,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:32,722 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:09:32,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:32,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:09:32,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:09:32,724 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 167 [2023-12-05 21:09:32,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 210 transitions, 2497 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:32,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:32,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 167 [2023-12-05 21:09:32,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:32,983 INFO L124 PetriNetUnfolderBase]: 231/818 cut-off events. [2023-12-05 21:09:32,983 INFO L125 PetriNetUnfolderBase]: For 4787/4907 co-relation queries the response was YES. [2023-12-05 21:09:32,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4785 conditions, 818 events. 231/818 cut-off events. For 4787/4907 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4864 event pairs, 11 based on Foata normal form. 0/701 useless extension candidates. Maximal degree in co-relation 4626. Up to 368 conditions per place. [2023-12-05 21:09:32,993 INFO L140 encePairwiseOnDemand]: 164/167 looper letters, 73 selfloop transitions, 11 changer transitions 12/209 dead transitions. [2023-12-05 21:09:32,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 209 transitions, 2667 flow [2023-12-05 21:09:32,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:09:32,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:09:32,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2023-12-05 21:09:32,995 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7275449101796407 [2023-12-05 21:09:32,995 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 486 transitions. [2023-12-05 21:09:32,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 486 transitions. [2023-12-05 21:09:32,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:32,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 486 transitions. [2023-12-05 21:09:32,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 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:32,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 0 states have call successors, (0), 0 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:32,998 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 0 states have call successors, (0), 0 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:32,999 INFO L308 CegarLoopForPetriNet]: 171 programPoint places, -4 predicate places. [2023-12-05 21:09:32,999 INFO L500 AbstractCegarLoop]: Abstraction has has 167 places, 209 transitions, 2667 flow [2023-12-05 21:09:32,999 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:32,999 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:33,000 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:33,000 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:09:33,000 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-05 21:09:33,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:33,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1162520879, now seen corresponding path program 1 times [2023-12-05 21:09:33,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:33,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885509786] [2023-12-05 21:09:33,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:33,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:33,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:33,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:33,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885509786] [2023-12-05 21:09:33,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885509786] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:33,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:33,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:09:33,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454121604] [2023-12-05 21:09:33,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:33,175 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:09:33,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:33,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:09:33,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:09:33,176 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 167 [2023-12-05 21:09:33,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 209 transitions, 2667 flow. Second operand has 7 states, 7 states have (on average 107.85714285714286) internal successors, (755), 7 states have internal predecessors, (755), 0 states have call successors, (0), 0 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:33,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:33,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 167 [2023-12-05 21:09:33,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:33,487 INFO L124 PetriNetUnfolderBase]: 189/706 cut-off events. [2023-12-05 21:09:33,488 INFO L125 PetriNetUnfolderBase]: For 5408/5540 co-relation queries the response was YES. [2023-12-05 21:09:33,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4393 conditions, 706 events. 189/706 cut-off events. For 5408/5540 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3888 event pairs, 11 based on Foata normal form. 0/619 useless extension candidates. Maximal degree in co-relation 4223. Up to 309 conditions per place. [2023-12-05 21:09:33,498 INFO L140 encePairwiseOnDemand]: 154/167 looper letters, 77 selfloop transitions, 22 changer transitions 14/211 dead transitions. [2023-12-05 21:09:33,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 211 transitions, 2941 flow [2023-12-05 21:09:33,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 21:09:33,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 21:09:33,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 679 transitions. [2023-12-05 21:09:33,500 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6776447105788423 [2023-12-05 21:09:33,500 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 679 transitions. [2023-12-05 21:09:33,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 679 transitions. [2023-12-05 21:09:33,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:33,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 679 transitions. [2023-12-05 21:09:33,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 0 states have call successors, (0), 0 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:33,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 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:33,505 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 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:33,505 INFO L308 CegarLoopForPetriNet]: 171 programPoint places, 1 predicate places. [2023-12-05 21:09:33,505 INFO L500 AbstractCegarLoop]: Abstraction has has 172 places, 211 transitions, 2941 flow [2023-12-05 21:09:33,506 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.85714285714286) internal successors, (755), 7 states have internal predecessors, (755), 0 states have call successors, (0), 0 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:33,506 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:33,506 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:33,506 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:09:33,506 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-05 21:09:33,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:33,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1145743723, now seen corresponding path program 1 times [2023-12-05 21:09:33,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:33,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646514749] [2023-12-05 21:09:33,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:33,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:33,989 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:33,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:33,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646514749] [2023-12-05 21:09:33,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646514749] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:33,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:33,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-05 21:09:33,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82941126] [2023-12-05 21:09:33,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:33,990 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-05 21:09:33,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:33,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-05 21:09:33,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-05 21:09:33,992 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 167 [2023-12-05 21:09:33,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 211 transitions, 2941 flow. Second operand has 12 states, 12 states have (on average 103.0) internal successors, (1236), 12 states have internal predecessors, (1236), 0 states have call successors, (0), 0 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:33,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:33,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 167 [2023-12-05 21:09:33,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:34,444 INFO L124 PetriNetUnfolderBase]: 170/751 cut-off events. [2023-12-05 21:09:34,444 INFO L125 PetriNetUnfolderBase]: For 6373/6611 co-relation queries the response was YES. [2023-12-05 21:09:34,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4674 conditions, 751 events. 170/751 cut-off events. For 6373/6611 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4243 event pairs, 15 based on Foata normal form. 2/684 useless extension candidates. Maximal degree in co-relation 4491. Up to 283 conditions per place. [2023-12-05 21:09:34,452 INFO L140 encePairwiseOnDemand]: 149/167 looper letters, 87 selfloop transitions, 40 changer transitions 23/245 dead transitions. [2023-12-05 21:09:34,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 245 transitions, 3945 flow [2023-12-05 21:09:34,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-05 21:09:34,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-12-05 21:09:34,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1414 transitions. [2023-12-05 21:09:34,456 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6513127590971902 [2023-12-05 21:09:34,456 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1414 transitions. [2023-12-05 21:09:34,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1414 transitions. [2023-12-05 21:09:34,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:34,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1414 transitions. [2023-12-05 21:09:34,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 108.76923076923077) internal successors, (1414), 13 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:34,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 167.0) internal successors, (2338), 14 states have internal predecessors, (2338), 0 states have call successors, (0), 0 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:34,465 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 167.0) internal successors, (2338), 14 states have internal predecessors, (2338), 0 states have call successors, (0), 0 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:34,465 INFO L308 CegarLoopForPetriNet]: 171 programPoint places, 13 predicate places. [2023-12-05 21:09:34,465 INFO L500 AbstractCegarLoop]: Abstraction has has 184 places, 245 transitions, 3945 flow [2023-12-05 21:09:34,466 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 103.0) internal successors, (1236), 12 states have internal predecessors, (1236), 0 states have call successors, (0), 0 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:34,466 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:34,466 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:34,466 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:09:34,466 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-05 21:09:34,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:34,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1552024769, now seen corresponding path program 1 times [2023-12-05 21:09:34,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:34,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106249504] [2023-12-05 21:09:34,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:34,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:35,063 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:35,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:35,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106249504] [2023-12-05 21:09:35,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106249504] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:35,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:35,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-05 21:09:35,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737040201] [2023-12-05 21:09:35,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:35,065 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:09:35,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:35,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:09:35,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:09:35,066 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 167 [2023-12-05 21:09:35,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 245 transitions, 3945 flow. Second operand has 11 states, 11 states have (on average 103.18181818181819) internal successors, (1135), 11 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:35,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:35,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 167 [2023-12-05 21:09:35,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:35,352 INFO L124 PetriNetUnfolderBase]: 118/583 cut-off events. [2023-12-05 21:09:35,352 INFO L125 PetriNetUnfolderBase]: For 5909/6163 co-relation queries the response was YES. [2023-12-05 21:09:35,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3656 conditions, 583 events. 118/583 cut-off events. For 5909/6163 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2804 event pairs, 12 based on Foata normal form. 0/565 useless extension candidates. Maximal degree in co-relation 3462. Up to 177 conditions per place. [2023-12-05 21:09:35,357 INFO L140 encePairwiseOnDemand]: 155/167 looper letters, 0 selfloop transitions, 0 changer transitions 228/228 dead transitions. [2023-12-05 21:09:35,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 228 transitions, 3733 flow [2023-12-05 21:09:35,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 21:09:35,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 21:09:35,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 959 transitions. [2023-12-05 21:09:35,360 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6380572188955422 [2023-12-05 21:09:35,360 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 959 transitions. [2023-12-05 21:09:35,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 959 transitions. [2023-12-05 21:09:35,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:35,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 959 transitions. [2023-12-05 21:09:35,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 106.55555555555556) internal successors, (959), 9 states have internal predecessors, (959), 0 states have call successors, (0), 0 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:35,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 167.0) internal successors, (1670), 10 states have internal predecessors, (1670), 0 states have call successors, (0), 0 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:35,365 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 167.0) internal successors, (1670), 10 states have internal predecessors, (1670), 0 states have call successors, (0), 0 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:35,365 INFO L308 CegarLoopForPetriNet]: 171 programPoint places, 17 predicate places. [2023-12-05 21:09:35,366 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 228 transitions, 3733 flow [2023-12-05 21:09:35,366 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 103.18181818181819) internal successors, (1135), 11 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:35,378 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe014_power.oepc.i_BEv2_AllErrorsAtOnce [2023-12-05 21:09:35,411 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 59 remaining) [2023-12-05 21:09:35,411 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 59 remaining) [2023-12-05 21:09:35,411 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 59 remaining) [2023-12-05 21:09:35,412 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 59 remaining) [2023-12-05 21:09:35,412 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 59 remaining) [2023-12-05 21:09:35,412 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 59 remaining) [2023-12-05 21:09:35,412 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 59 remaining) [2023-12-05 21:09:35,412 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 59 remaining) [2023-12-05 21:09:35,412 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 59 remaining) [2023-12-05 21:09:35,412 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 59 remaining) [2023-12-05 21:09:35,412 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 59 remaining) [2023-12-05 21:09:35,412 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 59 remaining) [2023-12-05 21:09:35,412 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 59 remaining) [2023-12-05 21:09:35,413 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 59 remaining) [2023-12-05 21:09:35,413 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 59 remaining) [2023-12-05 21:09:35,413 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 59 remaining) [2023-12-05 21:09:35,413 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 59 remaining) [2023-12-05 21:09:35,413 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 59 remaining) [2023-12-05 21:09:35,413 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 59 remaining) [2023-12-05 21:09:35,413 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 59 remaining) [2023-12-05 21:09:35,413 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 59 remaining) [2023-12-05 21:09:35,413 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 59 remaining) [2023-12-05 21:09:35,413 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 59 remaining) [2023-12-05 21:09:35,413 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 59 remaining) [2023-12-05 21:09:35,414 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 59 remaining) [2023-12-05 21:09:35,414 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 59 remaining) [2023-12-05 21:09:35,414 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 59 remaining) [2023-12-05 21:09:35,414 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 59 remaining) [2023-12-05 21:09:35,414 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 59 remaining) [2023-12-05 21:09:35,414 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 59 remaining) [2023-12-05 21:09:35,414 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 59 remaining) [2023-12-05 21:09:35,414 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 59 remaining) [2023-12-05 21:09:35,414 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 59 remaining) [2023-12-05 21:09:35,414 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 59 remaining) [2023-12-05 21:09:35,414 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 59 remaining) [2023-12-05 21:09:35,415 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 59 remaining) [2023-12-05 21:09:35,415 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 59 remaining) [2023-12-05 21:09:35,415 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 59 remaining) [2023-12-05 21:09:35,415 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 59 remaining) [2023-12-05 21:09:35,415 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 59 remaining) [2023-12-05 21:09:35,415 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 59 remaining) [2023-12-05 21:09:35,415 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 59 remaining) [2023-12-05 21:09:35,415 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 59 remaining) [2023-12-05 21:09:35,415 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 59 remaining) [2023-12-05 21:09:35,415 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 59 remaining) [2023-12-05 21:09:35,416 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 59 remaining) [2023-12-05 21:09:35,416 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 59 remaining) [2023-12-05 21:09:35,416 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 59 remaining) [2023-12-05 21:09:35,416 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 59 remaining) [2023-12-05 21:09:35,416 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 59 remaining) [2023-12-05 21:09:35,416 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 59 remaining) [2023-12-05 21:09:35,416 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 59 remaining) [2023-12-05 21:09:35,416 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 59 remaining) [2023-12-05 21:09:35,416 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 59 remaining) [2023-12-05 21:09:35,416 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 59 remaining) [2023-12-05 21:09:35,416 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 59 remaining) [2023-12-05 21:09:35,417 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 59 remaining) [2023-12-05 21:09:35,417 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 59 remaining) [2023-12-05 21:09:35,417 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 59 remaining) [2023-12-05 21:09:35,417 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:09:35,417 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:35,422 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:09:35,422 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:09:35,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:09:35 BasicIcfg [2023-12-05 21:09:35,427 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:09:35,428 INFO L158 Benchmark]: Toolchain (without parser) took 10379.83ms. Allocated memory was 320.9MB in the beginning and 745.5MB in the end (delta: 424.7MB). Free memory was 267.0MB in the beginning and 401.4MB in the end (delta: -134.3MB). Peak memory consumption was 290.3MB. Max. memory is 8.0GB. [2023-12-05 21:09:35,428 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 195.0MB. Free memory was 145.8MB in the beginning and 145.7MB in the end (delta: 119.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:09:35,428 INFO L158 Benchmark]: CACSL2BoogieTranslator took 580.80ms. Allocated memory is still 320.9MB. Free memory was 266.5MB in the beginning and 242.9MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-12-05 21:09:35,428 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.65ms. Allocated memory is still 320.9MB. Free memory was 242.9MB in the beginning and 240.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-05 21:09:35,428 INFO L158 Benchmark]: Boogie Preprocessor took 47.83ms. Allocated memory is still 320.9MB. Free memory was 240.3MB in the beginning and 238.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:09:35,429 INFO L158 Benchmark]: RCFGBuilder took 1143.28ms. Allocated memory is still 320.9MB. Free memory was 238.2MB in the beginning and 218.3MB in the end (delta: 20.0MB). Peak memory consumption was 60.8MB. Max. memory is 8.0GB. [2023-12-05 21:09:35,429 INFO L158 Benchmark]: TraceAbstraction took 8524.74ms. Allocated memory was 320.9MB in the beginning and 745.5MB in the end (delta: 424.7MB). Free memory was 217.2MB in the beginning and 401.4MB in the end (delta: -184.2MB). Peak memory consumption was 238.9MB. Max. memory is 8.0GB. [2023-12-05 21:09:35,430 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.15ms. Allocated memory is still 195.0MB. Free memory was 145.8MB in the beginning and 145.7MB in the end (delta: 119.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 580.80ms. Allocated memory is still 320.9MB. Free memory was 266.5MB in the beginning and 242.9MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 74.65ms. Allocated memory is still 320.9MB. Free memory was 242.9MB in the beginning and 240.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.83ms. Allocated memory is still 320.9MB. Free memory was 240.3MB in the beginning and 238.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1143.28ms. Allocated memory is still 320.9MB. Free memory was 238.2MB in the beginning and 218.3MB in the end (delta: 20.0MB). Peak memory consumption was 60.8MB. Max. memory is 8.0GB. * TraceAbstraction took 8524.74ms. Allocated memory was 320.9MB in the beginning and 745.5MB in the end (delta: 424.7MB). Free memory was 217.2MB in the beginning and 401.4MB in the end (delta: -184.2MB). Peak memory consumption was 238.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - 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, 214 locations, 59 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: 8.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 404 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 404 mSDsluCounter, 238 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 96 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1085 IncrementalHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 142 mSDtfsCounter, 1085 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3945occurred in iteration=13, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1042 NumberOfCodeBlocks, 1042 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1028 ConstructedInterpolants, 0 QuantifiedInterpolants, 4585 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 34 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:09:35,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...