/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/mix040.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:45:50,342 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:45:50,400 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:45:50,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:45:50,422 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:45:50,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:45:50,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:45:50,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:45:50,423 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:45:50,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:45:50,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:45:50,427 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:45:50,427 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:45:50,428 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:45:50,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:45:50,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:45:50,428 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:45:50,428 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:45:50,428 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:45:50,428 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:45:50,429 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:45:50,429 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:45:50,429 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:45:50,429 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:45:50,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:45:50,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:45:50,430 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:45:50,431 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:45:50,431 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:45:50,431 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:45:50,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:45:50,432 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:45:50,432 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:45:50,432 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:45:50,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:45:50,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:45:50,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:45:50,640 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:45:50,641 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:45:50,641 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix040.opt.i [2023-11-30 04:45:51,820 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:45:52,057 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:45:52,057 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040.opt.i [2023-11-30 04:45:52,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfb602aa5/6bf2e9922fd941468a10887aa599bfcf/FLAG1b8e9e516 [2023-11-30 04:45:52,103 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfb602aa5/6bf2e9922fd941468a10887aa599bfcf [2023-11-30 04:45:52,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:45:52,105 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:45:52,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:45:52,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:45:52,127 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:45:52,127 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:45:52" (1/1) ... [2023-11-30 04:45:52,128 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c2c49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:52, skipping insertion in model container [2023-11-30 04:45:52,128 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:45:52" (1/1) ... [2023-11-30 04:45:52,205 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:45:52,578 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:45:52,588 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:45:52,643 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:45:52,717 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:45:52,718 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:45:52,723 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:45:52,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:52 WrapperNode [2023-11-30 04:45:52,724 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:45:52,725 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:45:52,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:45:52,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:45:52,729 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:45:52" (1/1) ... [2023-11-30 04:45:52,768 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:45:52" (1/1) ... [2023-11-30 04:45:52,794 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 156 [2023-11-30 04:45:52,795 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:45:52,795 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:45:52,795 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:45:52,795 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:45:52,801 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:52" (1/1) ... [2023-11-30 04:45:52,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:52" (1/1) ... [2023-11-30 04:45:52,812 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:52" (1/1) ... [2023-11-30 04:45:52,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:52" (1/1) ... [2023-11-30 04:45:52,821 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:52" (1/1) ... [2023-11-30 04:45:52,823 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:52" (1/1) ... [2023-11-30 04:45:52,831 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:52" (1/1) ... [2023-11-30 04:45:52,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:52" (1/1) ... [2023-11-30 04:45:52,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:45:52,834 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:45:52,835 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:45:52,835 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:45:52,835 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:52" (1/1) ... [2023-11-30 04:45:52,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:45:52,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:45:52,869 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:45:52,977 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:45:52,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:45:52,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:45:52,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:45:52,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:45:52,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:45:52,983 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-30 04:45:52,983 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-30 04:45:52,983 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-30 04:45:52,983 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-30 04:45:52,984 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-30 04:45:52,984 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-30 04:45:52,984 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-30 04:45:52,984 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-30 04:45:52,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:45:52,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:45:52,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:45:52,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:45:52,985 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:45:53,113 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:45:53,116 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:45:53,445 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:45:53,525 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:45:53,525 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:45:53,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:45:53 BoogieIcfgContainer [2023-11-30 04:45:53,526 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:45:53,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:45:53,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:45:53,530 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:45:53,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:45:52" (1/3) ... [2023-11-30 04:45:53,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57cef136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:45:53, skipping insertion in model container [2023-11-30 04:45:53,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:52" (2/3) ... [2023-11-30 04:45:53,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57cef136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:45:53, skipping insertion in model container [2023-11-30 04:45:53,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:45:53" (3/3) ... [2023-11-30 04:45:53,533 INFO L112 eAbstractionObserver]: Analyzing ICFG mix040.opt.i [2023-11-30 04:45:53,545 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:45:53,545 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-30 04:45:53,546 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:45:53,593 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:45:53,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 146 transitions, 308 flow [2023-11-30 04:45:53,682 INFO L124 PetriNetUnfolderBase]: 3/142 cut-off events. [2023-11-30 04:45:53,682 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:45:53,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 3/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 114 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2023-11-30 04:45:53,687 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 146 transitions, 308 flow [2023-11-30 04:45:53,691 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 92 transitions, 193 flow [2023-11-30 04:45:53,702 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:45:53,708 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;@5a00d341, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:45:53,708 INFO L363 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-11-30 04:45:53,725 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:45:53,725 INFO L124 PetriNetUnfolderBase]: 0/43 cut-off events. [2023-11-30 04:45:53,725 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:45:53,726 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:53,726 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] [2023-11-30 04:45:53,727 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:45:53,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:53,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1504109445, now seen corresponding path program 1 times [2023-11-30 04:45:53,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:53,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189864078] [2023-11-30 04:45:53,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:53,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:54,031 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:45:54,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:54,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189864078] [2023-11-30 04:45:54,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189864078] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:54,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:54,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:54,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398924346] [2023-11-30 04:45:54,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:54,039 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:54,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:54,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:54,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:54,066 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 146 [2023-11-30 04:45:54,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 92 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:54,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:54,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 146 [2023-11-30 04:45:54,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:54,117 INFO L124 PetriNetUnfolderBase]: 2/103 cut-off events. [2023-11-30 04:45:54,117 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:45:54,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs, 2 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 77. Up to 19 conditions per place. [2023-11-30 04:45:54,119 INFO L140 encePairwiseOnDemand]: 144/146 looper letters, 18 selfloop transitions, 1 changer transitions 0/91 dead transitions. [2023-11-30 04:45:54,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 91 transitions, 229 flow [2023-11-30 04:45:54,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:54,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:54,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-11-30 04:45:54,128 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8059360730593608 [2023-11-30 04:45:54,129 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-11-30 04:45:54,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-11-30 04:45:54,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:54,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-11-30 04:45:54,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 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:45:54,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 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:45:54,138 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 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:45:54,140 INFO L307 CegarLoopForPetriNet]: 102 programPoint places, 1 predicate places. [2023-11-30 04:45:54,141 INFO L500 AbstractCegarLoop]: Abstraction has has 103 places, 91 transitions, 229 flow [2023-11-30 04:45:54,141 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:54,141 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:54,141 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] [2023-11-30 04:45:54,141 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:45:54,142 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:45:54,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:54,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1504109446, now seen corresponding path program 1 times [2023-11-30 04:45:54,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:54,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774845033] [2023-11-30 04:45:54,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:54,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:54,277 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:45:54,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:54,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774845033] [2023-11-30 04:45:54,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774845033] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:54,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:54,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:54,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287391332] [2023-11-30 04:45:54,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:54,279 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:54,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:54,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:54,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:54,280 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 146 [2023-11-30 04:45:54,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 91 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 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:45:54,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:54,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 146 [2023-11-30 04:45:54,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:54,316 INFO L124 PetriNetUnfolderBase]: 3/108 cut-off events. [2023-11-30 04:45:54,316 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-30 04:45:54,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 108 events. 3/108 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 102 event pairs, 3 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 100. Up to 19 conditions per place. [2023-11-30 04:45:54,324 INFO L140 encePairwiseOnDemand]: 144/146 looper letters, 16 selfloop transitions, 1 changer transitions 0/90 dead transitions. [2023-11-30 04:45:54,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 90 transitions, 259 flow [2023-11-30 04:45:54,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:54,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:54,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-11-30 04:45:54,326 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8287671232876712 [2023-11-30 04:45:54,326 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-11-30 04:45:54,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-11-30 04:45:54,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:54,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-11-30 04:45:54,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:54,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 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:45:54,329 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 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:45:54,329 INFO L307 CegarLoopForPetriNet]: 102 programPoint places, 2 predicate places. [2023-11-30 04:45:54,329 INFO L500 AbstractCegarLoop]: Abstraction has has 104 places, 90 transitions, 259 flow [2023-11-30 04:45:54,330 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 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:45:54,330 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:54,330 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:45:54,330 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:45:54,330 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:45:54,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:54,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1506312409, now seen corresponding path program 1 times [2023-11-30 04:45:54,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:54,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047504317] [2023-11-30 04:45:54,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:54,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:54,409 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:45:54,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:54,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047504317] [2023-11-30 04:45:54,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047504317] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:54,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:54,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:54,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68398435] [2023-11-30 04:45:54,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:54,412 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:54,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:54,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:54,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:54,414 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 146 [2023-11-30 04:45:54,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 90 transitions, 259 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 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:45:54,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:54,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 146 [2023-11-30 04:45:54,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:54,446 INFO L124 PetriNetUnfolderBase]: 3/107 cut-off events. [2023-11-30 04:45:54,447 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-11-30 04:45:54,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 107 events. 3/107 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 99 event pairs, 3 based on Foata normal form. 1/108 useless extension candidates. Maximal degree in co-relation 114. Up to 19 conditions per place. [2023-11-30 04:45:54,451 INFO L140 encePairwiseOnDemand]: 144/146 looper letters, 16 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2023-11-30 04:45:54,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 89 transitions, 289 flow [2023-11-30 04:45:54,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:54,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:54,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-11-30 04:45:54,453 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8287671232876712 [2023-11-30 04:45:54,453 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-11-30 04:45:54,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-11-30 04:45:54,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:54,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-11-30 04:45:54,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:54,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 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:45:54,458 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 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:45:54,458 INFO L307 CegarLoopForPetriNet]: 102 programPoint places, 3 predicate places. [2023-11-30 04:45:54,459 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 89 transitions, 289 flow [2023-11-30 04:45:54,459 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 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:45:54,459 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:54,459 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:45:54,459 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:45:54,459 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:45:54,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:54,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1506312410, now seen corresponding path program 1 times [2023-11-30 04:45:54,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:54,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779251795] [2023-11-30 04:45:54,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:54,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:54,543 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:45:54,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:54,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779251795] [2023-11-30 04:45:54,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779251795] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:54,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:54,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:54,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167967774] [2023-11-30 04:45:54,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:54,545 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:54,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:54,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:54,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:54,546 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 146 [2023-11-30 04:45:54,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 89 transitions, 289 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:54,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:54,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 146 [2023-11-30 04:45:54,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:54,585 INFO L124 PetriNetUnfolderBase]: 3/106 cut-off events. [2023-11-30 04:45:54,585 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2023-11-30 04:45:54,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 106 events. 3/106 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 96 event pairs, 3 based on Foata normal form. 1/107 useless extension candidates. Maximal degree in co-relation 126. Up to 18 conditions per place. [2023-11-30 04:45:54,586 INFO L140 encePairwiseOnDemand]: 144/146 looper letters, 16 selfloop transitions, 1 changer transitions 0/88 dead transitions. [2023-11-30 04:45:54,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 88 transitions, 317 flow [2023-11-30 04:45:54,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:54,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:54,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2023-11-30 04:45:54,588 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8013698630136986 [2023-11-30 04:45:54,588 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2023-11-30 04:45:54,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2023-11-30 04:45:54,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:54,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2023-11-30 04:45:54,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:54,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 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:45:54,590 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 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:45:54,591 INFO L307 CegarLoopForPetriNet]: 102 programPoint places, 4 predicate places. [2023-11-30 04:45:54,591 INFO L500 AbstractCegarLoop]: Abstraction has has 106 places, 88 transitions, 317 flow [2023-11-30 04:45:54,591 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:54,591 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:54,592 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:54,592 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:45:54,592 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:45:54,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:54,592 INFO L85 PathProgramCache]: Analyzing trace with hash 757995603, now seen corresponding path program 1 times [2023-11-30 04:45:54,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:54,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290700343] [2023-11-30 04:45:54,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:54,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:54,661 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:45:54,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:54,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290700343] [2023-11-30 04:45:54,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290700343] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:54,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:54,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:54,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103994120] [2023-11-30 04:45:54,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:54,662 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:54,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:54,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:54,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:54,663 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 146 [2023-11-30 04:45:54,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 88 transitions, 317 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 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:45:54,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:54,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 146 [2023-11-30 04:45:54,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:54,698 INFO L124 PetriNetUnfolderBase]: 3/105 cut-off events. [2023-11-30 04:45:54,698 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2023-11-30 04:45:54,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 105 events. 3/105 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 92 event pairs, 3 based on Foata normal form. 1/106 useless extension candidates. Maximal degree in co-relation 138. Up to 18 conditions per place. [2023-11-30 04:45:54,699 INFO L140 encePairwiseOnDemand]: 144/146 looper letters, 16 selfloop transitions, 1 changer transitions 0/87 dead transitions. [2023-11-30 04:45:54,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 87 transitions, 345 flow [2023-11-30 04:45:54,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:54,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:54,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2023-11-30 04:45:54,700 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8013698630136986 [2023-11-30 04:45:54,700 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2023-11-30 04:45:54,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2023-11-30 04:45:54,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:54,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2023-11-30 04:45:54,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:54,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 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:45:54,702 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 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:45:54,703 INFO L307 CegarLoopForPetriNet]: 102 programPoint places, 5 predicate places. [2023-11-30 04:45:54,703 INFO L500 AbstractCegarLoop]: Abstraction has has 107 places, 87 transitions, 345 flow [2023-11-30 04:45:54,703 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 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:45:54,703 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:54,704 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:54,704 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:45:54,704 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:45:54,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:54,704 INFO L85 PathProgramCache]: Analyzing trace with hash 757995604, now seen corresponding path program 1 times [2023-11-30 04:45:54,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:54,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469936190] [2023-11-30 04:45:54,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:54,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:54,775 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:45:54,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:54,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469936190] [2023-11-30 04:45:54,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469936190] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:54,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:54,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:54,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440830003] [2023-11-30 04:45:54,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:54,776 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:54,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:54,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:54,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:54,777 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 146 [2023-11-30 04:45:54,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 87 transitions, 345 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:54,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:54,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 146 [2023-11-30 04:45:54,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:54,807 INFO L124 PetriNetUnfolderBase]: 3/104 cut-off events. [2023-11-30 04:45:54,807 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2023-11-30 04:45:54,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 104 events. 3/104 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 89 event pairs, 3 based on Foata normal form. 1/105 useless extension candidates. Maximal degree in co-relation 148. Up to 17 conditions per place. [2023-11-30 04:45:54,807 INFO L140 encePairwiseOnDemand]: 144/146 looper letters, 14 selfloop transitions, 1 changer transitions 0/86 dead transitions. [2023-11-30 04:45:54,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 86 transitions, 367 flow [2023-11-30 04:45:54,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:54,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-11-30 04:45:54,809 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8242009132420092 [2023-11-30 04:45:54,809 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-11-30 04:45:54,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-11-30 04:45:54,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:54,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-11-30 04:45:54,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:54,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 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:45:54,811 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 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:45:54,812 INFO L307 CegarLoopForPetriNet]: 102 programPoint places, 6 predicate places. [2023-11-30 04:45:54,812 INFO L500 AbstractCegarLoop]: Abstraction has has 108 places, 86 transitions, 367 flow [2023-11-30 04:45:54,812 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:54,812 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:54,812 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:54,812 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:45:54,812 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:45:54,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:54,813 INFO L85 PathProgramCache]: Analyzing trace with hash -972545027, now seen corresponding path program 1 times [2023-11-30 04:45:54,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:54,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220797567] [2023-11-30 04:45:54,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:54,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:54,902 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:45:54,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:54,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220797567] [2023-11-30 04:45:54,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220797567] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:54,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:54,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:54,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537801893] [2023-11-30 04:45:54,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:54,906 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:54,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:54,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:54,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:54,908 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 146 [2023-11-30 04:45:54,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 86 transitions, 367 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 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:45:54,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:54,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 146 [2023-11-30 04:45:54,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:54,952 INFO L124 PetriNetUnfolderBase]: 2/91 cut-off events. [2023-11-30 04:45:54,952 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2023-11-30 04:45:54,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 91 events. 2/91 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 2/93 useless extension candidates. Maximal degree in co-relation 136. Up to 16 conditions per place. [2023-11-30 04:45:54,953 INFO L140 encePairwiseOnDemand]: 144/146 looper letters, 15 selfloop transitions, 1 changer transitions 0/86 dead transitions. [2023-11-30 04:45:54,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 86 transitions, 405 flow [2023-11-30 04:45:54,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:54,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:54,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-11-30 04:45:54,954 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8264840182648402 [2023-11-30 04:45:54,954 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-11-30 04:45:54,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-11-30 04:45:54,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:54,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-11-30 04:45:54,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 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:45:54,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 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:45:54,956 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 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:45:54,957 INFO L307 CegarLoopForPetriNet]: 102 programPoint places, 7 predicate places. [2023-11-30 04:45:54,957 INFO L500 AbstractCegarLoop]: Abstraction has has 109 places, 86 transitions, 405 flow [2023-11-30 04:45:54,957 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 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:45:54,957 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:54,957 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:54,957 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:45:54,958 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:45:54,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:54,958 INFO L85 PathProgramCache]: Analyzing trace with hash -972545028, now seen corresponding path program 1 times [2023-11-30 04:45:54,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:54,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403211327] [2023-11-30 04:45:54,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:54,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:55,042 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:45:55,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:55,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403211327] [2023-11-30 04:45:55,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403211327] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:55,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:55,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:55,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508903335] [2023-11-30 04:45:55,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:55,044 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:55,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:55,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:55,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:55,046 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 146 [2023-11-30 04:45:55,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 86 transitions, 405 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 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:45:55,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:55,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 146 [2023-11-30 04:45:55,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:55,077 INFO L124 PetriNetUnfolderBase]: 1/88 cut-off events. [2023-11-30 04:45:55,077 INFO L125 PetriNetUnfolderBase]: For 300/300 co-relation queries the response was YES. [2023-11-30 04:45:55,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 88 events. 1/88 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 2/90 useless extension candidates. Maximal degree in co-relation 128. Up to 15 conditions per place. [2023-11-30 04:45:55,079 INFO L140 encePairwiseOnDemand]: 144/146 looper letters, 0 selfloop transitions, 0 changer transitions 85/85 dead transitions. [2023-11-30 04:45:55,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 85 transitions, 427 flow [2023-11-30 04:45:55,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:55,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:55,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2023-11-30 04:45:55,080 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7990867579908676 [2023-11-30 04:45:55,081 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2023-11-30 04:45:55,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2023-11-30 04:45:55,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:55,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2023-11-30 04:45:55,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 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:45:55,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 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:45:55,085 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 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:45:55,087 INFO L307 CegarLoopForPetriNet]: 102 programPoint places, 8 predicate places. [2023-11-30 04:45:55,087 INFO L500 AbstractCegarLoop]: Abstraction has has 110 places, 85 transitions, 427 flow [2023-11-30 04:45:55,091 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 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:45:55,098 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mix040.opt.i_BEv2_AllErrorsAtOnce [2023-11-30 04:45:55,138 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 12 remaining) [2023-11-30 04:45:55,139 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2023-11-30 04:45:55,141 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-11-30 04:45:55,141 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-11-30 04:45:55,141 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-11-30 04:45:55,141 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-11-30 04:45:55,141 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-11-30 04:45:55,141 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-11-30 04:45:55,142 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-11-30 04:45:55,142 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-11-30 04:45:55,142 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-11-30 04:45:55,142 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 12 remaining) [2023-11-30 04:45:55,142 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:45:55,142 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:55,145 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:45:55,145 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:45:55,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:45:55 BasicIcfg [2023-11-30 04:45:55,149 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:45:55,149 INFO L158 Benchmark]: Toolchain (without parser) took 3043.67ms. Allocated memory was 341.8MB in the beginning and 511.7MB in the end (delta: 169.9MB). Free memory was 274.8MB in the beginning and 443.4MB in the end (delta: -168.7MB). Peak memory consumption was 2.2MB. Max. memory is 16.0GB. [2023-11-30 04:45:55,149 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 341.8MB. Free memory is still 287.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:45:55,157 INFO L158 Benchmark]: CACSL2BoogieTranslator took 605.42ms. Allocated memory was 341.8MB in the beginning and 511.7MB in the end (delta: 169.9MB). Free memory was 274.5MB in the beginning and 472.5MB in the end (delta: -198.0MB). Peak memory consumption was 29.6MB. Max. memory is 16.0GB. [2023-11-30 04:45:55,158 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.38ms. Allocated memory is still 511.7MB. Free memory was 472.5MB in the beginning and 469.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:45:55,158 INFO L158 Benchmark]: Boogie Preprocessor took 38.61ms. Allocated memory is still 511.7MB. Free memory was 469.8MB in the beginning and 467.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:45:55,158 INFO L158 Benchmark]: RCFGBuilder took 692.00ms. Allocated memory is still 511.7MB. Free memory was 467.7MB in the beginning and 432.9MB in the end (delta: 34.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-11-30 04:45:55,158 INFO L158 Benchmark]: TraceAbstraction took 1620.77ms. Allocated memory is still 511.7MB. Free memory was 432.1MB in the beginning and 443.4MB in the end (delta: -11.3MB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:45:55,159 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 341.8MB. Free memory is still 287.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 605.42ms. Allocated memory was 341.8MB in the beginning and 511.7MB in the end (delta: 169.9MB). Free memory was 274.5MB in the beginning and 472.5MB in the end (delta: -198.0MB). Peak memory consumption was 29.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 70.38ms. Allocated memory is still 511.7MB. Free memory was 472.5MB in the beginning and 469.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 38.61ms. Allocated memory is still 511.7MB. Free memory was 469.8MB in the beginning and 467.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 692.00ms. Allocated memory is still 511.7MB. Free memory was 467.7MB in the beginning and 432.9MB in the end (delta: 34.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 1620.77ms. Allocated memory is still 511.7MB. Free memory was 432.1MB in the beginning and 443.4MB in the end (delta: -11.3MB). There was no memory consumed. 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 182 locations, 12 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: 1.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 140 IncrementalHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 60 mSDtfsCounter, 140 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=427occurred in iteration=8, InterpolantAutomatonStates: 24, 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.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 428 NumberOfCodeBlocks, 428 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 420 ConstructedInterpolants, 0 QuantifiedInterpolants, 564 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 04:45:55,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...