/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/safe009_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:09:04,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:09:04,144 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:04,170 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:09:04,171 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:09:04,171 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:09:04,172 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:09:04,172 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:09:04,172 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:09:04,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:09:04,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:09:04,175 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:09:04,176 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:09:04,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:09:04,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:09:04,177 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:09:04,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:09:04,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:09:04,177 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:09:04,177 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:09:04,178 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:09:04,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:09:04,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:09:04,178 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:09:04,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:09:04,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:09:04,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:09:04,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:09:04,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:09:04,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:09:04,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:09:04,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:09:04,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:09:04,181 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:04,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:09:04,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:09:04,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:09:04,392 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:09:04,392 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:09:04,393 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe009_power.oepc.i [2023-12-05 21:09:05,457 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:09:05,720 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:09:05,720 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_power.oepc.i [2023-12-05 21:09:05,736 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a14618e77/0f181697a2e043b5b5613f82df797989/FLAGf016882e0 [2023-12-05 21:09:05,749 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a14618e77/0f181697a2e043b5b5613f82df797989 [2023-12-05 21:09:05,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:09:05,752 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:09:05,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:09:05,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:09:05,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:09:05,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:09:05" (1/1) ... [2023-12-05 21:09:05,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39f3875e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:05, skipping insertion in model container [2023-12-05 21:09:05,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:09:05" (1/1) ... [2023-12-05 21:09:05,813 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:09:06,079 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:09:06,089 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:09:06,158 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:09:06,186 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:09:06,186 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:09:06,191 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:09:06,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:06 WrapperNode [2023-12-05 21:09:06,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:09:06,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:09:06,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:09:06,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:09:06,197 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:06" (1/1) ... [2023-12-05 21:09:06,215 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:06" (1/1) ... [2023-12-05 21:09:06,253 INFO L138 Inliner]: procedures = 176, calls = 77, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 171 [2023-12-05 21:09:06,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:09:06,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:09:06,255 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:09:06,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:09:06,261 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:06" (1/1) ... [2023-12-05 21:09:06,261 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:06" (1/1) ... [2023-12-05 21:09:06,274 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:06" (1/1) ... [2023-12-05 21:09:06,275 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:06" (1/1) ... [2023-12-05 21:09:06,284 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:06" (1/1) ... [2023-12-05 21:09:06,286 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:06" (1/1) ... [2023-12-05 21:09:06,288 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:06" (1/1) ... [2023-12-05 21:09:06,290 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:06" (1/1) ... [2023-12-05 21:09:06,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:09:06,311 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:09:06,311 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:09:06,311 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:09:06,311 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:06" (1/1) ... [2023-12-05 21:09:06,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:09:06,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:09:06,347 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:06,359 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:06,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:09:06,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:09:06,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:09:06,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:09:06,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:09:06,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:09:06,405 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-05 21:09:06,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-05 21:09:06,405 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-05 21:09:06,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-05 21:09:06,405 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-05 21:09:06,406 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-05 21:09:06,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:09:06,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:09:06,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:09:06,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:09:06,410 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:06,580 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:09:06,582 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:09:06,958 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:09:07,390 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:09:07,390 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:09:07,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:09:07 BoogieIcfgContainer [2023-12-05 21:09:07,391 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:09:07,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:09:07,393 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:09:07,395 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:09:07,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:09:05" (1/3) ... [2023-12-05 21:09:07,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e98637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:09:07, skipping insertion in model container [2023-12-05 21:09:07,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:06" (2/3) ... [2023-12-05 21:09:07,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e98637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:09:07, skipping insertion in model container [2023-12-05 21:09:07,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:09:07" (3/3) ... [2023-12-05 21:09:07,398 INFO L112 eAbstractionObserver]: Analyzing ICFG safe009_power.oepc.i [2023-12-05 21:09:07,412 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:09:07,412 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2023-12-05 21:09:07,412 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:09:07,528 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:09:07,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 183 transitions, 378 flow [2023-12-05 21:09:07,647 INFO L124 PetriNetUnfolderBase]: 3/180 cut-off events. [2023-12-05 21:09:07,647 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:09:07,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 180 events. 3/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 307 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 125. Up to 2 conditions per place. [2023-12-05 21:09:07,654 INFO L82 GeneralOperation]: Start removeDead. Operand has 190 places, 183 transitions, 378 flow [2023-12-05 21:09:07,663 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 180 transitions, 369 flow [2023-12-05 21:09:07,674 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:09:07,682 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;@5fee37df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:09:07,682 INFO L363 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2023-12-05 21:09:07,692 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:09:07,692 INFO L124 PetriNetUnfolderBase]: 0/56 cut-off events. [2023-12-05 21:09:07,692 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:09:07,692 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:07,693 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] [2023-12-05 21:09:07,693 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-12-05 21:09:07,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:07,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1439173522, now seen corresponding path program 1 times [2023-12-05 21:09:07,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:07,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240479537] [2023-12-05 21:09:07,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:07,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:08,044 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:08,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:08,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240479537] [2023-12-05 21:09:08,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240479537] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:08,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:08,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:08,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125259289] [2023-12-05 21:09:08,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:08,055 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:08,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:08,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:08,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:08,081 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 183 [2023-12-05 21:09:08,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 180 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 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:08,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:08,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 183 [2023-12-05 21:09:08,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:11,891 INFO L124 PetriNetUnfolderBase]: 13029/24112 cut-off events. [2023-12-05 21:09:11,891 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-12-05 21:09:11,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42580 conditions, 24112 events. 13029/24112 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 1942. Compared 220345 event pairs, 8934 based on Foata normal form. 684/11829 useless extension candidates. Maximal degree in co-relation 42506. Up to 12661 conditions per place. [2023-12-05 21:09:12,094 INFO L140 encePairwiseOnDemand]: 153/183 looper letters, 68 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2023-12-05 21:09:12,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 168 transitions, 485 flow [2023-12-05 21:09:12,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:12,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:12,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-12-05 21:09:12,104 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7668488160291439 [2023-12-05 21:09:12,105 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-12-05 21:09:12,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-12-05 21:09:12,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:12,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-12-05 21:09:12,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:12,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:12,114 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:12,116 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, -26 predicate places. [2023-12-05 21:09:12,117 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 168 transitions, 485 flow [2023-12-05 21:09:12,117 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:12,117 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:12,117 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] [2023-12-05 21:09:12,117 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:09:12,117 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-12-05 21:09:12,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:12,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1439173521, now seen corresponding path program 1 times [2023-12-05 21:09:12,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:12,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370258054] [2023-12-05 21:09:12,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:12,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:12,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:12,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:12,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370258054] [2023-12-05 21:09:12,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370258054] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:12,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:12,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:12,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465957328] [2023-12-05 21:09:12,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:12,208 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:12,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:12,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:12,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:12,213 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 183 [2023-12-05 21:09:12,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 168 transitions, 485 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:12,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:12,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 183 [2023-12-05 21:09:12,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:15,846 INFO L124 PetriNetUnfolderBase]: 13091/24225 cut-off events. [2023-12-05 21:09:15,846 INFO L125 PetriNetUnfolderBase]: For 1531/4147 co-relation queries the response was YES. [2023-12-05 21:09:15,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60548 conditions, 24225 events. 13091/24225 cut-off events. For 1531/4147 co-relation queries the response was YES. Maximal size of possible extension queue 1942. Compared 221639 event pairs, 8996 based on Foata normal form. 0/11249 useless extension candidates. Maximal degree in co-relation 60468. Up to 13865 conditions per place. [2023-12-05 21:09:16,082 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 83 selfloop transitions, 2 changer transitions 0/186 dead transitions. [2023-12-05 21:09:16,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 186 transitions, 727 flow [2023-12-05 21:09:16,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:16,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2023-12-05 21:09:16,086 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7012750455373407 [2023-12-05 21:09:16,087 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2023-12-05 21:09:16,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2023-12-05 21:09:16,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:16,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2023-12-05 21:09:16,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:16,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:16,091 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:16,091 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, -25 predicate places. [2023-12-05 21:09:16,091 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 186 transitions, 727 flow [2023-12-05 21:09:16,092 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:16,092 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:16,092 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] [2023-12-05 21:09:16,092 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:09:16,093 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-12-05 21:09:16,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:16,093 INFO L85 PathProgramCache]: Analyzing trace with hash -2053888553, now seen corresponding path program 1 times [2023-12-05 21:09:16,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:16,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696209332] [2023-12-05 21:09:16,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:16,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:16,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:16,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:16,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696209332] [2023-12-05 21:09:16,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696209332] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:16,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:16,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:09:16,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791186099] [2023-12-05 21:09:16,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:16,390 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:09:16,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:16,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:09:16,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:09:16,394 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 183 [2023-12-05 21:09:16,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 186 transitions, 727 flow. Second operand has 6 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:16,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:16,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 183 [2023-12-05 21:09:16,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:18,812 INFO L124 PetriNetUnfolderBase]: 7744/15857 cut-off events. [2023-12-05 21:09:18,812 INFO L125 PetriNetUnfolderBase]: For 2905/4519 co-relation queries the response was YES. [2023-12-05 21:09:18,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49455 conditions, 15857 events. 7744/15857 cut-off events. For 2905/4519 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 149509 event pairs, 2135 based on Foata normal form. 0/9672 useless extension candidates. Maximal degree in co-relation 49364. Up to 8561 conditions per place. [2023-12-05 21:09:18,911 INFO L140 encePairwiseOnDemand]: 162/183 looper letters, 91 selfloop transitions, 17 changer transitions 0/204 dead transitions. [2023-12-05 21:09:18,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 204 transitions, 1047 flow [2023-12-05 21:09:18,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:09:18,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:09:18,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 839 transitions. [2023-12-05 21:09:18,913 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6549570647931303 [2023-12-05 21:09:18,913 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 839 transitions. [2023-12-05 21:09:18,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 839 transitions. [2023-12-05 21:09:18,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:18,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 839 transitions. [2023-12-05 21:09:18,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 0 states have call successors, (0), 0 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:18,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 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:18,918 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 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:18,919 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, -22 predicate places. [2023-12-05 21:09:18,919 INFO L500 AbstractCegarLoop]: Abstraction has has 165 places, 204 transitions, 1047 flow [2023-12-05 21:09:18,919 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 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:18,919 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:18,919 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] [2023-12-05 21:09:18,919 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:09:18,920 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-12-05 21:09:18,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:18,920 INFO L85 PathProgramCache]: Analyzing trace with hash -2053888552, now seen corresponding path program 1 times [2023-12-05 21:09:18,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:18,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717249579] [2023-12-05 21:09:18,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:18,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:19,056 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:19,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:19,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717249579] [2023-12-05 21:09:19,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717249579] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:19,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:19,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:09:19,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883157032] [2023-12-05 21:09:19,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:19,058 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:09:19,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:19,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:09:19,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:09:19,059 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 183 [2023-12-05 21:09:19,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 204 transitions, 1047 flow. Second operand has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:19,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:19,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 183 [2023-12-05 21:09:19,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:19,731 INFO L124 PetriNetUnfolderBase]: 1662/4230 cut-off events. [2023-12-05 21:09:19,731 INFO L125 PetriNetUnfolderBase]: For 1982/2390 co-relation queries the response was YES. [2023-12-05 21:09:19,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13979 conditions, 4230 events. 1662/4230 cut-off events. For 1982/2390 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 36709 event pairs, 242 based on Foata normal form. 0/3427 useless extension candidates. Maximal degree in co-relation 13879. Up to 2400 conditions per place. [2023-12-05 21:09:19,749 INFO L140 encePairwiseOnDemand]: 171/183 looper letters, 57 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2023-12-05 21:09:19,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 166 transitions, 861 flow [2023-12-05 21:09:19,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:09:19,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:09:19,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 478 transitions. [2023-12-05 21:09:19,753 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6530054644808743 [2023-12-05 21:09:19,753 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 478 transitions. [2023-12-05 21:09:19,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 478 transitions. [2023-12-05 21:09:19,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:19,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 478 transitions. [2023-12-05 21:09:19,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:19,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 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:19,757 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 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:19,759 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, -29 predicate places. [2023-12-05 21:09:19,759 INFO L500 AbstractCegarLoop]: Abstraction has has 158 places, 166 transitions, 861 flow [2023-12-05 21:09:19,759 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:19,759 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:19,760 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] [2023-12-05 21:09:19,760 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:09:19,760 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-12-05 21:09:19,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:19,760 INFO L85 PathProgramCache]: Analyzing trace with hash -225460376, now seen corresponding path program 1 times [2023-12-05 21:09:19,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:19,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901914464] [2023-12-05 21:09:19,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:19,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:19,815 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:19,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:19,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901914464] [2023-12-05 21:09:19,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901914464] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:19,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:19,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:19,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929816512] [2023-12-05 21:09:19,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:19,817 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:19,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:19,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:19,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:19,819 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 183 [2023-12-05 21:09:19,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 166 transitions, 861 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 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:19,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:19,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 183 [2023-12-05 21:09:19,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:20,467 INFO L124 PetriNetUnfolderBase]: 1989/4703 cut-off events. [2023-12-05 21:09:20,467 INFO L125 PetriNetUnfolderBase]: For 4664/5242 co-relation queries the response was YES. [2023-12-05 21:09:20,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18795 conditions, 4703 events. 1989/4703 cut-off events. For 4664/5242 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 40279 event pairs, 254 based on Foata normal form. 2/3761 useless extension candidates. Maximal degree in co-relation 18686. Up to 2732 conditions per place. [2023-12-05 21:09:20,499 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 66 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2023-12-05 21:09:20,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 166 transitions, 1001 flow [2023-12-05 21:09:20,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:20,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:20,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2023-12-05 21:09:20,500 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6411657559198543 [2023-12-05 21:09:20,501 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2023-12-05 21:09:20,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2023-12-05 21:09:20,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:20,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2023-12-05 21:09:20,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 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:20,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 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:20,503 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 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:20,503 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, -28 predicate places. [2023-12-05 21:09:20,504 INFO L500 AbstractCegarLoop]: Abstraction has has 159 places, 166 transitions, 1001 flow [2023-12-05 21:09:20,504 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 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:20,504 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:20,504 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] [2023-12-05 21:09:20,504 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:09:20,504 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-12-05 21:09:20,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:20,505 INFO L85 PathProgramCache]: Analyzing trace with hash -225460375, now seen corresponding path program 1 times [2023-12-05 21:09:20,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:20,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467125105] [2023-12-05 21:09:20,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:20,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:20,553 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:20,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:20,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467125105] [2023-12-05 21:09:20,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467125105] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:20,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:20,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:20,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241129788] [2023-12-05 21:09:20,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:20,554 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:20,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:20,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:20,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:20,555 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 183 [2023-12-05 21:09:20,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 166 transitions, 1001 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 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:20,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:20,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 183 [2023-12-05 21:09:20,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:21,309 INFO L124 PetriNetUnfolderBase]: 1988/4784 cut-off events. [2023-12-05 21:09:21,309 INFO L125 PetriNetUnfolderBase]: For 6891/7791 co-relation queries the response was YES. [2023-12-05 21:09:21,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21698 conditions, 4784 events. 1988/4784 cut-off events. For 6891/7791 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 41353 event pairs, 178 based on Foata normal form. 2/3842 useless extension candidates. Maximal degree in co-relation 21581. Up to 2732 conditions per place. [2023-12-05 21:09:21,344 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 78 selfloop transitions, 2 changer transitions 0/182 dead transitions. [2023-12-05 21:09:21,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 182 transitions, 1357 flow [2023-12-05 21:09:21,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:21,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:21,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-12-05 21:09:21,345 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.663023679417122 [2023-12-05 21:09:21,345 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-12-05 21:09:21,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-12-05 21:09:21,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:21,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-12-05 21:09:21,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:21,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 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:21,347 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 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:21,348 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, -27 predicate places. [2023-12-05 21:09:21,349 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 182 transitions, 1357 flow [2023-12-05 21:09:21,349 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 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:21,349 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:21,349 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] [2023-12-05 21:09:21,349 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:09:21,349 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-12-05 21:09:21,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:21,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1613236625, now seen corresponding path program 1 times [2023-12-05 21:09:21,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:21,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218426684] [2023-12-05 21:09:21,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:21,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:21,407 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:21,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:21,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218426684] [2023-12-05 21:09:21,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218426684] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:21,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:21,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:21,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840485928] [2023-12-05 21:09:21,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:21,411 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:21,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:21,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:21,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:21,413 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 183 [2023-12-05 21:09:21,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 182 transitions, 1357 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:21,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:21,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 183 [2023-12-05 21:09:21,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:22,383 INFO L124 PetriNetUnfolderBase]: 2309/5215 cut-off events. [2023-12-05 21:09:22,383 INFO L125 PetriNetUnfolderBase]: For 13968/14448 co-relation queries the response was YES. [2023-12-05 21:09:22,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27394 conditions, 5215 events. 2309/5215 cut-off events. For 13968/14448 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 44143 event pairs, 178 based on Foata normal form. 6/4140 useless extension candidates. Maximal degree in co-relation 27268. Up to 3075 conditions per place. [2023-12-05 21:09:22,419 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 85 selfloop transitions, 2 changer transitions 0/184 dead transitions. [2023-12-05 21:09:22,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 184 transitions, 1565 flow [2023-12-05 21:09:22,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:22,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:22,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2023-12-05 21:09:22,421 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.639344262295082 [2023-12-05 21:09:22,421 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2023-12-05 21:09:22,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2023-12-05 21:09:22,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:22,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2023-12-05 21:09:22,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:22,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:22,433 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:22,433 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, -26 predicate places. [2023-12-05 21:09:22,433 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 184 transitions, 1565 flow [2023-12-05 21:09:22,434 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:22,434 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:22,434 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] [2023-12-05 21:09:22,434 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:09:22,434 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-12-05 21:09:22,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:22,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1613236626, now seen corresponding path program 1 times [2023-12-05 21:09:22,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:22,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64352793] [2023-12-05 21:09:22,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:22,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:22,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:22,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:22,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64352793] [2023-12-05 21:09:22,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64352793] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:22,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:22,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:22,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104557018] [2023-12-05 21:09:22,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:22,484 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:22,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:22,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:22,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:22,485 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 183 [2023-12-05 21:09:22,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 184 transitions, 1565 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:22,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:22,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 183 [2023-12-05 21:09:22,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:23,293 INFO L124 PetriNetUnfolderBase]: 2302/5128 cut-off events. [2023-12-05 21:09:23,293 INFO L125 PetriNetUnfolderBase]: For 18287/18553 co-relation queries the response was YES. [2023-12-05 21:09:23,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30375 conditions, 5128 events. 2302/5128 cut-off events. For 18287/18553 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 43543 event pairs, 102 based on Foata normal form. 6/4053 useless extension candidates. Maximal degree in co-relation 30241. Up to 3075 conditions per place. [2023-12-05 21:09:23,340 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 97 selfloop transitions, 2 changer transitions 0/200 dead transitions. [2023-12-05 21:09:23,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 200 transitions, 2025 flow [2023-12-05 21:09:23,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:23,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:23,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-12-05 21:09:23,342 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6612021857923497 [2023-12-05 21:09:23,342 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-12-05 21:09:23,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-12-05 21:09:23,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:23,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-12-05 21:09:23,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:23,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 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:23,344 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 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:23,346 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, -25 predicate places. [2023-12-05 21:09:23,346 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 200 transitions, 2025 flow [2023-12-05 21:09:23,346 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:23,347 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:23,347 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] [2023-12-05 21:09:23,347 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:09:23,347 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-12-05 21:09:23,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:23,347 INFO L85 PathProgramCache]: Analyzing trace with hash 639234601, now seen corresponding path program 1 times [2023-12-05 21:09:23,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:23,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777457632] [2023-12-05 21:09:23,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:23,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:23,474 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:23,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:23,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777457632] [2023-12-05 21:09:23,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777457632] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:23,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:23,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:23,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793768761] [2023-12-05 21:09:23,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:23,475 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:23,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:23,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:23,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:23,476 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 183 [2023-12-05 21:09:23,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 200 transitions, 2025 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 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:23,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:23,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 183 [2023-12-05 21:09:23,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:24,260 INFO L124 PetriNetUnfolderBase]: 2260/5088 cut-off events. [2023-12-05 21:09:24,260 INFO L125 PetriNetUnfolderBase]: For 22543/22845 co-relation queries the response was YES. [2023-12-05 21:09:24,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32363 conditions, 5088 events. 2260/5088 cut-off events. For 22543/22845 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 43298 event pairs, 90 based on Foata normal form. 0/4025 useless extension candidates. Maximal degree in co-relation 32226. Up to 3075 conditions per place. [2023-12-05 21:09:24,304 INFO L140 encePairwiseOnDemand]: 179/183 looper letters, 139 selfloop transitions, 12 changer transitions 0/266 dead transitions. [2023-12-05 21:09:24,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 266 transitions, 3521 flow [2023-12-05 21:09:24,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:24,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:24,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2023-12-05 21:09:24,306 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.73224043715847 [2023-12-05 21:09:24,306 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2023-12-05 21:09:24,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2023-12-05 21:09:24,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:24,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2023-12-05 21:09:24,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 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:24,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 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:24,308 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 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:24,308 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, -23 predicate places. [2023-12-05 21:09:24,308 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 266 transitions, 3521 flow [2023-12-05 21:09:24,309 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 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:24,309 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:24,309 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] [2023-12-05 21:09:24,309 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:09:24,309 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-12-05 21:09:24,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:24,309 INFO L85 PathProgramCache]: Analyzing trace with hash -998095240, now seen corresponding path program 1 times [2023-12-05 21:09:24,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:24,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44880836] [2023-12-05 21:09:24,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:24,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:24,404 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:24,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:24,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44880836] [2023-12-05 21:09:24,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44880836] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:24,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:24,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:09:24,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830402258] [2023-12-05 21:09:24,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:24,406 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:09:24,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:24,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:09:24,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:09:24,407 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 183 [2023-12-05 21:09:24,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 266 transitions, 3521 flow. Second operand has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 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:24,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:24,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 183 [2023-12-05 21:09:24,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:25,472 INFO L124 PetriNetUnfolderBase]: 2248/4987 cut-off events. [2023-12-05 21:09:25,472 INFO L125 PetriNetUnfolderBase]: For 29068/29408 co-relation queries the response was YES. [2023-12-05 21:09:25,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34970 conditions, 4987 events. 2248/4987 cut-off events. For 29068/29408 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 41883 event pairs, 84 based on Foata normal form. 0/3934 useless extension candidates. Maximal degree in co-relation 34822. Up to 3075 conditions per place. [2023-12-05 21:09:25,511 INFO L140 encePairwiseOnDemand]: 174/183 looper letters, 146 selfloop transitions, 30 changer transitions 0/274 dead transitions. [2023-12-05 21:09:25,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 274 transitions, 3985 flow [2023-12-05 21:09:25,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:09:25,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:09:25,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 478 transitions. [2023-12-05 21:09:25,515 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6530054644808743 [2023-12-05 21:09:25,515 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 478 transitions. [2023-12-05 21:09:25,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 478 transitions. [2023-12-05 21:09:25,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:25,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 478 transitions. [2023-12-05 21:09:25,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:25,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 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:25,517 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 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:25,518 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, -21 predicate places. [2023-12-05 21:09:25,518 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 274 transitions, 3985 flow [2023-12-05 21:09:25,518 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 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:25,518 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:25,518 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] [2023-12-05 21:09:25,518 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:09:25,519 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-12-05 21:09:25,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:25,519 INFO L85 PathProgramCache]: Analyzing trace with hash -998095239, now seen corresponding path program 1 times [2023-12-05 21:09:25,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:25,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132242661] [2023-12-05 21:09:25,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:25,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:25,728 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:25,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:25,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132242661] [2023-12-05 21:09:25,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132242661] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:25,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:25,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:09:25,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71834124] [2023-12-05 21:09:25,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:25,729 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:09:25,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:25,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:09:25,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:09:25,730 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 183 [2023-12-05 21:09:25,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 274 transitions, 3985 flow. Second operand has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 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:25,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:25,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 183 [2023-12-05 21:09:25,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:26,582 INFO L124 PetriNetUnfolderBase]: 2236/4966 cut-off events. [2023-12-05 21:09:26,582 INFO L125 PetriNetUnfolderBase]: For 35806/36184 co-relation queries the response was YES. [2023-12-05 21:09:26,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37228 conditions, 4966 events. 2236/4966 cut-off events. For 35806/36184 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 41685 event pairs, 78 based on Foata normal form. 2/3924 useless extension candidates. Maximal degree in co-relation 37070. Up to 3075 conditions per place. [2023-12-05 21:09:26,633 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 152 selfloop transitions, 12 changer transitions 0/273 dead transitions. [2023-12-05 21:09:26,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 273 transitions, 4291 flow [2023-12-05 21:09:26,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:09:26,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:09:26,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 480 transitions. [2023-12-05 21:09:26,635 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6557377049180327 [2023-12-05 21:09:26,635 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 480 transitions. [2023-12-05 21:09:26,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 480 transitions. [2023-12-05 21:09:26,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:26,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 480 transitions. [2023-12-05 21:09:26,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:26,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 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:26,637 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 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:26,638 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, -19 predicate places. [2023-12-05 21:09:26,638 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 273 transitions, 4291 flow [2023-12-05 21:09:26,638 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 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:26,638 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:26,638 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] [2023-12-05 21:09:26,638 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:09:26,638 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-12-05 21:09:26,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:26,639 INFO L85 PathProgramCache]: Analyzing trace with hash -135608105, now seen corresponding path program 1 times [2023-12-05 21:09:26,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:26,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668522365] [2023-12-05 21:09:26,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:26,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:26,792 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:26,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:26,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668522365] [2023-12-05 21:09:26,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668522365] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:26,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:26,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:09:26,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867252760] [2023-12-05 21:09:26,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:26,794 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:09:26,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:26,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:09:26,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:09:26,795 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 183 [2023-12-05 21:09:26,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 273 transitions, 4291 flow. Second operand has 7 states, 7 states have (on average 103.85714285714286) internal successors, (727), 7 states have internal predecessors, (727), 0 states have call successors, (0), 0 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:26,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:26,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 183 [2023-12-05 21:09:26,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:27,598 INFO L124 PetriNetUnfolderBase]: 1706/3931 cut-off events. [2023-12-05 21:09:27,598 INFO L125 PetriNetUnfolderBase]: For 37463/37877 co-relation queries the response was YES. [2023-12-05 21:09:27,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31438 conditions, 3931 events. 1706/3931 cut-off events. For 37463/37877 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 31945 event pairs, 78 based on Foata normal form. 0/3175 useless extension candidates. Maximal degree in co-relation 31269. Up to 2396 conditions per place. [2023-12-05 21:09:27,633 INFO L140 encePairwiseOnDemand]: 165/183 looper letters, 146 selfloop transitions, 38 changer transitions 0/278 dead transitions. [2023-12-05 21:09:27,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 278 transitions, 4779 flow [2023-12-05 21:09:27,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 21:09:27,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 21:09:27,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 672 transitions. [2023-12-05 21:09:27,635 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6120218579234973 [2023-12-05 21:09:27,636 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 672 transitions. [2023-12-05 21:09:27,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 672 transitions. [2023-12-05 21:09:27,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:27,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 672 transitions. [2023-12-05 21:09:27,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 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,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 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,638 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 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,639 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, -14 predicate places. [2023-12-05 21:09:27,639 INFO L500 AbstractCegarLoop]: Abstraction has has 173 places, 278 transitions, 4779 flow [2023-12-05 21:09:27,639 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 103.85714285714286) internal successors, (727), 7 states have internal predecessors, (727), 0 states have call successors, (0), 0 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,639 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:27,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, 1, 1, 1, 1, 1, 1, 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,640 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:09:27,640 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-12-05 21:09:27,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:27,640 INFO L85 PathProgramCache]: Analyzing trace with hash 403101384, now seen corresponding path program 1 times [2023-12-05 21:09:27,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:27,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855867725] [2023-12-05 21:09:27,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:27,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:27,922 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,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:27,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855867725] [2023-12-05 21:09:27,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855867725] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:27,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:27,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-05 21:09:27,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476762654] [2023-12-05 21:09:27,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:27,923 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-05 21:09:27,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:27,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-05 21:09:27,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-05 21:09:27,925 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 183 [2023-12-05 21:09:27,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 278 transitions, 4779 flow. Second operand has 9 states, 9 states have (on average 101.44444444444444) internal successors, (913), 9 states have internal predecessors, (913), 0 states have call successors, (0), 0 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,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:27,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 183 [2023-12-05 21:09:27,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:28,545 INFO L124 PetriNetUnfolderBase]: 1176/2983 cut-off events. [2023-12-05 21:09:28,546 INFO L125 PetriNetUnfolderBase]: For 31022/31476 co-relation queries the response was YES. [2023-12-05 21:09:28,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24561 conditions, 2983 events. 1176/2983 cut-off events. For 31022/31476 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 23454 event pairs, 78 based on Foata normal form. 0/2515 useless extension candidates. Maximal degree in co-relation 24381. Up to 1717 conditions per place. [2023-12-05 21:09:28,575 INFO L140 encePairwiseOnDemand]: 164/183 looper letters, 160 selfloop transitions, 30 changer transitions 0/283 dead transitions. [2023-12-05 21:09:28,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 283 transitions, 5289 flow [2023-12-05 21:09:28,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:09:28,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:09:28,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 864 transitions. [2023-12-05 21:09:28,577 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5901639344262295 [2023-12-05 21:09:28,577 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 864 transitions. [2023-12-05 21:09:28,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 864 transitions. [2023-12-05 21:09:28,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:28,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 864 transitions. [2023-12-05 21:09:28,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 0 states have call successors, (0), 0 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,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 183.0) internal successors, (1647), 9 states have internal predecessors, (1647), 0 states have call successors, (0), 0 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,581 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 183.0) internal successors, (1647), 9 states have internal predecessors, (1647), 0 states have call successors, (0), 0 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,581 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, -7 predicate places. [2023-12-05 21:09:28,582 INFO L500 AbstractCegarLoop]: Abstraction has has 180 places, 283 transitions, 5289 flow [2023-12-05 21:09:28,582 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 101.44444444444444) internal successors, (913), 9 states have internal predecessors, (913), 0 states have call successors, (0), 0 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,582 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:28,582 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] [2023-12-05 21:09:28,582 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:09:28,582 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-12-05 21:09:28,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:28,583 INFO L85 PathProgramCache]: Analyzing trace with hash 36362752, now seen corresponding path program 1 times [2023-12-05 21:09:28,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:28,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857778741] [2023-12-05 21:09:28,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:28,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:28,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:28,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:28,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857778741] [2023-12-05 21:09:28,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857778741] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:28,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:28,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-05 21:09:28,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005635185] [2023-12-05 21:09:28,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:28,961 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:09:28,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:28,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:09:28,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:09:28,962 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 183 [2023-12-05 21:09:28,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 283 transitions, 5289 flow. Second operand has 11 states, 11 states have (on average 99.18181818181819) internal successors, (1091), 11 states have internal predecessors, (1091), 0 states have call successors, (0), 0 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,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:28,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 183 [2023-12-05 21:09:28,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:29,355 INFO L124 PetriNetUnfolderBase]: 530/1420 cut-off events. [2023-12-05 21:09:29,355 INFO L125 PetriNetUnfolderBase]: For 17709/18203 co-relation queries the response was YES. [2023-12-05 21:09:29,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11887 conditions, 1420 events. 530/1420 cut-off events. For 17709/18203 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 8240 event pairs, 24 based on Foata normal form. 0/1384 useless extension candidates. Maximal degree in co-relation 11696. Up to 629 conditions per place. [2023-12-05 21:09:29,363 INFO L140 encePairwiseOnDemand]: 168/183 looper letters, 0 selfloop transitions, 0 changer transitions 257/257 dead transitions. [2023-12-05 21:09:29,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 257 transitions, 4891 flow [2023-12-05 21:09:29,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 21:09:29,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 21:09:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 936 transitions. [2023-12-05 21:09:29,366 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5683060109289617 [2023-12-05 21:09:29,366 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 936 transitions. [2023-12-05 21:09:29,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 936 transitions. [2023-12-05 21:09:29,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:29,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 936 transitions. [2023-12-05 21:09:29,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 104.0) internal successors, (936), 9 states have internal predecessors, (936), 0 states have call successors, (0), 0 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,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 0 states have call successors, (0), 0 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,371 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 0 states have call successors, (0), 0 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,372 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, -6 predicate places. [2023-12-05 21:09:29,372 INFO L500 AbstractCegarLoop]: Abstraction has has 181 places, 257 transitions, 4891 flow [2023-12-05 21:09:29,372 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 99.18181818181819) internal successors, (1091), 11 states have internal predecessors, (1091), 0 states have call successors, (0), 0 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,384 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe009_power.oepc.i_BEv2_AllErrorsAtOnce [2023-12-05 21:09:29,420 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 83 remaining) [2023-12-05 21:09:29,420 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 83 remaining) [2023-12-05 21:09:29,421 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 83 remaining) [2023-12-05 21:09:29,423 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 83 remaining) [2023-12-05 21:09:29,423 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 83 remaining) [2023-12-05 21:09:29,423 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 83 remaining) [2023-12-05 21:09:29,423 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 83 remaining) [2023-12-05 21:09:29,423 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 83 remaining) [2023-12-05 21:09:29,423 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 83 remaining) [2023-12-05 21:09:29,424 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 83 remaining) [2023-12-05 21:09:29,424 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 83 remaining) [2023-12-05 21:09:29,424 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 83 remaining) [2023-12-05 21:09:29,424 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 83 remaining) [2023-12-05 21:09:29,424 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 83 remaining) [2023-12-05 21:09:29,424 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 83 remaining) [2023-12-05 21:09:29,424 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 83 remaining) [2023-12-05 21:09:29,424 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 83 remaining) [2023-12-05 21:09:29,425 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 83 remaining) [2023-12-05 21:09:29,425 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 83 remaining) [2023-12-05 21:09:29,425 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 83 remaining) [2023-12-05 21:09:29,425 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 83 remaining) [2023-12-05 21:09:29,425 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 83 remaining) [2023-12-05 21:09:29,425 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 83 remaining) [2023-12-05 21:09:29,425 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 83 remaining) [2023-12-05 21:09:29,425 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 83 remaining) [2023-12-05 21:09:29,425 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 83 remaining) [2023-12-05 21:09:29,425 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 83 remaining) [2023-12-05 21:09:29,425 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 83 remaining) [2023-12-05 21:09:29,425 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 83 remaining) [2023-12-05 21:09:29,425 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 83 remaining) [2023-12-05 21:09:29,426 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 83 remaining) [2023-12-05 21:09:29,426 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 83 remaining) [2023-12-05 21:09:29,426 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 83 remaining) [2023-12-05 21:09:29,426 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 83 remaining) [2023-12-05 21:09:29,426 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 83 remaining) [2023-12-05 21:09:29,426 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 83 remaining) [2023-12-05 21:09:29,426 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 83 remaining) [2023-12-05 21:09:29,426 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 83 remaining) [2023-12-05 21:09:29,426 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 83 remaining) [2023-12-05 21:09:29,426 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 83 remaining) [2023-12-05 21:09:29,426 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 83 remaining) [2023-12-05 21:09:29,426 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 83 remaining) [2023-12-05 21:09:29,426 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 83 remaining) [2023-12-05 21:09:29,426 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 83 remaining) [2023-12-05 21:09:29,427 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 83 remaining) [2023-12-05 21:09:29,427 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 83 remaining) [2023-12-05 21:09:29,427 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 83 remaining) [2023-12-05 21:09:29,427 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 83 remaining) [2023-12-05 21:09:29,428 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 83 remaining) [2023-12-05 21:09:29,428 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 83 remaining) [2023-12-05 21:09:29,428 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 83 remaining) [2023-12-05 21:09:29,428 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 83 remaining) [2023-12-05 21:09:29,428 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 83 remaining) [2023-12-05 21:09:29,428 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 83 remaining) [2023-12-05 21:09:29,428 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 83 remaining) [2023-12-05 21:09:29,428 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 83 remaining) [2023-12-05 21:09:29,428 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 83 remaining) [2023-12-05 21:09:29,428 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 83 remaining) [2023-12-05 21:09:29,428 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 83 remaining) [2023-12-05 21:09:29,428 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 83 remaining) [2023-12-05 21:09:29,429 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 83 remaining) [2023-12-05 21:09:29,429 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 83 remaining) [2023-12-05 21:09:29,429 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 83 remaining) [2023-12-05 21:09:29,429 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 83 remaining) [2023-12-05 21:09:29,429 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 83 remaining) [2023-12-05 21:09:29,429 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 83 remaining) [2023-12-05 21:09:29,429 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 83 remaining) [2023-12-05 21:09:29,429 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 83 remaining) [2023-12-05 21:09:29,429 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 83 remaining) [2023-12-05 21:09:29,429 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 83 remaining) [2023-12-05 21:09:29,429 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 83 remaining) [2023-12-05 21:09:29,429 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 83 remaining) [2023-12-05 21:09:29,429 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 83 remaining) [2023-12-05 21:09:29,429 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 83 remaining) [2023-12-05 21:09:29,430 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 83 remaining) [2023-12-05 21:09:29,430 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 83 remaining) [2023-12-05 21:09:29,430 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 83 remaining) [2023-12-05 21:09:29,430 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 83 remaining) [2023-12-05 21:09:29,430 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 83 remaining) [2023-12-05 21:09:29,430 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 83 remaining) [2023-12-05 21:09:29,430 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 83 remaining) [2023-12-05 21:09:29,430 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 83 remaining) [2023-12-05 21:09:29,430 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 83 remaining) [2023-12-05 21:09:29,430 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:09:29,431 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:29,435 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:09:29,435 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:09:29,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:09:29 BasicIcfg [2023-12-05 21:09:29,443 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:09:29,444 INFO L158 Benchmark]: Toolchain (without parser) took 23691.74ms. Allocated memory was 216.0MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 170.4MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2023-12-05 21:09:29,444 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 216.0MB. Free memory is still 174.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:09:29,444 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.40ms. Allocated memory is still 216.0MB. Free memory was 170.1MB in the beginning and 145.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-12-05 21:09:29,444 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.56ms. Allocated memory is still 216.0MB. Free memory was 145.0MB in the beginning and 142.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:09:29,446 INFO L158 Benchmark]: Boogie Preprocessor took 55.63ms. Allocated memory is still 216.0MB. Free memory was 142.1MB in the beginning and 139.4MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-05 21:09:29,446 INFO L158 Benchmark]: RCFGBuilder took 1080.75ms. Allocated memory was 216.0MB in the beginning and 305.1MB in the end (delta: 89.1MB). Free memory was 139.4MB in the beginning and 192.2MB in the end (delta: -52.8MB). Peak memory consumption was 36.9MB. Max. memory is 8.0GB. [2023-12-05 21:09:29,446 INFO L158 Benchmark]: TraceAbstraction took 22050.72ms. Allocated memory was 305.1MB in the beginning and 4.6GB in the end (delta: 4.3GB). Free memory was 191.7MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2023-12-05 21:09:29,447 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 216.0MB. Free memory is still 174.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 437.40ms. Allocated memory is still 216.0MB. Free memory was 170.1MB in the beginning and 145.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.56ms. Allocated memory is still 216.0MB. Free memory was 145.0MB in the beginning and 142.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.63ms. Allocated memory is still 216.0MB. Free memory was 142.1MB in the beginning and 139.4MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1080.75ms. Allocated memory was 216.0MB in the beginning and 305.1MB in the end (delta: 89.1MB). Free memory was 139.4MB in the beginning and 192.2MB in the end (delta: -52.8MB). Peak memory consumption was 36.9MB. Max. memory is 8.0GB. * TraceAbstraction took 22050.72ms. Allocated memory was 305.1MB in the beginning and 4.6GB in the end (delta: 4.3GB). Free memory was 191.7MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - 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, 235 locations, 83 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: 21.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 679 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 679 mSDsluCounter, 183 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 182 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1045 IncrementalHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 182 mSolverCounterUnsat, 138 mSDtfsCounter, 1045 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5289occurred in iteration=13, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1028 NumberOfCodeBlocks, 1028 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1014 ConstructedInterpolants, 0 QuantifiedInterpolants, 4066 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 52 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:09:29,466 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...