/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/safe012_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:48:47,928 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:48:47,989 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:48:48,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:48:48,012 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:48:48,013 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:48:48,013 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:48:48,013 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:48:48,014 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:48:48,014 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:48:48,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:48:48,014 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:48:48,014 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:48:48,015 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:48:48,015 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:48:48,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:48:48,015 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:48:48,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:48:48,019 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:48:48,019 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:48:48,022 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:48:48,022 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:48:48,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:48:48,023 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:48:48,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:48:48,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:48:48,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:48:48,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:48:48,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:48:48,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:48:48,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:48:48,026 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:48:48,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:48:48,026 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:48:48,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:48:48,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:48:48,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:48:48,254 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:48:48,256 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:48:48,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_tso.i [2023-11-30 04:48:49,337 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:48:49,538 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:48:49,538 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_tso.i [2023-11-30 04:48:49,561 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17f4b71c8/600ab7978aa14d1e82bc1ac488ea8b69/FLAGe6a96eac4 [2023-11-30 04:48:49,584 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17f4b71c8/600ab7978aa14d1e82bc1ac488ea8b69 [2023-11-30 04:48:49,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:48:49,587 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:48:49,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:48:49,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:48:49,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:48:49,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:48:49" (1/1) ... [2023-11-30 04:48:49,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e549d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:49, skipping insertion in model container [2023-11-30 04:48:49,592 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:48:49" (1/1) ... [2023-11-30 04:48:49,627 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:48:49,887 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:48:49,896 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:48:49,935 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:48:49,960 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:48:49,960 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:48:49,965 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:48:49,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:49 WrapperNode [2023-11-30 04:48:49,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:48:49,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:48:49,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:48:49,968 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:48:49,972 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:48:49" (1/1) ... [2023-11-30 04:48:49,995 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:48:49" (1/1) ... [2023-11-30 04:48:50,016 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 74 [2023-11-30 04:48:50,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:48:50,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:48:50,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:48:50,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:48:50,023 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:49" (1/1) ... [2023-11-30 04:48:50,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:49" (1/1) ... [2023-11-30 04:48:50,027 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:49" (1/1) ... [2023-11-30 04:48:50,027 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:49" (1/1) ... [2023-11-30 04:48:50,031 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:49" (1/1) ... [2023-11-30 04:48:50,032 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:49" (1/1) ... [2023-11-30 04:48:50,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:49" (1/1) ... [2023-11-30 04:48:50,041 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:49" (1/1) ... [2023-11-30 04:48:50,043 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:48:50,044 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:48:50,044 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:48:50,044 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:48:50,044 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:49" (1/1) ... [2023-11-30 04:48:50,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:48:50,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:48:50,070 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:48:50,097 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:48:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:48:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:48:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:48:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:48:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:48:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-30 04:48:50,112 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-30 04:48:50,113 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-30 04:48:50,113 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-30 04:48:50,113 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-30 04:48:50,113 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-30 04:48:50,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:48:50,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:48:50,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:48:50,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:48:50,115 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:48:50,213 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:48:50,214 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:48:50,329 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:48:50,335 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:48:50,335 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:48:50,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:48:50 BoogieIcfgContainer [2023-11-30 04:48:50,336 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:48:50,338 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:48:50,338 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:48:50,340 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:48:50,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:48:49" (1/3) ... [2023-11-30 04:48:50,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f26d3fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:48:50, skipping insertion in model container [2023-11-30 04:48:50,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:49" (2/3) ... [2023-11-30 04:48:50,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f26d3fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:48:50, skipping insertion in model container [2023-11-30 04:48:50,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:48:50" (3/3) ... [2023-11-30 04:48:50,342 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_tso.i [2023-11-30 04:48:50,353 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:48:50,353 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-30 04:48:50,353 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:48:50,394 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:48:50,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 103 transitions, 218 flow [2023-11-30 04:48:50,510 INFO L124 PetriNetUnfolderBase]: 3/100 cut-off events. [2023-11-30 04:48:50,510 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:48:50,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 100 events. 3/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2023-11-30 04:48:50,515 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 103 transitions, 218 flow [2023-11-30 04:48:50,518 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 54 transitions, 114 flow [2023-11-30 04:48:50,529 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:48:50,533 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;@218e8abc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:48:50,533 INFO L363 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-11-30 04:48:50,539 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:48:50,539 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2023-11-30 04:48:50,539 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:48:50,539 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:50,540 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] [2023-11-30 04:48:50,540 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-11-30 04:48:50,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:50,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1148364220, now seen corresponding path program 1 times [2023-11-30 04:48:50,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:50,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779291385] [2023-11-30 04:48:50,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:50,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:50,748 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:48:50,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:50,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779291385] [2023-11-30 04:48:50,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779291385] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:50,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:50,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:48:50,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136799248] [2023-11-30 04:48:50,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:50,756 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:50,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:50,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:50,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:50,785 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 103 [2023-11-30 04:48:50,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 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:48:50,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:50,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 103 [2023-11-30 04:48:50,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:50,824 INFO L124 PetriNetUnfolderBase]: 0/53 cut-off events. [2023-11-30 04:48:50,824 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:48:50,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 53 events. 0/53 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 0. Up to 10 conditions per place. [2023-11-30 04:48:50,825 INFO L140 encePairwiseOnDemand]: 101/103 looper letters, 13 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2023-11-30 04:48:50,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 53 transitions, 140 flow [2023-11-30 04:48:50,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:50,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:50,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2023-11-30 04:48:50,837 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7961165048543689 [2023-11-30 04:48:50,838 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 246 transitions. [2023-11-30 04:48:50,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 246 transitions. [2023-11-30 04:48:50,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:50,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 246 transitions. [2023-11-30 04:48:50,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 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:48:50,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:48:50,849 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:48:50,851 INFO L307 CegarLoopForPetriNet]: 61 programPoint places, 1 predicate places. [2023-11-30 04:48:50,852 INFO L500 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 140 flow [2023-11-30 04:48:50,852 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 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:48:50,852 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:50,852 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] [2023-11-30 04:48:50,852 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:48:50,853 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-11-30 04:48:50,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:50,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1148364219, now seen corresponding path program 1 times [2023-11-30 04:48:50,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:50,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893969365] [2023-11-30 04:48:50,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:50,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:50,977 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:48:50,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:50,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893969365] [2023-11-30 04:48:50,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893969365] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:50,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:50,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:48:50,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635829175] [2023-11-30 04:48:50,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:50,978 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:50,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:50,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:50,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:50,980 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 103 [2023-11-30 04:48:50,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 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:48:50,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:50,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 103 [2023-11-30 04:48:50,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:51,030 INFO L124 PetriNetUnfolderBase]: 0/52 cut-off events. [2023-11-30 04:48:51,030 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-30 04:48:51,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 52 events. 0/52 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2023-11-30 04:48:51,031 INFO L140 encePairwiseOnDemand]: 101/103 looper letters, 11 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2023-11-30 04:48:51,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 52 transitions, 160 flow [2023-11-30 04:48:51,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:51,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:51,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 253 transitions. [2023-11-30 04:48:51,035 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8187702265372169 [2023-11-30 04:48:51,035 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 253 transitions. [2023-11-30 04:48:51,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 253 transitions. [2023-11-30 04:48:51,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:51,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 253 transitions. [2023-11-30 04:48:51,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 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:48:51,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:48:51,038 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:48:51,039 INFO L307 CegarLoopForPetriNet]: 61 programPoint places, 2 predicate places. [2023-11-30 04:48:51,039 INFO L500 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 160 flow [2023-11-30 04:48:51,039 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 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:48:51,039 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:51,040 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] [2023-11-30 04:48:51,040 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:48:51,040 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-11-30 04:48:51,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:51,041 INFO L85 PathProgramCache]: Analyzing trace with hash -938431305, now seen corresponding path program 1 times [2023-11-30 04:48:51,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:51,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364978472] [2023-11-30 04:48:51,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:51,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:51,100 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:48:51,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:51,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364978472] [2023-11-30 04:48:51,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364978472] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:51,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:51,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:48:51,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799509511] [2023-11-30 04:48:51,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:51,101 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:51,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:51,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:51,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:51,102 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 103 [2023-11-30 04:48:51,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 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:48:51,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:51,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 103 [2023-11-30 04:48:51,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:51,124 INFO L124 PetriNetUnfolderBase]: 0/51 cut-off events. [2023-11-30 04:48:51,124 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-30 04:48:51,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 51 events. 0/51 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 34 event pairs, 0 based on Foata normal form. 1/52 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2023-11-30 04:48:51,125 INFO L140 encePairwiseOnDemand]: 101/103 looper letters, 12 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2023-11-30 04:48:51,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 51 transitions, 182 flow [2023-11-30 04:48:51,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:51,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:51,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2023-11-30 04:48:51,126 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7928802588996764 [2023-11-30 04:48:51,126 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 245 transitions. [2023-11-30 04:48:51,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 245 transitions. [2023-11-30 04:48:51,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:51,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 245 transitions. [2023-11-30 04:48:51,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 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:48:51,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:48:51,129 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:48:51,130 INFO L307 CegarLoopForPetriNet]: 61 programPoint places, 3 predicate places. [2023-11-30 04:48:51,130 INFO L500 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 182 flow [2023-11-30 04:48:51,130 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 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:48:51,130 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:51,131 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] [2023-11-30 04:48:51,131 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:48:51,131 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-11-30 04:48:51,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:51,131 INFO L85 PathProgramCache]: Analyzing trace with hash -938431304, now seen corresponding path program 1 times [2023-11-30 04:48:51,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:51,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134130318] [2023-11-30 04:48:51,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:51,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:51,208 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:48:51,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:51,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134130318] [2023-11-30 04:48:51,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134130318] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:51,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:51,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:48:51,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031581088] [2023-11-30 04:48:51,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:51,210 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:51,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:51,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:51,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:51,215 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 103 [2023-11-30 04:48:51,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 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:48:51,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:51,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 103 [2023-11-30 04:48:51,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:51,243 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2023-11-30 04:48:51,244 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-30 04:48:51,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 50 events. 0/50 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 0 based on Foata normal form. 1/51 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2023-11-30 04:48:51,244 INFO L140 encePairwiseOnDemand]: 101/103 looper letters, 10 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2023-11-30 04:48:51,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 50 transitions, 198 flow [2023-11-30 04:48:51,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:51,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:51,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2023-11-30 04:48:51,246 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8155339805825242 [2023-11-30 04:48:51,246 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 252 transitions. [2023-11-30 04:48:51,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 252 transitions. [2023-11-30 04:48:51,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:51,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 252 transitions. [2023-11-30 04:48:51,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 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:48:51,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:48:51,248 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:48:51,248 INFO L307 CegarLoopForPetriNet]: 61 programPoint places, 4 predicate places. [2023-11-30 04:48:51,248 INFO L500 AbstractCegarLoop]: Abstraction has has 65 places, 50 transitions, 198 flow [2023-11-30 04:48:51,249 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 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:48:51,249 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:51,249 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] [2023-11-30 04:48:51,249 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:48:51,249 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-11-30 04:48:51,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:51,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1435175911, now seen corresponding path program 1 times [2023-11-30 04:48:51,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:51,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524748271] [2023-11-30 04:48:51,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:51,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:51,344 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:48:51,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:51,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524748271] [2023-11-30 04:48:51,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524748271] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:51,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:51,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:48:51,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152333272] [2023-11-30 04:48:51,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:51,346 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:51,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:51,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:51,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:51,347 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 103 [2023-11-30 04:48:51,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 50 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 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:48:51,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:51,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 103 [2023-11-30 04:48:51,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:51,373 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2023-11-30 04:48:51,377 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2023-11-30 04:48:51,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 49 events. 0/49 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 1/50 useless extension candidates. Maximal degree in co-relation 0. Up to 10 conditions per place. [2023-11-30 04:48:51,378 INFO L140 encePairwiseOnDemand]: 101/103 looper letters, 10 selfloop transitions, 1 changer transitions 0/49 dead transitions. [2023-11-30 04:48:51,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 49 transitions, 214 flow [2023-11-30 04:48:51,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:51,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2023-11-30 04:48:51,380 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8155339805825242 [2023-11-30 04:48:51,380 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 252 transitions. [2023-11-30 04:48:51,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 252 transitions. [2023-11-30 04:48:51,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:51,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 252 transitions. [2023-11-30 04:48:51,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 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:48:51,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:48:51,382 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:48:51,383 INFO L307 CegarLoopForPetriNet]: 61 programPoint places, 5 predicate places. [2023-11-30 04:48:51,383 INFO L500 AbstractCegarLoop]: Abstraction has has 66 places, 49 transitions, 214 flow [2023-11-30 04:48:51,383 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 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:48:51,383 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:51,383 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] [2023-11-30 04:48:51,383 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:48:51,383 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-11-30 04:48:51,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:51,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1435175912, now seen corresponding path program 1 times [2023-11-30 04:48:51,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:51,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301617121] [2023-11-30 04:48:51,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:51,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:51,446 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:48:51,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:51,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301617121] [2023-11-30 04:48:51,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301617121] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:51,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:51,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:48:51,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297627056] [2023-11-30 04:48:51,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:51,447 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:51,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:51,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:51,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:51,449 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 103 [2023-11-30 04:48:51,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 49 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 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:48:51,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:51,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 103 [2023-11-30 04:48:51,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:51,478 INFO L124 PetriNetUnfolderBase]: 0/48 cut-off events. [2023-11-30 04:48:51,479 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2023-11-30 04:48:51,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 48 events. 0/48 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 1/49 useless extension candidates. Maximal degree in co-relation 0. Up to 11 conditions per place. [2023-11-30 04:48:51,479 INFO L140 encePairwiseOnDemand]: 101/103 looper letters, 0 selfloop transitions, 0 changer transitions 48/48 dead transitions. [2023-11-30 04:48:51,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 48 transitions, 228 flow [2023-11-30 04:48:51,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:51,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:51,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2023-11-30 04:48:51,482 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7864077669902912 [2023-11-30 04:48:51,482 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 243 transitions. [2023-11-30 04:48:51,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 243 transitions. [2023-11-30 04:48:51,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:51,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 243 transitions. [2023-11-30 04:48:51,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 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:48:51,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:48:51,484 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:48:51,486 INFO L307 CegarLoopForPetriNet]: 61 programPoint places, 6 predicate places. [2023-11-30 04:48:51,486 INFO L500 AbstractCegarLoop]: Abstraction has has 67 places, 48 transitions, 228 flow [2023-11-30 04:48:51,487 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 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:48:51,495 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe012_tso.i_BEv2_AllErrorsAtOnce [2023-11-30 04:48:51,539 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 9 remaining) [2023-11-30 04:48:51,539 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2023-11-30 04:48:51,539 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2023-11-30 04:48:51,540 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2023-11-30 04:48:51,540 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2023-11-30 04:48:51,540 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2023-11-30 04:48:51,540 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2023-11-30 04:48:51,540 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 9 remaining) [2023-11-30 04:48:51,540 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 9 remaining) [2023-11-30 04:48:51,540 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:48:51,541 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-30 04:48:51,544 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:48:51,544 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:48:51,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:48:51 BasicIcfg [2023-11-30 04:48:51,551 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:48:51,555 INFO L158 Benchmark]: Toolchain (without parser) took 1964.85ms. Allocated memory is still 532.7MB. Free memory was 490.3MB in the beginning and 379.1MB in the end (delta: 111.2MB). Peak memory consumption was 113.4MB. Max. memory is 16.0GB. [2023-11-30 04:48:51,555 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 362.8MB. Free memory is still 314.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:48:51,557 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.17ms. Allocated memory is still 532.7MB. Free memory was 490.3MB in the beginning and 469.8MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-11-30 04:48:51,558 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.13ms. Allocated memory is still 532.7MB. Free memory was 469.8MB in the beginning and 467.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:48:51,558 INFO L158 Benchmark]: Boogie Preprocessor took 26.30ms. Allocated memory is still 532.7MB. Free memory was 467.7MB in the beginning and 466.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:48:51,558 INFO L158 Benchmark]: RCFGBuilder took 292.86ms. Allocated memory is still 532.7MB. Free memory was 465.9MB in the beginning and 451.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-11-30 04:48:51,558 INFO L158 Benchmark]: TraceAbstraction took 1213.34ms. Allocated memory is still 532.7MB. Free memory was 450.5MB in the beginning and 379.1MB in the end (delta: 71.4MB). Peak memory consumption was 73.5MB. Max. memory is 16.0GB. [2023-11-30 04:48:51,559 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 362.8MB. Free memory is still 314.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 379.17ms. Allocated memory is still 532.7MB. Free memory was 490.3MB in the beginning and 469.8MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 49.13ms. Allocated memory is still 532.7MB. Free memory was 469.8MB in the beginning and 467.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 26.30ms. Allocated memory is still 532.7MB. Free memory was 467.7MB in the beginning and 466.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 292.86ms. Allocated memory is still 532.7MB. Free memory was 465.9MB in the beginning and 451.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * TraceAbstraction took 1213.34ms. Allocated memory is still 532.7MB. Free memory was 450.5MB in the beginning and 379.1MB in the end (delta: 71.4MB). Peak memory consumption was 73.5MB. 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 128 locations, 9 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.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 72 IncrementalHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 39 mSDtfsCounter, 72 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=6, InterpolantAutomatonStates: 18, 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.4s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 270 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 04:48:51,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...