/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread/singleton_with-uninit-problems.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:01:32,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:01:32,707 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 04:01:32,731 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:01:32,732 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:01:32,732 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:01:32,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:01:32,733 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:01:32,733 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:01:32,736 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:01:32,737 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:01:32,737 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:01:32,737 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:01:32,738 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:01:32,738 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:01:32,738 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:01:32,738 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:01:32,738 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:01:32,739 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:01:32,739 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:01:32,739 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:01:32,740 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:01:32,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:01:32,740 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:01:32,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:01:32,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:01:32,740 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:01:32,740 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:01:32,741 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:01:32,741 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:01:32,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:01:32,742 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:01:32,742 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:01:32,742 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-11-30 04:01:32,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:01:32,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:01:32,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:01:32,959 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:01:32,961 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:01:32,962 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton_with-uninit-problems.i [2023-11-30 04:01:33,908 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:01:34,118 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:01:34,118 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton_with-uninit-problems.i [2023-11-30 04:01:34,141 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f029cb486/de5ef18a9b034672b7e7a25e53790810/FLAGf9b25bb0c [2023-11-30 04:01:34,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f029cb486/de5ef18a9b034672b7e7a25e53790810 [2023-11-30 04:01:34,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:01:34,159 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:01:34,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:01:34,161 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:01:34,164 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:01:34,165 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:01:34" (1/1) ... [2023-11-30 04:01:34,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@103e2493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:01:34, skipping insertion in model container [2023-11-30 04:01:34,166 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:01:34" (1/1) ... [2023-11-30 04:01:34,213 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:01:34,530 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:01:34,538 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:01:34,567 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:01:34,604 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:01:34,605 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:01:34,610 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:01:34,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:01:34 WrapperNode [2023-11-30 04:01:34,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:01:34,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:01:34,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:01:34,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:01:34,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:01:34" (1/1) ... [2023-11-30 04:01:34,630 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:01:34" (1/1) ... [2023-11-30 04:01:34,643 INFO L138 Inliner]: procedures = 324, calls = 53, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 43 [2023-11-30 04:01:34,644 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:01:34,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:01:34,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:01:34,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:01:34,651 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:01:34" (1/1) ... [2023-11-30 04:01:34,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:01:34" (1/1) ... [2023-11-30 04:01:34,653 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:01:34" (1/1) ... [2023-11-30 04:01:34,653 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:01:34" (1/1) ... [2023-11-30 04:01:34,658 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:01:34" (1/1) ... [2023-11-30 04:01:34,660 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:01:34" (1/1) ... [2023-11-30 04:01:34,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:01:34" (1/1) ... [2023-11-30 04:01:34,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:01:34" (1/1) ... [2023-11-30 04:01:34,664 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:01:34,664 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:01:34,665 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:01:34,665 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:01:34,665 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:01:34" (1/1) ... [2023-11-30 04:01:34,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:01:34,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:01:34,695 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 04:01:34,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 04:01:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:01:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:01:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:01:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:01:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 04:01:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2023-11-30 04:01:34,719 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2023-11-30 04:01:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 04:01:34,719 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 04:01:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 04:01:34,719 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 04:01:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-30 04:01:34,720 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-30 04:01:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:01:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-30 04:01:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:01:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:01:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:01:34,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:01:34,721 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 04:01:34,820 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:01:34,821 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:01:35,004 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:01:35,020 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:01:35,020 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:01:35,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:01:35 BoogieIcfgContainer [2023-11-30 04:01:35,021 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:01:35,022 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:01:35,022 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:01:35,024 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:01:35,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:01:34" (1/3) ... [2023-11-30 04:01:35,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491cf113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:01:35, skipping insertion in model container [2023-11-30 04:01:35,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:01:34" (2/3) ... [2023-11-30 04:01:35,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491cf113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:01:35, skipping insertion in model container [2023-11-30 04:01:35,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:01:35" (3/3) ... [2023-11-30 04:01:35,026 INFO L112 eAbstractionObserver]: Analyzing ICFG singleton_with-uninit-problems.i [2023-11-30 04:01:35,036 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:01:35,037 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2023-11-30 04:01:35,037 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:01:35,130 INFO L144 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2023-11-30 04:01:35,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 253 transitions, 603 flow [2023-11-30 04:01:35,236 INFO L124 PetriNetUnfolderBase]: 8/174 cut-off events. [2023-11-30 04:01:35,236 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-30 04:01:35,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 174 events. 8/174 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 186 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 150. Up to 3 conditions per place. [2023-11-30 04:01:35,240 INFO L82 GeneralOperation]: Start removeDead. Operand has 261 places, 253 transitions, 603 flow [2023-11-30 04:01:35,244 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 148 transitions, 347 flow [2023-11-30 04:01:35,252 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:01:35,260 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;@607ee0ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:01:35,260 INFO L363 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2023-11-30 04:01:35,265 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:01:35,265 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-11-30 04:01:35,265 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:01:35,265 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:35,266 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:35,266 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-11-30 04:01:35,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:35,273 INFO L85 PathProgramCache]: Analyzing trace with hash 116956288, now seen corresponding path program 1 times [2023-11-30 04:01:35,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:35,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11546175] [2023-11-30 04:01:35,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:35,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:35,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:35,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:35,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11546175] [2023-11-30 04:01:35,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11546175] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:35,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:35,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:01:35,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92234017] [2023-11-30 04:01:35,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:35,513 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:01:35,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:35,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:01:35,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:01:35,541 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 255 [2023-11-30 04:01:35,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 148 transitions, 347 flow. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:35,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:35,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 255 [2023-11-30 04:01:35,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:37,621 INFO L124 PetriNetUnfolderBase]: 12080/19283 cut-off events. [2023-11-30 04:01:37,621 INFO L125 PetriNetUnfolderBase]: For 745/745 co-relation queries the response was YES. [2023-11-30 04:01:37,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36317 conditions, 19283 events. 12080/19283 cut-off events. For 745/745 co-relation queries the response was YES. Maximal size of possible extension queue 1424. Compared 145795 event pairs, 11813 based on Foata normal form. 0/9013 useless extension candidates. Maximal degree in co-relation 36256. Up to 15949 conditions per place. [2023-11-30 04:01:37,792 INFO L140 encePairwiseOnDemand]: 246/255 looper letters, 76 selfloop transitions, 7 changer transitions 0/157 dead transitions. [2023-11-30 04:01:37,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 157 transitions, 534 flow [2023-11-30 04:01:37,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:01:37,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:01:37,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2023-11-30 04:01:37,803 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6562091503267974 [2023-11-30 04:01:37,803 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2023-11-30 04:01:37,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2023-11-30 04:01:37,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:37,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2023-11-30 04:01:37,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:37,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:37,814 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:37,816 INFO L307 CegarLoopForPetriNet]: 162 programPoint places, 1 predicate places. [2023-11-30 04:01:37,817 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 157 transitions, 534 flow [2023-11-30 04:01:37,817 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:37,817 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:37,817 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:37,817 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:01:37,817 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-11-30 04:01:37,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:37,818 INFO L85 PathProgramCache]: Analyzing trace with hash 116956289, now seen corresponding path program 1 times [2023-11-30 04:01:37,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:37,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939189207] [2023-11-30 04:01:37,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:37,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:37,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:37,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:37,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939189207] [2023-11-30 04:01:37,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939189207] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:37,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:37,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:01:37,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568070495] [2023-11-30 04:01:37,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:37,889 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:01:37,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:37,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:01:37,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:01:37,891 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 255 [2023-11-30 04:01:37,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 157 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:37,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:37,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 255 [2023-11-30 04:01:37,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:40,062 INFO L124 PetriNetUnfolderBase]: 16253/24708 cut-off events. [2023-11-30 04:01:40,062 INFO L125 PetriNetUnfolderBase]: For 3849/6913 co-relation queries the response was YES. [2023-11-30 04:01:40,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66029 conditions, 24708 events. 16253/24708 cut-off events. For 3849/6913 co-relation queries the response was YES. Maximal size of possible extension queue 1842. Compared 182513 event pairs, 14275 based on Foata normal form. 0/11556 useless extension candidates. Maximal degree in co-relation 65955. Up to 20110 conditions per place. [2023-11-30 04:01:40,249 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 71 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2023-11-30 04:01:40,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 159 transitions, 686 flow [2023-11-30 04:01:40,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:01:40,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:01:40,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2023-11-30 04:01:40,251 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.681045751633987 [2023-11-30 04:01:40,251 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 521 transitions. [2023-11-30 04:01:40,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 521 transitions. [2023-11-30 04:01:40,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:40,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 521 transitions. [2023-11-30 04:01:40,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:40,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:40,254 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:40,255 INFO L307 CegarLoopForPetriNet]: 162 programPoint places, 2 predicate places. [2023-11-30 04:01:40,255 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 159 transitions, 686 flow [2023-11-30 04:01:40,255 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:40,255 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:40,255 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:40,256 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:01:40,256 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-11-30 04:01:40,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:40,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1750929611, now seen corresponding path program 1 times [2023-11-30 04:01:40,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:40,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987709971] [2023-11-30 04:01:40,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:40,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:40,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:40,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:40,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987709971] [2023-11-30 04:01:40,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987709971] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:40,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:40,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:01:40,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124330011] [2023-11-30 04:01:40,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:40,501 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 04:01:40,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:40,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 04:01:40,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 04:01:40,502 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 255 [2023-11-30 04:01:40,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 159 transitions, 686 flow. Second operand has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:40,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:40,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 255 [2023-11-30 04:01:40,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:42,701 INFO L124 PetriNetUnfolderBase]: 16244/24676 cut-off events. [2023-11-30 04:01:42,701 INFO L125 PetriNetUnfolderBase]: For 9527/21779 co-relation queries the response was YES. [2023-11-30 04:01:42,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87384 conditions, 24676 events. 16244/24676 cut-off events. For 9527/21779 co-relation queries the response was YES. Maximal size of possible extension queue 1842. Compared 182475 event pairs, 14256 based on Foata normal form. 14/11538 useless extension candidates. Maximal degree in co-relation 87291. Up to 21353 conditions per place. [2023-11-30 04:01:42,922 INFO L140 encePairwiseOnDemand]: 248/255 looper letters, 93 selfloop transitions, 3 changer transitions 0/158 dead transitions. [2023-11-30 04:01:42,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 158 transitions, 882 flow [2023-11-30 04:01:42,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:01:42,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:01:42,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 573 transitions. [2023-11-30 04:01:42,924 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5617647058823529 [2023-11-30 04:01:42,924 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 573 transitions. [2023-11-30 04:01:42,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 573 transitions. [2023-11-30 04:01:42,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:42,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 573 transitions. [2023-11-30 04:01:42,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:42,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:42,927 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:42,928 INFO L307 CegarLoopForPetriNet]: 162 programPoint places, 1 predicate places. [2023-11-30 04:01:42,928 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 158 transitions, 882 flow [2023-11-30 04:01:42,928 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:42,928 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:42,929 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:42,929 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:01:42,929 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-11-30 04:01:42,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:42,929 INFO L85 PathProgramCache]: Analyzing trace with hash 2113810933, now seen corresponding path program 1 times [2023-11-30 04:01:42,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:42,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679973005] [2023-11-30 04:01:42,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:42,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:43,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:43,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:43,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679973005] [2023-11-30 04:01:43,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679973005] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:43,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:43,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-30 04:01:43,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684927121] [2023-11-30 04:01:43,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:43,287 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-30 04:01:43,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:43,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-30 04:01:43,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2023-11-30 04:01:43,289 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 255 [2023-11-30 04:01:43,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 158 transitions, 882 flow. Second operand has 8 states, 8 states have (on average 119.125) internal successors, (953), 8 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:43,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:43,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 255 [2023-11-30 04:01:43,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:44,755 INFO L124 PetriNetUnfolderBase]: 10263/15911 cut-off events. [2023-11-30 04:01:44,755 INFO L125 PetriNetUnfolderBase]: For 13024/27304 co-relation queries the response was YES. [2023-11-30 04:01:44,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69790 conditions, 15911 events. 10263/15911 cut-off events. For 13024/27304 co-relation queries the response was YES. Maximal size of possible extension queue 1233. Compared 113543 event pairs, 8373 based on Foata normal form. 0/8285 useless extension candidates. Maximal degree in co-relation 69676. Up to 13680 conditions per place. [2023-11-30 04:01:44,882 INFO L140 encePairwiseOnDemand]: 245/255 looper letters, 88 selfloop transitions, 9 changer transitions 0/157 dead transitions. [2023-11-30 04:01:44,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 157 transitions, 1064 flow [2023-11-30 04:01:44,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 04:01:44,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 04:01:44,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 682 transitions. [2023-11-30 04:01:44,885 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5349019607843137 [2023-11-30 04:01:44,885 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 682 transitions. [2023-11-30 04:01:44,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 682 transitions. [2023-11-30 04:01:44,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:44,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 682 transitions. [2023-11-30 04:01:44,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:44,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:44,888 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:44,889 INFO L307 CegarLoopForPetriNet]: 162 programPoint places, 4 predicate places. [2023-11-30 04:01:44,889 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 157 transitions, 1064 flow [2023-11-30 04:01:44,890 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 119.125) internal successors, (953), 8 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:44,890 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:44,890 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:44,890 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:01:44,890 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting thread0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-11-30 04:01:44,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:44,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1014141904, now seen corresponding path program 1 times [2023-11-30 04:01:44,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:44,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117174023] [2023-11-30 04:01:44,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:44,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:45,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:45,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:45,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117174023] [2023-11-30 04:01:45,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117174023] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:45,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:45,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:01:45,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559144188] [2023-11-30 04:01:45,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:45,016 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:01:45,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:45,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:01:45,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:01:45,017 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 255 [2023-11-30 04:01:45,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 157 transitions, 1064 flow. Second operand has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:45,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:45,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 255 [2023-11-30 04:01:45,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:46,594 INFO L124 PetriNetUnfolderBase]: 8472/13356 cut-off events. [2023-11-30 04:01:46,595 INFO L125 PetriNetUnfolderBase]: For 21593/41489 co-relation queries the response was YES. [2023-11-30 04:01:46,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69612 conditions, 13356 events. 8472/13356 cut-off events. For 21593/41489 co-relation queries the response was YES. Maximal size of possible extension queue 899. Compared 94017 event pairs, 6839 based on Foata normal form. 130/7267 useless extension candidates. Maximal degree in co-relation 69483. Up to 11373 conditions per place. [2023-11-30 04:01:46,727 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 82 selfloop transitions, 2 changer transitions 0/156 dead transitions. [2023-11-30 04:01:46,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 156 transitions, 1226 flow [2023-11-30 04:01:46,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:01:46,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:01:46,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2023-11-30 04:01:46,731 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2023-11-30 04:01:46,731 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 495 transitions. [2023-11-30 04:01:46,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 495 transitions. [2023-11-30 04:01:46,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:46,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 495 transitions. [2023-11-30 04:01:46,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:46,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:46,735 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:46,738 INFO L307 CegarLoopForPetriNet]: 162 programPoint places, 4 predicate places. [2023-11-30 04:01:46,738 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 156 transitions, 1226 flow [2023-11-30 04:01:46,738 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:46,739 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:46,739 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:46,742 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:01:46,742 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting thread0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-11-30 04:01:46,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:46,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1014141903, now seen corresponding path program 1 times [2023-11-30 04:01:46,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:46,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138926184] [2023-11-30 04:01:46,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:46,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:47,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:47,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:47,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138926184] [2023-11-30 04:01:47,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138926184] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:47,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:47,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 04:01:47,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614748095] [2023-11-30 04:01:47,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:47,025 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 04:01:47,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:47,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 04:01:47,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-30 04:01:47,027 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 255 [2023-11-30 04:01:47,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 156 transitions, 1226 flow. Second operand has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:47,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:47,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 255 [2023-11-30 04:01:47,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:48,129 INFO L124 PetriNetUnfolderBase]: 6687/10801 cut-off events. [2023-11-30 04:01:48,129 INFO L125 PetriNetUnfolderBase]: For 28007/47879 co-relation queries the response was YES. [2023-11-30 04:01:48,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65209 conditions, 10801 events. 6687/10801 cut-off events. For 28007/47879 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 75436 event pairs, 5298 based on Foata normal form. 130/6120 useless extension candidates. Maximal degree in co-relation 65060. Up to 9074 conditions per place. [2023-11-30 04:01:48,245 INFO L140 encePairwiseOnDemand]: 248/255 looper letters, 94 selfloop transitions, 5 changer transitions 0/158 dead transitions. [2023-11-30 04:01:48,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 158 transitions, 1452 flow [2023-11-30 04:01:48,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 04:01:48,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 04:01:48,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 675 transitions. [2023-11-30 04:01:48,248 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2023-11-30 04:01:48,248 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 675 transitions. [2023-11-30 04:01:48,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 675 transitions. [2023-11-30 04:01:48,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:48,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 675 transitions. [2023-11-30 04:01:48,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:48,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:48,253 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:48,255 INFO L307 CegarLoopForPetriNet]: 162 programPoint places, 6 predicate places. [2023-11-30 04:01:48,255 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 158 transitions, 1452 flow [2023-11-30 04:01:48,256 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:48,256 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:48,256 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:48,256 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:01:48,256 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-11-30 04:01:48,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:48,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1501066136, now seen corresponding path program 1 times [2023-11-30 04:01:48,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:48,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881075822] [2023-11-30 04:01:48,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:48,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:48,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:48,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:48,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881075822] [2023-11-30 04:01:48,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881075822] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:48,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:48,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:01:48,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408293984] [2023-11-30 04:01:48,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:48,312 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 04:01:48,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:48,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 04:01:48,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 04:01:48,314 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 255 [2023-11-30 04:01:48,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 158 transitions, 1452 flow. Second operand has 4 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:48,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:48,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 255 [2023-11-30 04:01:48,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:48,854 INFO L124 PetriNetUnfolderBase]: 2381/4257 cut-off events. [2023-11-30 04:01:48,854 INFO L125 PetriNetUnfolderBase]: For 13797/17925 co-relation queries the response was YES. [2023-11-30 04:01:48,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27724 conditions, 4257 events. 2381/4257 cut-off events. For 13797/17925 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 27221 event pairs, 1792 based on Foata normal form. 2/2932 useless extension candidates. Maximal degree in co-relation 27569. Up to 3348 conditions per place. [2023-11-30 04:01:48,922 INFO L140 encePairwiseOnDemand]: 245/255 looper letters, 82 selfloop transitions, 6 changer transitions 0/154 dead transitions. [2023-11-30 04:01:48,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 154 transitions, 1576 flow [2023-11-30 04:01:48,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 04:01:48,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 04:01:48,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 772 transitions. [2023-11-30 04:01:48,924 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6054901960784314 [2023-11-30 04:01:48,924 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 772 transitions. [2023-11-30 04:01:48,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 772 transitions. [2023-11-30 04:01:48,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:48,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 772 transitions. [2023-11-30 04:01:48,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 154.4) internal successors, (772), 5 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:48,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:48,927 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:48,928 INFO L307 CegarLoopForPetriNet]: 162 programPoint places, 5 predicate places. [2023-11-30 04:01:48,928 INFO L500 AbstractCegarLoop]: Abstraction has has 167 places, 154 transitions, 1576 flow [2023-11-30 04:01:48,929 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:48,929 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:48,929 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:48,929 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:01:48,929 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-11-30 04:01:48,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:48,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1501066135, now seen corresponding path program 1 times [2023-11-30 04:01:48,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:48,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477830505] [2023-11-30 04:01:48,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:48,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:49,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:49,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:49,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477830505] [2023-11-30 04:01:49,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477830505] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:49,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:49,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:01:49,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911278828] [2023-11-30 04:01:49,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:49,009 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 04:01:49,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:49,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 04:01:49,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 04:01:49,010 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 255 [2023-11-30 04:01:49,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 154 transitions, 1576 flow. Second operand has 4 states, 4 states have (on average 156.25) internal successors, (625), 4 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:49,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:49,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 255 [2023-11-30 04:01:49,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:49,186 INFO L124 PetriNetUnfolderBase]: 579/1319 cut-off events. [2023-11-30 04:01:49,186 INFO L125 PetriNetUnfolderBase]: For 6491/7163 co-relation queries the response was YES. [2023-11-30 04:01:49,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8588 conditions, 1319 events. 579/1319 cut-off events. For 6491/7163 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 7016 event pairs, 370 based on Foata normal form. 4/1233 useless extension candidates. Maximal degree in co-relation 8444. Up to 886 conditions per place. [2023-11-30 04:01:49,198 INFO L140 encePairwiseOnDemand]: 246/255 looper letters, 63 selfloop transitions, 3 changer transitions 4/146 dead transitions. [2023-11-30 04:01:49,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 146 transitions, 1600 flow [2023-11-30 04:01:49,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 04:01:49,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 04:01:49,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 820 transitions. [2023-11-30 04:01:49,203 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6431372549019608 [2023-11-30 04:01:49,203 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 820 transitions. [2023-11-30 04:01:49,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 820 transitions. [2023-11-30 04:01:49,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:49,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 820 transitions. [2023-11-30 04:01:49,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.0) internal successors, (820), 5 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:49,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:49,208 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:49,210 INFO L307 CegarLoopForPetriNet]: 162 programPoint places, 3 predicate places. [2023-11-30 04:01:49,210 INFO L500 AbstractCegarLoop]: Abstraction has has 165 places, 146 transitions, 1600 flow [2023-11-30 04:01:49,210 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 156.25) internal successors, (625), 4 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:49,210 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:49,211 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:49,211 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:01:49,211 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting thread0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-11-30 04:01:49,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:49,211 INFO L85 PathProgramCache]: Analyzing trace with hash 871862987, now seen corresponding path program 1 times [2023-11-30 04:01:49,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:49,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481994833] [2023-11-30 04:01:49,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:49,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:49,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:49,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:49,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481994833] [2023-11-30 04:01:49,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481994833] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:49,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:49,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:01:49,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997104315] [2023-11-30 04:01:49,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:49,342 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:01:49,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:49,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:01:49,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:01:49,344 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 255 [2023-11-30 04:01:49,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 146 transitions, 1600 flow. Second operand has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:49,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:49,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 255 [2023-11-30 04:01:49,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:49,580 INFO L124 PetriNetUnfolderBase]: 545/1262 cut-off events. [2023-11-30 04:01:49,581 INFO L125 PetriNetUnfolderBase]: For 8254/9018 co-relation queries the response was YES. [2023-11-30 04:01:49,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8978 conditions, 1262 events. 545/1262 cut-off events. For 8254/9018 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 6679 event pairs, 345 based on Foata normal form. 18/1192 useless extension candidates. Maximal degree in co-relation 8821. Up to 830 conditions per place. [2023-11-30 04:01:49,588 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 75 selfloop transitions, 2 changer transitions 4/145 dead transitions. [2023-11-30 04:01:49,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 145 transitions, 1748 flow [2023-11-30 04:01:49,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:01:49,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:01:49,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2023-11-30 04:01:49,590 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6326797385620915 [2023-11-30 04:01:49,590 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 484 transitions. [2023-11-30 04:01:49,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 484 transitions. [2023-11-30 04:01:49,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:49,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 484 transitions. [2023-11-30 04:01:49,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:49,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:49,592 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:49,593 INFO L307 CegarLoopForPetriNet]: 162 programPoint places, 3 predicate places. [2023-11-30 04:01:49,593 INFO L500 AbstractCegarLoop]: Abstraction has has 165 places, 145 transitions, 1748 flow [2023-11-30 04:01:49,593 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:49,593 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:49,593 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:49,593 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 04:01:49,593 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting thread0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-11-30 04:01:49,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:49,593 INFO L85 PathProgramCache]: Analyzing trace with hash 871862988, now seen corresponding path program 1 times [2023-11-30 04:01:49,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:49,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991769664] [2023-11-30 04:01:49,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:49,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:49,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:49,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:49,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991769664] [2023-11-30 04:01:49,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991769664] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:49,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:49,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 04:01:49,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301903453] [2023-11-30 04:01:49,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:49,764 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 04:01:49,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:49,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 04:01:49,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-30 04:01:49,766 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 255 [2023-11-30 04:01:49,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 145 transitions, 1748 flow. Second operand has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:49,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:49,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 255 [2023-11-30 04:01:49,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:49,936 INFO L124 PetriNetUnfolderBase]: 509/1202 cut-off events. [2023-11-30 04:01:49,936 INFO L125 PetriNetUnfolderBase]: For 9512/10364 co-relation queries the response was YES. [2023-11-30 04:01:49,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9303 conditions, 1202 events. 509/1202 cut-off events. For 9512/10364 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 6315 event pairs, 318 based on Foata normal form. 18/1134 useless extension candidates. Maximal degree in co-relation 9132. Up to 774 conditions per place. [2023-11-30 04:01:49,946 INFO L140 encePairwiseOnDemand]: 248/255 looper letters, 79 selfloop transitions, 5 changer transitions 4/145 dead transitions. [2023-11-30 04:01:49,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 145 transitions, 1930 flow [2023-11-30 04:01:49,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 04:01:49,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 04:01:49,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2023-11-30 04:01:49,947 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5176470588235295 [2023-11-30 04:01:49,947 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 660 transitions. [2023-11-30 04:01:49,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 660 transitions. [2023-11-30 04:01:49,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:49,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 660 transitions. [2023-11-30 04:01:49,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:49,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:49,951 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:49,951 INFO L307 CegarLoopForPetriNet]: 162 programPoint places, 5 predicate places. [2023-11-30 04:01:49,951 INFO L500 AbstractCegarLoop]: Abstraction has has 167 places, 145 transitions, 1930 flow [2023-11-30 04:01:49,951 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:49,951 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:49,952 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:49,952 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 04:01:49,952 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting thread0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-11-30 04:01:49,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:49,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1693534316, now seen corresponding path program 1 times [2023-11-30 04:01:49,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:49,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880365287] [2023-11-30 04:01:49,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:49,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:50,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:50,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:50,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880365287] [2023-11-30 04:01:50,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880365287] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:50,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:50,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:01:50,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003990644] [2023-11-30 04:01:50,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:50,044 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:01:50,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:50,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:01:50,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:01:50,045 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 255 [2023-11-30 04:01:50,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 145 transitions, 1930 flow. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:50,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:50,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 255 [2023-11-30 04:01:50,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:50,184 INFO L124 PetriNetUnfolderBase]: 487/1157 cut-off events. [2023-11-30 04:01:50,184 INFO L125 PetriNetUnfolderBase]: For 11233/12153 co-relation queries the response was YES. [2023-11-30 04:01:50,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9671 conditions, 1157 events. 487/1157 cut-off events. For 11233/12153 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5976 event pairs, 303 based on Foata normal form. 12/1087 useless extension candidates. Maximal degree in co-relation 9487. Up to 734 conditions per place. [2023-11-30 04:01:50,194 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 76 selfloop transitions, 2 changer transitions 4/144 dead transitions. [2023-11-30 04:01:50,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 144 transitions, 2076 flow [2023-11-30 04:01:50,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:01:50,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:01:50,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 482 transitions. [2023-11-30 04:01:50,197 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6300653594771242 [2023-11-30 04:01:50,197 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 482 transitions. [2023-11-30 04:01:50,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 482 transitions. [2023-11-30 04:01:50,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:50,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 482 transitions. [2023-11-30 04:01:50,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:50,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:50,199 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:50,199 INFO L307 CegarLoopForPetriNet]: 162 programPoint places, 5 predicate places. [2023-11-30 04:01:50,199 INFO L500 AbstractCegarLoop]: Abstraction has has 167 places, 144 transitions, 2076 flow [2023-11-30 04:01:50,200 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:50,200 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:50,200 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:50,200 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 04:01:50,200 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting thread0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-11-30 04:01:50,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:50,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1693534317, now seen corresponding path program 1 times [2023-11-30 04:01:50,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:50,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273778827] [2023-11-30 04:01:50,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:50,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:50,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:50,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:50,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273778827] [2023-11-30 04:01:50,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273778827] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:50,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:50,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:01:50,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116653564] [2023-11-30 04:01:50,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:50,374 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:01:50,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:50,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:01:50,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:01:50,375 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 255 [2023-11-30 04:01:50,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 144 transitions, 2076 flow. Second operand has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 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-11-30 04:01:50,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:50,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 255 [2023-11-30 04:01:50,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:50,580 INFO L124 PetriNetUnfolderBase]: 463/1109 cut-off events. [2023-11-30 04:01:50,580 INFO L125 PetriNetUnfolderBase]: For 12531/13487 co-relation queries the response was YES. [2023-11-30 04:01:50,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9998 conditions, 1109 events. 463/1109 cut-off events. For 12531/13487 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5714 event pairs, 286 based on Foata normal form. 12/1043 useless extension candidates. Maximal degree in co-relation 9800. Up to 694 conditions per place. [2023-11-30 04:01:50,592 INFO L140 encePairwiseOnDemand]: 248/255 looper letters, 78 selfloop transitions, 5 changer transitions 4/144 dead transitions. [2023-11-30 04:01:50,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 144 transitions, 2260 flow [2023-11-30 04:01:50,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 04:01:50,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 04:01:50,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 656 transitions. [2023-11-30 04:01:50,594 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5145098039215686 [2023-11-30 04:01:50,594 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 656 transitions. [2023-11-30 04:01:50,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 656 transitions. [2023-11-30 04:01:50,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:50,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 656 transitions. [2023-11-30 04:01:50,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:50,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:50,597 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:50,598 INFO L307 CegarLoopForPetriNet]: 162 programPoint places, 7 predicate places. [2023-11-30 04:01:50,598 INFO L500 AbstractCegarLoop]: Abstraction has has 169 places, 144 transitions, 2260 flow [2023-11-30 04:01:50,598 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 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-11-30 04:01:50,598 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:50,599 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:50,599 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 04:01:50,599 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting thread0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-11-30 04:01:50,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:50,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1203286164, now seen corresponding path program 1 times [2023-11-30 04:01:50,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:50,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378926607] [2023-11-30 04:01:50,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:50,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:50,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:50,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:50,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378926607] [2023-11-30 04:01:50,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378926607] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:50,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:50,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:01:50,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492885446] [2023-11-30 04:01:50,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:50,735 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 04:01:50,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:50,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 04:01:50,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 04:01:50,737 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 255 [2023-11-30 04:01:50,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 144 transitions, 2260 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:50,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:50,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 255 [2023-11-30 04:01:50,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:50,884 INFO L124 PetriNetUnfolderBase]: 393/969 cut-off events. [2023-11-30 04:01:50,884 INFO L125 PetriNetUnfolderBase]: For 14182/15174 co-relation queries the response was YES. [2023-11-30 04:01:50,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9309 conditions, 969 events. 393/969 cut-off events. For 14182/15174 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4631 event pairs, 234 based on Foata normal form. 24/931 useless extension candidates. Maximal degree in co-relation 9098. Up to 596 conditions per place. [2023-11-30 04:01:50,893 INFO L140 encePairwiseOnDemand]: 248/255 looper letters, 76 selfloop transitions, 3 changer transitions 4/143 dead transitions. [2023-11-30 04:01:50,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 143 transitions, 2422 flow [2023-11-30 04:01:50,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:01:50,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:01:50,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 543 transitions. [2023-11-30 04:01:50,895 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5323529411764706 [2023-11-30 04:01:50,895 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 543 transitions. [2023-11-30 04:01:50,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 543 transitions. [2023-11-30 04:01:50,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:50,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 543 transitions. [2023-11-30 04:01:50,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:50,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:50,898 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:50,899 INFO L307 CegarLoopForPetriNet]: 162 programPoint places, 6 predicate places. [2023-11-30 04:01:50,899 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 143 transitions, 2422 flow [2023-11-30 04:01:50,900 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:50,900 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:50,900 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:50,900 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 04:01:50,900 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-11-30 04:01:50,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:50,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1911032336, now seen corresponding path program 1 times [2023-11-30 04:01:50,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:50,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45541904] [2023-11-30 04:01:50,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:50,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:51,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:51,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45541904] [2023-11-30 04:01:51,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45541904] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:51,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:51,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-30 04:01:51,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875809813] [2023-11-30 04:01:51,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:51,458 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-30 04:01:51,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:51,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-30 04:01:51,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2023-11-30 04:01:51,459 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 255 [2023-11-30 04:01:51,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 143 transitions, 2422 flow. Second operand has 15 states, 15 states have (on average 123.93333333333334) internal successors, (1859), 15 states have internal predecessors, (1859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:51,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:51,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 255 [2023-11-30 04:01:51,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:51,671 INFO L124 PetriNetUnfolderBase]: 391/965 cut-off events. [2023-11-30 04:01:51,671 INFO L125 PetriNetUnfolderBase]: For 14275/15055 co-relation queries the response was YES. [2023-11-30 04:01:51,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9921 conditions, 965 events. 391/965 cut-off events. For 14275/15055 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4607 event pairs, 234 based on Foata normal form. 2/905 useless extension candidates. Maximal degree in co-relation 9695. Up to 596 conditions per place. [2023-11-30 04:01:51,680 INFO L140 encePairwiseOnDemand]: 240/255 looper letters, 72 selfloop transitions, 18 changer transitions 4/146 dead transitions. [2023-11-30 04:01:51,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 146 transitions, 2624 flow [2023-11-30 04:01:51,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-30 04:01:51,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-30 04:01:51,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1410 transitions. [2023-11-30 04:01:51,683 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5026737967914439 [2023-11-30 04:01:51,683 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1410 transitions. [2023-11-30 04:01:51,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1410 transitions. [2023-11-30 04:01:51,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:51,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1410 transitions. [2023-11-30 04:01:51,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 128.1818181818182) internal successors, (1410), 11 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:51,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 255.0) internal successors, (3060), 12 states have internal predecessors, (3060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:51,689 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 255.0) internal successors, (3060), 12 states have internal predecessors, (3060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:51,689 INFO L307 CegarLoopForPetriNet]: 162 programPoint places, 16 predicate places. [2023-11-30 04:01:51,689 INFO L500 AbstractCegarLoop]: Abstraction has has 178 places, 146 transitions, 2624 flow [2023-11-30 04:01:51,690 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 123.93333333333334) internal successors, (1859), 15 states have internal predecessors, (1859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:51,690 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:51,690 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:51,690 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 04:01:51,690 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-11-30 04:01:51,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:51,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1968171931, now seen corresponding path program 1 times [2023-11-30 04:01:51,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:51,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424947213] [2023-11-30 04:01:51,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:51,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:52,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:52,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:52,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424947213] [2023-11-30 04:01:52,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424947213] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:52,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:52,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-30 04:01:52,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967837127] [2023-11-30 04:01:52,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:52,273 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-30 04:01:52,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:52,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-30 04:01:52,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2023-11-30 04:01:52,275 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 255 [2023-11-30 04:01:52,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 146 transitions, 2624 flow. Second operand has 15 states, 15 states have (on average 124.06666666666666) internal successors, (1861), 15 states have internal predecessors, (1861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:52,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:52,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 255 [2023-11-30 04:01:52,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:52,556 INFO L124 PetriNetUnfolderBase]: 389/961 cut-off events. [2023-11-30 04:01:52,556 INFO L125 PetriNetUnfolderBase]: For 16185/17025 co-relation queries the response was YES. [2023-11-30 04:01:52,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10525 conditions, 961 events. 389/961 cut-off events. For 16185/17025 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4587 event pairs, 234 based on Foata normal form. 2/901 useless extension candidates. Maximal degree in co-relation 10284. Up to 596 conditions per place. [2023-11-30 04:01:52,568 INFO L140 encePairwiseOnDemand]: 241/255 looper letters, 73 selfloop transitions, 17 changer transitions 4/146 dead transitions. [2023-11-30 04:01:52,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 146 transitions, 2810 flow [2023-11-30 04:01:52,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-30 04:01:52,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-30 04:01:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1408 transitions. [2023-11-30 04:01:52,571 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5019607843137255 [2023-11-30 04:01:52,571 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1408 transitions. [2023-11-30 04:01:52,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1408 transitions. [2023-11-30 04:01:52,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:52,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1408 transitions. [2023-11-30 04:01:52,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 128.0) internal successors, (1408), 11 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:52,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 255.0) internal successors, (3060), 12 states have internal predecessors, (3060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:52,577 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 255.0) internal successors, (3060), 12 states have internal predecessors, (3060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:52,577 INFO L307 CegarLoopForPetriNet]: 162 programPoint places, 26 predicate places. [2023-11-30 04:01:52,577 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 146 transitions, 2810 flow [2023-11-30 04:01:52,578 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 124.06666666666666) internal successors, (1861), 15 states have internal predecessors, (1861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:52,578 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:52,578 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:52,578 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 04:01:52,578 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-11-30 04:01:52,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:52,579 INFO L85 PathProgramCache]: Analyzing trace with hash 739587118, now seen corresponding path program 1 times [2023-11-30 04:01:52,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:52,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350441517] [2023-11-30 04:01:52,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:52,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:53,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:53,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:53,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350441517] [2023-11-30 04:01:53,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350441517] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:53,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:53,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-30 04:01:53,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64935817] [2023-11-30 04:01:53,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:53,130 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-30 04:01:53,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:53,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-30 04:01:53,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2023-11-30 04:01:53,132 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 255 [2023-11-30 04:01:53,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 146 transitions, 2810 flow. Second operand has 15 states, 15 states have (on average 124.2) internal successors, (1863), 15 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:53,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:53,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 255 [2023-11-30 04:01:53,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:53,430 INFO L124 PetriNetUnfolderBase]: 387/956 cut-off events. [2023-11-30 04:01:53,430 INFO L125 PetriNetUnfolderBase]: For 18048/18948 co-relation queries the response was YES. [2023-11-30 04:01:53,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11120 conditions, 956 events. 387/956 cut-off events. For 18048/18948 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4549 event pairs, 234 based on Foata normal form. 2/896 useless extension candidates. Maximal degree in co-relation 10864. Up to 596 conditions per place. [2023-11-30 04:01:53,442 INFO L140 encePairwiseOnDemand]: 240/255 looper letters, 72 selfloop transitions, 18 changer transitions 4/146 dead transitions. [2023-11-30 04:01:53,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 146 transitions, 2996 flow [2023-11-30 04:01:53,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-30 04:01:53,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-30 04:01:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1650 transitions. [2023-11-30 04:01:53,446 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.497737556561086 [2023-11-30 04:01:53,446 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1650 transitions. [2023-11-30 04:01:53,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1650 transitions. [2023-11-30 04:01:53,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:53,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1650 transitions. [2023-11-30 04:01:53,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 126.92307692307692) internal successors, (1650), 13 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:53,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 255.0) internal successors, (3570), 14 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:53,452 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 255.0) internal successors, (3570), 14 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:53,452 INFO L307 CegarLoopForPetriNet]: 162 programPoint places, 38 predicate places. [2023-11-30 04:01:53,452 INFO L500 AbstractCegarLoop]: Abstraction has has 200 places, 146 transitions, 2996 flow [2023-11-30 04:01:53,453 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 124.2) internal successors, (1863), 15 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:53,453 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:53,453 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:53,453 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 04:01:53,453 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-11-30 04:01:53,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:53,454 INFO L85 PathProgramCache]: Analyzing trace with hash -526035665, now seen corresponding path program 1 times [2023-11-30 04:01:53,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:53,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50642073] [2023-11-30 04:01:53,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:53,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:54,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:54,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50642073] [2023-11-30 04:01:54,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50642073] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:54,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:54,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-30 04:01:54,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553295875] [2023-11-30 04:01:54,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:54,041 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-30 04:01:54,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:54,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-30 04:01:54,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2023-11-30 04:01:54,043 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 255 [2023-11-30 04:01:54,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 146 transitions, 2996 flow. Second operand has 15 states, 15 states have (on average 124.33333333333333) internal successors, (1865), 15 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:54,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:54,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 255 [2023-11-30 04:01:54,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:54,331 INFO L124 PetriNetUnfolderBase]: 386/952 cut-off events. [2023-11-30 04:01:54,331 INFO L125 PetriNetUnfolderBase]: For 20186/21146 co-relation queries the response was YES. [2023-11-30 04:01:54,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11724 conditions, 952 events. 386/952 cut-off events. For 20186/21146 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4522 event pairs, 234 based on Foata normal form. 2/892 useless extension candidates. Maximal degree in co-relation 11453. Up to 596 conditions per place. [2023-11-30 04:01:54,343 INFO L140 encePairwiseOnDemand]: 241/255 looper letters, 72 selfloop transitions, 16 changer transitions 4/144 dead transitions. [2023-11-30 04:01:54,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 144 transitions, 3112 flow [2023-11-30 04:01:54,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-30 04:01:54,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-30 04:01:54,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1645 transitions. [2023-11-30 04:01:54,347 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.4962292609351433 [2023-11-30 04:01:54,347 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1645 transitions. [2023-11-30 04:01:54,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1645 transitions. [2023-11-30 04:01:54,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:54,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1645 transitions. [2023-11-30 04:01:54,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 126.53846153846153) internal successors, (1645), 13 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:54,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 255.0) internal successors, (3570), 14 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:54,353 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 255.0) internal successors, (3570), 14 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:54,353 INFO L307 CegarLoopForPetriNet]: 162 programPoint places, 49 predicate places. [2023-11-30 04:01:54,353 INFO L500 AbstractCegarLoop]: Abstraction has has 211 places, 144 transitions, 3112 flow [2023-11-30 04:01:54,354 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 124.33333333333333) internal successors, (1865), 15 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:54,354 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:54,354 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:54,354 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 04:01:54,354 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-11-30 04:01:54,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:54,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1925326103, now seen corresponding path program 1 times [2023-11-30 04:01:54,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:54,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305881704] [2023-11-30 04:01:54,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:54,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:54,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:54,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:54,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305881704] [2023-11-30 04:01:54,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305881704] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:54,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:54,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-30 04:01:54,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529012655] [2023-11-30 04:01:54,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:54,727 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-30 04:01:54,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:54,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-30 04:01:54,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-11-30 04:01:54,729 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 255 [2023-11-30 04:01:54,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 144 transitions, 3112 flow. Second operand has 14 states, 14 states have (on average 126.78571428571429) internal successors, (1775), 14 states have internal predecessors, (1775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:54,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:54,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 255 [2023-11-30 04:01:54,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:55,069 INFO L124 PetriNetUnfolderBase]: 386/950 cut-off events. [2023-11-30 04:01:55,069 INFO L125 PetriNetUnfolderBase]: For 22456/23476 co-relation queries the response was YES. [2023-11-30 04:01:55,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12330 conditions, 950 events. 386/950 cut-off events. For 22456/23476 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4525 event pairs, 234 based on Foata normal form. 2/890 useless extension candidates. Maximal degree in co-relation 12080. Up to 595 conditions per place. [2023-11-30 04:01:55,074 INFO L140 encePairwiseOnDemand]: 241/255 looper letters, 0 selfloop transitions, 0 changer transitions 142/142 dead transitions. [2023-11-30 04:01:55,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 142 transitions, 3220 flow [2023-11-30 04:01:55,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-30 04:01:55,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-30 04:01:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1920 transitions. [2023-11-30 04:01:55,078 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5019607843137255 [2023-11-30 04:01:55,078 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1920 transitions. [2023-11-30 04:01:55,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1920 transitions. [2023-11-30 04:01:55,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:55,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1920 transitions. [2023-11-30 04:01:55,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 128.0) internal successors, (1920), 15 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:55,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 255.0) internal successors, (4080), 16 states have internal predecessors, (4080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:55,084 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 255.0) internal successors, (4080), 16 states have internal predecessors, (4080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:55,085 INFO L307 CegarLoopForPetriNet]: 162 programPoint places, 62 predicate places. [2023-11-30 04:01:55,085 INFO L500 AbstractCegarLoop]: Abstraction has has 224 places, 142 transitions, 3220 flow [2023-11-30 04:01:55,085 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.78571428571429) internal successors, (1775), 14 states have internal predecessors, (1775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:55,096 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/singleton_with-uninit-problems.i_BEv2_AllErrorsAtOnce [2023-11-30 04:01:55,169 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 71 remaining) [2023-11-30 04:01:55,170 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 71 remaining) [2023-11-30 04:01:55,170 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 71 remaining) [2023-11-30 04:01:55,172 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 71 remaining) [2023-11-30 04:01:55,172 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 71 remaining) [2023-11-30 04:01:55,173 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 71 remaining) [2023-11-30 04:01:55,173 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 71 remaining) [2023-11-30 04:01:55,173 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 71 remaining) [2023-11-30 04:01:55,173 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 71 remaining) [2023-11-30 04:01:55,173 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 71 remaining) [2023-11-30 04:01:55,173 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 71 remaining) [2023-11-30 04:01:55,173 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 71 remaining) [2023-11-30 04:01:55,173 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 71 remaining) [2023-11-30 04:01:55,173 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 71 remaining) [2023-11-30 04:01:55,173 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 71 remaining) [2023-11-30 04:01:55,173 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 71 remaining) [2023-11-30 04:01:55,174 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 71 remaining) [2023-11-30 04:01:55,174 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 71 remaining) [2023-11-30 04:01:55,174 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 71 remaining) [2023-11-30 04:01:55,174 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 71 remaining) [2023-11-30 04:01:55,174 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 71 remaining) [2023-11-30 04:01:55,174 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 71 remaining) [2023-11-30 04:01:55,174 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 71 remaining) [2023-11-30 04:01:55,174 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 71 remaining) [2023-11-30 04:01:55,174 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err10INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 71 remaining) [2023-11-30 04:01:55,174 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 71 remaining) [2023-11-30 04:01:55,174 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 71 remaining) [2023-11-30 04:01:55,174 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 71 remaining) [2023-11-30 04:01:55,175 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 71 remaining) [2023-11-30 04:01:55,175 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 71 remaining) [2023-11-30 04:01:55,175 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 71 remaining) [2023-11-30 04:01:55,175 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 71 remaining) [2023-11-30 04:01:55,175 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 71 remaining) [2023-11-30 04:01:55,175 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 71 remaining) [2023-11-30 04:01:55,175 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 71 remaining) [2023-11-30 04:01:55,176 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 71 remaining) [2023-11-30 04:01:55,176 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 71 remaining) [2023-11-30 04:01:55,176 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 71 remaining) [2023-11-30 04:01:55,176 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 71 remaining) [2023-11-30 04:01:55,176 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 71 remaining) [2023-11-30 04:01:55,176 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 71 remaining) [2023-11-30 04:01:55,176 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 71 remaining) [2023-11-30 04:01:55,176 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 71 remaining) [2023-11-30 04:01:55,176 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 71 remaining) [2023-11-30 04:01:55,176 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 71 remaining) [2023-11-30 04:01:55,176 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 71 remaining) [2023-11-30 04:01:55,177 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 71 remaining) [2023-11-30 04:01:55,177 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 71 remaining) [2023-11-30 04:01:55,177 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 71 remaining) [2023-11-30 04:01:55,177 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 71 remaining) [2023-11-30 04:01:55,177 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 71 remaining) [2023-11-30 04:01:55,177 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 71 remaining) [2023-11-30 04:01:55,177 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 71 remaining) [2023-11-30 04:01:55,177 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 71 remaining) [2023-11-30 04:01:55,177 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 71 remaining) [2023-11-30 04:01:55,177 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 71 remaining) [2023-11-30 04:01:55,177 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 71 remaining) [2023-11-30 04:01:55,177 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 71 remaining) [2023-11-30 04:01:55,178 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Thread1of1ForFork4Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 71 remaining) [2023-11-30 04:01:55,178 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Thread1of1ForFork4Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 71 remaining) [2023-11-30 04:01:55,178 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Thread1of1ForFork4Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 71 remaining) [2023-11-30 04:01:55,178 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Thread1of1ForFork4Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 71 remaining) [2023-11-30 04:01:55,178 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Thread1of1ForFork4Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 71 remaining) [2023-11-30 04:01:55,178 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 71 remaining) [2023-11-30 04:01:55,178 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 71 remaining) [2023-11-30 04:01:55,178 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 71 remaining) [2023-11-30 04:01:55,178 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 71 remaining) [2023-11-30 04:01:55,178 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 71 remaining) [2023-11-30 04:01:55,179 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 71 remaining) [2023-11-30 04:01:55,179 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 71 remaining) [2023-11-30 04:01:55,179 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 71 remaining) [2023-11-30 04:01:55,179 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-30 04:01:55,179 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:55,184 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:01:55,184 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:01:55,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:01:55 BasicIcfg [2023-11-30 04:01:55,189 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:01:55,189 INFO L158 Benchmark]: Toolchain (without parser) took 21030.46ms. Allocated memory was 614.5MB in the beginning and 11.5GB in the end (delta: 10.9GB). Free memory was 562.4MB in the beginning and 8.5GB in the end (delta: -8.0GB). Peak memory consumption was 2.9GB. Max. memory is 16.0GB. [2023-11-30 04:01:55,190 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 358.6MB. Free memory was 302.1MB in the beginning and 302.0MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:01:55,190 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.71ms. Allocated memory is still 614.5MB. Free memory was 562.1MB in the beginning and 529.1MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-11-30 04:01:55,190 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.92ms. Allocated memory is still 614.5MB. Free memory was 528.8MB in the beginning and 526.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:01:55,191 INFO L158 Benchmark]: Boogie Preprocessor took 19.47ms. Allocated memory is still 614.5MB. Free memory was 526.7MB in the beginning and 524.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:01:55,191 INFO L158 Benchmark]: RCFGBuilder took 356.68ms. Allocated memory is still 614.5MB. Free memory was 524.9MB in the beginning and 563.4MB in the end (delta: -38.5MB). Peak memory consumption was 18.4MB. Max. memory is 16.0GB. [2023-11-30 04:01:55,191 INFO L158 Benchmark]: TraceAbstraction took 20166.83ms. Allocated memory was 614.5MB in the beginning and 11.5GB in the end (delta: 10.9GB). Free memory was 562.4MB in the beginning and 8.5GB in the end (delta: -8.0GB). Peak memory consumption was 2.9GB. Max. memory is 16.0GB. [2023-11-30 04:01:55,192 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.13ms. Allocated memory is still 358.6MB. Free memory was 302.1MB in the beginning and 302.0MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 449.71ms. Allocated memory is still 614.5MB. Free memory was 562.1MB in the beginning and 529.1MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 31.92ms. Allocated memory is still 614.5MB. Free memory was 528.8MB in the beginning and 526.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 19.47ms. Allocated memory is still 614.5MB. Free memory was 526.7MB in the beginning and 524.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 356.68ms. Allocated memory is still 614.5MB. Free memory was 524.9MB in the beginning and 563.4MB in the end (delta: -38.5MB). Peak memory consumption was 18.4MB. Max. memory is 16.0GB. * TraceAbstraction took 20166.83ms. Allocated memory was 614.5MB in the beginning and 11.5GB in the end (delta: 10.9GB). Free memory was 562.4MB in the beginning and 8.5GB in the end (delta: -8.0GB). Peak memory consumption was 2.9GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 11 procedures, 289 locations, 71 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.0s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1427 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1427 mSDsluCounter, 465 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 145 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2441 IncrementalHoareTripleChecker+Invalid, 2566 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 320 mSDtfsCounter, 2441 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3220occurred in iteration=18, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 973 NumberOfCodeBlocks, 973 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 955 ConstructedInterpolants, 0 QuantifiedInterpolants, 12931 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 32 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 04:01:55,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...