/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/mix044.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:45:59,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:45:59,689 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:59,713 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:45:59,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:45:59,714 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:45:59,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:45:59,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:45:59,715 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:45:59,718 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:45:59,719 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:45:59,719 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:45:59,719 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:45:59,720 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:45:59,720 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:45:59,720 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:45:59,720 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:45:59,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:45:59,721 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:45:59,721 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:45:59,721 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:45:59,721 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:45:59,722 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:45:59,722 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:45:59,722 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:45:59,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:45:59,722 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:45:59,722 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:45:59,722 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:45:59,723 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:45:59,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:45:59,723 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:45:59,724 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:45:59,724 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:59,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:45:59,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:45:59,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:45:59,913 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:45:59,914 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:45:59,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044.opt.i [2023-11-30 04:46:00,858 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:46:01,026 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:46:01,027 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044.opt.i [2023-11-30 04:46:01,039 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9605e608/65dd24c5dd664c6e80d76a2b3be66623/FLAG10726db44 [2023-11-30 04:46:01,047 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9605e608/65dd24c5dd664c6e80d76a2b3be66623 [2023-11-30 04:46:01,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:46:01,050 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:46:01,051 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:46:01,051 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:46:01,054 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:46:01,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:46:01" (1/1) ... [2023-11-30 04:46:01,055 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@307e74bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:46:01, skipping insertion in model container [2023-11-30 04:46:01,056 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:46:01" (1/1) ... [2023-11-30 04:46:01,084 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:46:01,312 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:46:01,327 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:46:01,371 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:46:01,393 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:46:01,394 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:46:01,399 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:46:01,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:46:01 WrapperNode [2023-11-30 04:46:01,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:46:01,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:46:01,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:46:01,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:46:01,406 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:46:01" (1/1) ... [2023-11-30 04:46:01,427 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:46:01" (1/1) ... [2023-11-30 04:46:01,449 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 173 [2023-11-30 04:46:01,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:46:01,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:46:01,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:46:01,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:46:01,456 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:46:01" (1/1) ... [2023-11-30 04:46:01,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:46:01" (1/1) ... [2023-11-30 04:46:01,459 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:46:01" (1/1) ... [2023-11-30 04:46:01,459 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:46:01" (1/1) ... [2023-11-30 04:46:01,464 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:46:01" (1/1) ... [2023-11-30 04:46:01,465 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:46:01" (1/1) ... [2023-11-30 04:46:01,473 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:46:01" (1/1) ... [2023-11-30 04:46:01,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:46:01" (1/1) ... [2023-11-30 04:46:01,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:46:01,480 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:46:01,480 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:46:01,480 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:46:01,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:46:01" (1/1) ... [2023-11-30 04:46:01,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:46:01,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:46:01,521 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:46:01,542 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:46:01,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:46:01,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:46:01,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:46:01,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:46:01,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:46:01,548 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-30 04:46:01,549 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-30 04:46:01,549 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-30 04:46:01,549 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-30 04:46:01,549 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-30 04:46:01,549 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-30 04:46:01,549 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-30 04:46:01,549 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-30 04:46:01,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:46:01,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:46:01,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:46:01,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:46:01,551 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:46:01,695 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:46:01,702 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:46:01,930 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:46:02,072 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:46:02,072 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:46:02,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:46:02 BoogieIcfgContainer [2023-11-30 04:46:02,074 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:46:02,075 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:46:02,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:46:02,077 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:46:02,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:46:01" (1/3) ... [2023-11-30 04:46:02,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2473da1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:46:02, skipping insertion in model container [2023-11-30 04:46:02,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:46:01" (2/3) ... [2023-11-30 04:46:02,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2473da1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:46:02, skipping insertion in model container [2023-11-30 04:46:02,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:46:02" (3/3) ... [2023-11-30 04:46:02,078 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044.opt.i [2023-11-30 04:46:02,088 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:46:02,089 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-30 04:46:02,089 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:46:02,131 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:46:02,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 146 transitions, 308 flow [2023-11-30 04:46:02,219 INFO L124 PetriNetUnfolderBase]: 3/142 cut-off events. [2023-11-30 04:46:02,220 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:46:02,223 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 115 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:46:02,224 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 146 transitions, 308 flow [2023-11-30 04:46:02,227 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 92 transitions, 193 flow [2023-11-30 04:46:02,235 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:46:02,239 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;@2a0ac78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:46:02,239 INFO L363 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-11-30 04:46:02,244 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:46:02,244 INFO L124 PetriNetUnfolderBase]: 0/43 cut-off events. [2023-11-30 04:46:02,244 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:46:02,245 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:46:02,245 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:46:02,245 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:46:02,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:46:02,248 INFO L85 PathProgramCache]: Analyzing trace with hash -439815204, now seen corresponding path program 1 times [2023-11-30 04:46:02,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:46:02,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265892239] [2023-11-30 04:46:02,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:46:02,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:46:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:46:02,505 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:46:02,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:46:02,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265892239] [2023-11-30 04:46:02,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265892239] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:46:02,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:46:02,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:46:02,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842214468] [2023-11-30 04:46:02,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:46:02,514 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:46:02,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:46:02,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:46:02,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:46:02,548 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 146 [2023-11-30 04:46:02,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 92 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:02,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:46:02,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 146 [2023-11-30 04:46:02,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:46:02,626 INFO L124 PetriNetUnfolderBase]: 2/98 cut-off events. [2023-11-30 04:46:02,626 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:46:02,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 2 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 72. Up to 19 conditions per place. [2023-11-30 04:46:02,628 INFO L140 encePairwiseOnDemand]: 144/146 looper letters, 18 selfloop transitions, 1 changer transitions 0/91 dead transitions. [2023-11-30 04:46:02,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 91 transitions, 229 flow [2023-11-30 04:46:02,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:46:02,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:46:02,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2023-11-30 04:46:02,642 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7990867579908676 [2023-11-30 04:46:02,643 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2023-11-30 04:46:02,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2023-11-30 04:46:02,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:46:02,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2023-11-30 04:46:02,652 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:46:02,656 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:46:02,656 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:46:02,659 INFO L307 CegarLoopForPetriNet]: 102 programPoint places, 1 predicate places. [2023-11-30 04:46:02,660 INFO L500 AbstractCegarLoop]: Abstraction has has 103 places, 91 transitions, 229 flow [2023-11-30 04:46:02,660 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:02,660 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:46:02,661 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:46:02,661 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:46:02,661 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:46:02,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:46:02,662 INFO L85 PathProgramCache]: Analyzing trace with hash -439815203, now seen corresponding path program 1 times [2023-11-30 04:46:02,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:46:02,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278275750] [2023-11-30 04:46:02,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:46:02,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:46:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:46:02,804 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:46:02,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:46:02,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278275750] [2023-11-30 04:46:02,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278275750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:46:02,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:46:02,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:46:02,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144364146] [2023-11-30 04:46:02,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:46:02,807 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:46:02,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:46:02,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:46:02,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:46:02,808 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 146 [2023-11-30 04:46:02,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 91 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 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:46:02,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:46:02,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 146 [2023-11-30 04:46:02,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:46:02,852 INFO L124 PetriNetUnfolderBase]: 3/98 cut-off events. [2023-11-30 04:46:02,853 INFO L125 PetriNetUnfolderBase]: For 13/15 co-relation queries the response was YES. [2023-11-30 04:46:02,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 98 events. 3/98 cut-off events. For 13/15 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 3 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 90. Up to 19 conditions per place. [2023-11-30 04:46:02,854 INFO L140 encePairwiseOnDemand]: 144/146 looper letters, 16 selfloop transitions, 1 changer transitions 0/90 dead transitions. [2023-11-30 04:46:02,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 90 transitions, 259 flow [2023-11-30 04:46:02,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:46:02,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:46:02,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2023-11-30 04:46:02,857 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.821917808219178 [2023-11-30 04:46:02,857 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2023-11-30 04:46:02,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2023-11-30 04:46:02,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:46:02,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2023-11-30 04:46:02,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 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:46:02,860 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:46:02,861 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:46:02,861 INFO L307 CegarLoopForPetriNet]: 102 programPoint places, 2 predicate places. [2023-11-30 04:46:02,861 INFO L500 AbstractCegarLoop]: Abstraction has has 104 places, 90 transitions, 259 flow [2023-11-30 04:46:02,862 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 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:46:02,862 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:46:02,862 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:46:02,862 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:46:02,862 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:46:02,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:46:02,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1691168108, now seen corresponding path program 1 times [2023-11-30 04:46:02,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:46:02,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844599368] [2023-11-30 04:46:02,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:46:02,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:46:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:46:02,927 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:46:02,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:46:02,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844599368] [2023-11-30 04:46:02,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844599368] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:46:02,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:46:02,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:46:02,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158794424] [2023-11-30 04:46:02,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:46:02,933 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:46:02,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:46:02,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:46:02,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:46:02,936 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 146 [2023-11-30 04:46:02,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 90 transitions, 259 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:46:02,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:46:02,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 146 [2023-11-30 04:46:02,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:46:03,000 INFO L124 PetriNetUnfolderBase]: 3/97 cut-off events. [2023-11-30 04:46:03,000 INFO L125 PetriNetUnfolderBase]: For 42/46 co-relation queries the response was YES. [2023-11-30 04:46:03,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 97 events. 3/97 cut-off events. For 42/46 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 3 based on Foata normal form. 1/97 useless extension candidates. Maximal degree in co-relation 104. Up to 19 conditions per place. [2023-11-30 04:46:03,001 INFO L140 encePairwiseOnDemand]: 144/146 looper letters, 17 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2023-11-30 04:46:03,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 89 transitions, 291 flow [2023-11-30 04:46:03,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:46:03,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:46:03,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2023-11-30 04:46:03,003 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7968036529680366 [2023-11-30 04:46:03,003 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2023-11-30 04:46:03,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2023-11-30 04:46:03,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:46:03,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2023-11-30 04:46:03,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 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:46:03,005 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:46:03,006 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:46:03,006 INFO L307 CegarLoopForPetriNet]: 102 programPoint places, 3 predicate places. [2023-11-30 04:46:03,007 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 89 transitions, 291 flow [2023-11-30 04:46:03,007 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:46:03,007 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:46:03,007 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:46:03,007 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:46:03,007 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:46:03,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:46:03,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1691168107, now seen corresponding path program 1 times [2023-11-30 04:46:03,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:46:03,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417660718] [2023-11-30 04:46:03,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:46:03,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:46:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:46:03,089 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:46:03,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:46:03,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417660718] [2023-11-30 04:46:03,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417660718] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:46:03,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:46:03,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:46:03,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144288576] [2023-11-30 04:46:03,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:46:03,090 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:46:03,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:46:03,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:46:03,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:46:03,091 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 146 [2023-11-30 04:46:03,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 89 transitions, 291 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:46:03,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:46:03,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 146 [2023-11-30 04:46:03,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:46:03,131 INFO L124 PetriNetUnfolderBase]: 3/96 cut-off events. [2023-11-30 04:46:03,131 INFO L125 PetriNetUnfolderBase]: For 81/87 co-relation queries the response was YES. [2023-11-30 04:46:03,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 96 events. 3/96 cut-off events. For 81/87 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 3 based on Foata normal form. 1/96 useless extension candidates. Maximal degree in co-relation 116. Up to 18 conditions per place. [2023-11-30 04:46:03,132 INFO L140 encePairwiseOnDemand]: 144/146 looper letters, 15 selfloop transitions, 1 changer transitions 0/88 dead transitions. [2023-11-30 04:46:03,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 88 transitions, 317 flow [2023-11-30 04:46:03,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:46:03,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:46:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2023-11-30 04:46:03,133 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.819634703196347 [2023-11-30 04:46:03,134 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2023-11-30 04:46:03,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2023-11-30 04:46:03,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:46:03,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2023-11-30 04:46:03,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:46:03,135 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:46:03,136 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:46:03,137 INFO L307 CegarLoopForPetriNet]: 102 programPoint places, 4 predicate places. [2023-11-30 04:46:03,137 INFO L500 AbstractCegarLoop]: Abstraction has has 106 places, 88 transitions, 317 flow [2023-11-30 04:46:03,137 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:46:03,137 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:46:03,137 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:46:03,137 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:46:03,137 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:46:03,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:46:03,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1070478668, now seen corresponding path program 1 times [2023-11-30 04:46:03,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:46:03,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259085604] [2023-11-30 04:46:03,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:46:03,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:46:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:46:03,195 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:46:03,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:46:03,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259085604] [2023-11-30 04:46:03,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259085604] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:46:03,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:46:03,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:46:03,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745421128] [2023-11-30 04:46:03,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:46:03,196 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:46:03,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:46:03,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:46:03,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:46:03,197 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 146 [2023-11-30 04:46:03,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 88 transitions, 317 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:46:03,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:46:03,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 146 [2023-11-30 04:46:03,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:46:03,229 INFO L124 PetriNetUnfolderBase]: 3/95 cut-off events. [2023-11-30 04:46:03,230 INFO L125 PetriNetUnfolderBase]: For 133/141 co-relation queries the response was YES. [2023-11-30 04:46:03,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 95 events. 3/95 cut-off events. For 133/141 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 3 based on Foata normal form. 1/95 useless extension candidates. Maximal degree in co-relation 128. Up to 18 conditions per place. [2023-11-30 04:46:03,231 INFO L140 encePairwiseOnDemand]: 144/146 looper letters, 16 selfloop transitions, 1 changer transitions 0/87 dead transitions. [2023-11-30 04:46:03,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 87 transitions, 345 flow [2023-11-30 04:46:03,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:46:03,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:46:03,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-11-30 04:46:03,232 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7945205479452054 [2023-11-30 04:46:03,232 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-11-30 04:46:03,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-11-30 04:46:03,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:46:03,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-11-30 04:46:03,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:46:03,234 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:46:03,234 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:46:03,236 INFO L307 CegarLoopForPetriNet]: 102 programPoint places, 5 predicate places. [2023-11-30 04:46:03,236 INFO L500 AbstractCegarLoop]: Abstraction has has 107 places, 87 transitions, 345 flow [2023-11-30 04:46:03,236 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:46:03,236 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:46:03,237 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:46:03,237 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:46:03,240 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:46:03,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:46:03,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1070478669, now seen corresponding path program 1 times [2023-11-30 04:46:03,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:46:03,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036847461] [2023-11-30 04:46:03,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:46:03,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:46:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:46:03,315 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:46:03,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:46:03,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036847461] [2023-11-30 04:46:03,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036847461] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:46:03,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:46:03,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:46:03,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736232572] [2023-11-30 04:46:03,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:46:03,316 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:46:03,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:46:03,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:46:03,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:46:03,318 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 146 [2023-11-30 04:46:03,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 87 transitions, 345 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:46:03,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:46:03,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 146 [2023-11-30 04:46:03,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:46:03,349 INFO L124 PetriNetUnfolderBase]: 3/94 cut-off events. [2023-11-30 04:46:03,349 INFO L125 PetriNetUnfolderBase]: For 195/205 co-relation queries the response was YES. [2023-11-30 04:46:03,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 94 events. 3/94 cut-off events. For 195/205 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 3 based on Foata normal form. 1/94 useless extension candidates. Maximal degree in co-relation 138. Up to 17 conditions per place. [2023-11-30 04:46:03,350 INFO L140 encePairwiseOnDemand]: 144/146 looper letters, 14 selfloop transitions, 1 changer transitions 0/86 dead transitions. [2023-11-30 04:46:03,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 86 transitions, 367 flow [2023-11-30 04:46:03,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:46:03,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:46:03,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-11-30 04:46:03,351 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.817351598173516 [2023-11-30 04:46:03,351 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-11-30 04:46:03,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-11-30 04:46:03,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:46:03,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-11-30 04:46:03,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:03,352 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:46:03,353 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:46:03,354 INFO L307 CegarLoopForPetriNet]: 102 programPoint places, 6 predicate places. [2023-11-30 04:46:03,355 INFO L500 AbstractCegarLoop]: Abstraction has has 108 places, 86 transitions, 367 flow [2023-11-30 04:46:03,355 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:46:03,355 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:46:03,355 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:46:03,355 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:46:03,356 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:46:03,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:46:03,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1115827445, now seen corresponding path program 1 times [2023-11-30 04:46:03,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:46:03,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923034488] [2023-11-30 04:46:03,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:46:03,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:46:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:46:03,414 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:46:03,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:46:03,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923034488] [2023-11-30 04:46:03,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923034488] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:46:03,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:46:03,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:46:03,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713262142] [2023-11-30 04:46:03,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:46:03,417 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:46:03,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:46:03,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:46:03,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:46:03,418 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 146 [2023-11-30 04:46:03,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 86 transitions, 367 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:46:03,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:46:03,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 146 [2023-11-30 04:46:03,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:46:03,445 INFO L124 PetriNetUnfolderBase]: 2/91 cut-off events. [2023-11-30 04:46:03,445 INFO L125 PetriNetUnfolderBase]: For 261/273 co-relation queries the response was YES. [2023-11-30 04:46:03,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 91 events. 2/91 cut-off events. For 261/273 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 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:46:03,446 INFO L140 encePairwiseOnDemand]: 144/146 looper letters, 16 selfloop transitions, 1 changer transitions 0/86 dead transitions. [2023-11-30 04:46:03,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 86 transitions, 407 flow [2023-11-30 04:46:03,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:46:03,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:46:03,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-11-30 04:46:03,447 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7945205479452054 [2023-11-30 04:46:03,447 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-11-30 04:46:03,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-11-30 04:46:03,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:46:03,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-11-30 04:46:03,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:46:03,449 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:46:03,449 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:46:03,450 INFO L307 CegarLoopForPetriNet]: 102 programPoint places, 7 predicate places. [2023-11-30 04:46:03,450 INFO L500 AbstractCegarLoop]: Abstraction has has 109 places, 86 transitions, 407 flow [2023-11-30 04:46:03,450 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:46:03,450 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:46:03,450 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:46:03,450 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:46:03,451 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:46:03,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:46:03,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1115827444, now seen corresponding path program 1 times [2023-11-30 04:46:03,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:46:03,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135207412] [2023-11-30 04:46:03,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:46:03,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:46:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:46:03,528 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:46:03,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:46:03,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135207412] [2023-11-30 04:46:03,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135207412] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:46:03,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:46:03,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:46:03,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771467687] [2023-11-30 04:46:03,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:46:03,530 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:46:03,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:46:03,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:46:03,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:46:03,531 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 146 [2023-11-30 04:46:03,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 86 transitions, 407 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:46:03,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:46:03,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 146 [2023-11-30 04:46:03,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:46:03,560 INFO L124 PetriNetUnfolderBase]: 1/89 cut-off events. [2023-11-30 04:46:03,560 INFO L125 PetriNetUnfolderBase]: For 318/332 co-relation queries the response was YES. [2023-11-30 04:46:03,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 89 events. 1/89 cut-off events. For 318/332 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 4/93 useless extension candidates. Maximal degree in co-relation 129. Up to 15 conditions per place. [2023-11-30 04:46:03,561 INFO L140 encePairwiseOnDemand]: 144/146 looper letters, 0 selfloop transitions, 0 changer transitions 85/85 dead transitions. [2023-11-30 04:46:03,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 85 transitions, 427 flow [2023-11-30 04:46:03,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:46:03,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:46:03,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-11-30 04:46:03,562 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.817351598173516 [2023-11-30 04:46:03,562 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-11-30 04:46:03,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-11-30 04:46:03,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:46:03,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-11-30 04:46:03,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:03,565 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:46:03,565 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:46:03,566 INFO L307 CegarLoopForPetriNet]: 102 programPoint places, 8 predicate places. [2023-11-30 04:46:03,567 INFO L500 AbstractCegarLoop]: Abstraction has has 110 places, 85 transitions, 427 flow [2023-11-30 04:46:03,567 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:46:03,607 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mix044.opt.i_BEv2_AllErrorsAtOnce [2023-11-30 04:46:03,629 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 12 remaining) [2023-11-30 04:46:03,629 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2023-11-30 04:46:03,629 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-11-30 04:46:03,629 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-11-30 04:46:03,630 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-11-30 04:46:03,630 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-11-30 04:46:03,630 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-11-30 04:46:03,630 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-11-30 04:46:03,630 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-11-30 04:46:03,630 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-11-30 04:46:03,630 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-11-30 04:46:03,630 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 12 remaining) [2023-11-30 04:46:03,630 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:46:03,631 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:46:03,632 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:46:03,633 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:46:03,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:46:03 BasicIcfg [2023-11-30 04:46:03,638 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:46:03,638 INFO L158 Benchmark]: Toolchain (without parser) took 2588.65ms. Allocated memory is still 664.8MB. Free memory was 611.4MB in the beginning and 617.9MB in the end (delta: -6.5MB). Peak memory consumption was 143.1MB. Max. memory is 16.0GB. [2023-11-30 04:46:03,639 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 356.5MB. Free memory is still 305.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:46:03,639 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.56ms. Allocated memory is still 664.8MB. Free memory was 611.1MB in the beginning and 587.7MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-11-30 04:46:03,639 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.44ms. Allocated memory is still 664.8MB. Free memory was 587.7MB in the beginning and 584.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:46:03,639 INFO L158 Benchmark]: Boogie Preprocessor took 29.65ms. Allocated memory is still 664.8MB. Free memory was 584.9MB in the beginning and 582.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:46:03,639 INFO L158 Benchmark]: RCFGBuilder took 594.03ms. Allocated memory is still 664.8MB. Free memory was 582.8MB in the beginning and 616.1MB in the end (delta: -33.3MB). Peak memory consumption was 29.6MB. Max. memory is 16.0GB. [2023-11-30 04:46:03,640 INFO L158 Benchmark]: TraceAbstraction took 1563.16ms. Allocated memory is still 664.8MB. Free memory was 615.1MB in the beginning and 617.9MB in the end (delta: -2.9MB). Peak memory consumption was 147.0MB. Max. memory is 16.0GB. [2023-11-30 04:46:03,641 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.12ms. Allocated memory is still 356.5MB. Free memory is still 305.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 348.56ms. Allocated memory is still 664.8MB. Free memory was 611.1MB in the beginning and 587.7MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 48.44ms. Allocated memory is still 664.8MB. Free memory was 587.7MB in the beginning and 584.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.65ms. Allocated memory is still 664.8MB. Free memory was 584.9MB in the beginning and 582.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 594.03ms. Allocated memory is still 664.8MB. Free memory was 582.8MB in the beginning and 616.1MB in the end (delta: -33.3MB). Peak memory consumption was 29.6MB. Max. memory is 16.0GB. * TraceAbstraction took 1563.16ms. Allocated memory is still 664.8MB. Free memory was 615.1MB in the beginning and 617.9MB in the end (delta: -2.9MB). Peak memory consumption was 147.0MB. 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, 139 IncrementalHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 60 mSDtfsCounter, 139 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:46:03,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...