/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:10:50,878 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:10:50,927 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 21:10:50,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:10:50,955 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:10:50,955 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:10:50,955 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:10:50,956 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:10:50,956 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:10:50,956 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:10:50,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:10:50,957 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:10:50,957 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:10:50,957 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:10:50,957 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:10:50,958 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:10:50,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:10:50,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:10:50,958 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:10:50,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:10:50,959 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:10:50,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:10:50,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:10:50,960 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:10:50,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:10:50,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:10:50,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:10:50,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:10:50,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:10:50,961 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:10:50,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:10:50,961 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:10:50,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:10:50,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 21:10:51,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:10:51,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:10:51,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:10:51,114 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:10:51,115 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:10:51,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_tso.i [2023-12-05 21:10:52,144 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:10:52,379 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:10:52,380 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_tso.i [2023-12-05 21:10:52,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1b8c4e22/d7d016b183894c96985b8b9165cd4924/FLAG5bab0d80c [2023-12-05 21:10:52,407 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1b8c4e22/d7d016b183894c96985b8b9165cd4924 [2023-12-05 21:10:52,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:10:52,410 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:10:52,411 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:10:52,411 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:10:52,414 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:10:52,414 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:10:52" (1/1) ... [2023-12-05 21:10:52,415 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fecae41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:52, skipping insertion in model container [2023-12-05 21:10:52,415 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:10:52" (1/1) ... [2023-12-05 21:10:52,445 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:10:52,673 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:10:52,682 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:10:52,726 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:10:52,752 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:10:52,753 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:10:52,758 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:10:52,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:52 WrapperNode [2023-12-05 21:10:52,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:10:52,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:10:52,762 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:10:52,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:10:52,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:52" (1/1) ... [2023-12-05 21:10:52,792 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:52" (1/1) ... [2023-12-05 21:10:52,812 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 73 [2023-12-05 21:10:52,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:10:52,813 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:10:52,813 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:10:52,813 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:10:52,818 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:52" (1/1) ... [2023-12-05 21:10:52,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:52" (1/1) ... [2023-12-05 21:10:52,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:52" (1/1) ... [2023-12-05 21:10:52,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:52" (1/1) ... [2023-12-05 21:10:52,836 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:52" (1/1) ... [2023-12-05 21:10:52,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:52" (1/1) ... [2023-12-05 21:10:52,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:52" (1/1) ... [2023-12-05 21:10:52,839 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:52" (1/1) ... [2023-12-05 21:10:52,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:10:52,849 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:10:52,849 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:10:52,849 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:10:52,849 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:52" (1/1) ... [2023-12-05 21:10:52,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:10:52,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:10:52,904 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 21:10:52,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 21:10:52,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:10:52,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:10:52,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:10:52,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:10:52,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:10:52,931 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-05 21:10:52,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-05 21:10:52,931 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-05 21:10:52,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-05 21:10:52,931 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-05 21:10:52,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-05 21:10:52,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:10:52,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:10:52,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:10:52,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:10:52,933 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:10:53,045 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:10:53,051 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:10:53,189 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:10:53,196 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:10:53,197 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:10:53,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:10:53 BoogieIcfgContainer [2023-12-05 21:10:53,198 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:10:53,200 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:10:53,200 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:10:53,202 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:10:53,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:10:52" (1/3) ... [2023-12-05 21:10:53,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@460c9a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:10:53, skipping insertion in model container [2023-12-05 21:10:53,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:52" (2/3) ... [2023-12-05 21:10:53,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@460c9a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:10:53, skipping insertion in model container [2023-12-05 21:10:53,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:10:53" (3/3) ... [2023-12-05 21:10:53,204 INFO L112 eAbstractionObserver]: Analyzing ICFG safe034_tso.i [2023-12-05 21:10:53,217 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:10:53,217 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-12-05 21:10:53,217 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:10:53,256 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:10:53,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 104 transitions, 220 flow [2023-12-05 21:10:53,337 INFO L124 PetriNetUnfolderBase]: 3/101 cut-off events. [2023-12-05 21:10:53,337 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:10:53,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 101 events. 3/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2023-12-05 21:10:53,343 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 104 transitions, 220 flow [2023-12-05 21:10:53,346 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 55 transitions, 116 flow [2023-12-05 21:10:53,355 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:10:53,359 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;@284dce51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:10:53,360 INFO L363 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-12-05 21:10:53,364 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:10:53,364 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2023-12-05 21:10:53,364 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:10:53,364 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:53,365 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:53,365 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-12-05 21:10:53,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:53,373 INFO L85 PathProgramCache]: Analyzing trace with hash 2055450917, now seen corresponding path program 1 times [2023-12-05 21:10:53,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:53,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550789720] [2023-12-05 21:10:53,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:53,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:53,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:53,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:53,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550789720] [2023-12-05 21:10:53,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550789720] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:53,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:53,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:53,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735965981] [2023-12-05 21:10:53,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:53,611 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:53,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:53,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:53,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:53,644 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 104 [2023-12-05 21:10:53,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 116 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-12-05 21:10:53,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:53,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 104 [2023-12-05 21:10:53,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:53,680 INFO L124 PetriNetUnfolderBase]: 0/54 cut-off events. [2023-12-05 21:10:53,680 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:10:53,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 54 events. 0/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 0. Up to 10 conditions per place. [2023-12-05 21:10:53,681 INFO L140 encePairwiseOnDemand]: 102/104 looper letters, 13 selfloop transitions, 1 changer transitions 0/54 dead transitions. [2023-12-05 21:10:53,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 54 transitions, 142 flow [2023-12-05 21:10:53,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:53,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:53,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2023-12-05 21:10:53,690 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7980769230769231 [2023-12-05 21:10:53,691 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 249 transitions. [2023-12-05 21:10:53,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 249 transitions. [2023-12-05 21:10:53,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:53,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 249 transitions. [2023-12-05 21:10:53,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:53,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:53,699 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:53,702 INFO L308 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2023-12-05 21:10:53,702 INFO L500 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 142 flow [2023-12-05 21:10:53,702 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-12-05 21:10:53,703 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:53,703 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:53,703 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:10:53,703 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-12-05 21:10:53,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:53,704 INFO L85 PathProgramCache]: Analyzing trace with hash 2055450918, now seen corresponding path program 1 times [2023-12-05 21:10:53,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:53,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676682235] [2023-12-05 21:10:53,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:53,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:53,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:53,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:53,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676682235] [2023-12-05 21:10:53,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676682235] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:53,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:53,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:53,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865592204] [2023-12-05 21:10:53,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:53,840 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:53,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:53,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:53,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:53,841 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 104 [2023-12-05 21:10:53,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 142 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-12-05 21:10:53,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:53,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 104 [2023-12-05 21:10:53,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:53,862 INFO L124 PetriNetUnfolderBase]: 0/53 cut-off events. [2023-12-05 21:10:53,862 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-12-05 21:10:53,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 53 events. 0/53 cut-off events. For 7/7 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/53 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2023-12-05 21:10:53,863 INFO L140 encePairwiseOnDemand]: 102/104 looper letters, 11 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2023-12-05 21:10:53,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 53 transitions, 162 flow [2023-12-05 21:10:53,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:53,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:53,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 256 transitions. [2023-12-05 21:10:53,865 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8205128205128205 [2023-12-05 21:10:53,865 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 256 transitions. [2023-12-05 21:10:53,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 256 transitions. [2023-12-05 21:10:53,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:53,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 256 transitions. [2023-12-05 21:10:53,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:53,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:53,868 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:53,868 INFO L308 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2023-12-05 21:10:53,868 INFO L500 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 162 flow [2023-12-05 21:10:53,869 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-12-05 21:10:53,869 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:53,869 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:53,869 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:10:53,869 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-12-05 21:10:53,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:53,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1299714558, now seen corresponding path program 1 times [2023-12-05 21:10:53,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:53,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101209444] [2023-12-05 21:10:53,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:53,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:53,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:53,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:53,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101209444] [2023-12-05 21:10:53,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101209444] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:53,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:53,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:53,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490681941] [2023-12-05 21:10:53,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:53,958 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:53,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:53,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:53,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:53,959 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 104 [2023-12-05 21:10:53,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 162 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-12-05 21:10:53,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:53,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 104 [2023-12-05 21:10:53,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:53,991 INFO L124 PetriNetUnfolderBase]: 0/52 cut-off events. [2023-12-05 21:10:53,991 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-12-05 21:10:53,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 52 events. 0/52 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 37 event pairs, 0 based on Foata normal form. 1/53 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2023-12-05 21:10:53,992 INFO L140 encePairwiseOnDemand]: 102/104 looper letters, 11 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2023-12-05 21:10:53,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 52 transitions, 182 flow [2023-12-05 21:10:53,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:53,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:53,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 256 transitions. [2023-12-05 21:10:53,993 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8205128205128205 [2023-12-05 21:10:53,993 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 256 transitions. [2023-12-05 21:10:53,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 256 transitions. [2023-12-05 21:10:53,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:53,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 256 transitions. [2023-12-05 21:10:53,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:53,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:53,996 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:53,996 INFO L308 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2023-12-05 21:10:53,996 INFO L500 AbstractCegarLoop]: Abstraction has has 65 places, 52 transitions, 182 flow [2023-12-05 21:10:53,997 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-12-05 21:10:53,997 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:53,997 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:53,997 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:10:53,997 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-12-05 21:10:53,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:53,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1299714559, now seen corresponding path program 1 times [2023-12-05 21:10:53,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:53,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014871842] [2023-12-05 21:10:53,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:53,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:54,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:54,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:54,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014871842] [2023-12-05 21:10:54,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014871842] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:54,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:54,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:54,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90255247] [2023-12-05 21:10:54,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:54,039 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:54,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:54,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:54,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:54,040 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 104 [2023-12-05 21:10:54,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 52 transitions, 182 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-12-05 21:10:54,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:54,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 104 [2023-12-05 21:10:54,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:54,059 INFO L124 PetriNetUnfolderBase]: 0/51 cut-off events. [2023-12-05 21:10:54,060 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-12-05 21:10:54,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 51 events. 0/51 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 1/52 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2023-12-05 21:10:54,060 INFO L140 encePairwiseOnDemand]: 102/104 looper letters, 11 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2023-12-05 21:10:54,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 51 transitions, 200 flow [2023-12-05 21:10:54,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:54,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:54,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 247 transitions. [2023-12-05 21:10:54,064 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7916666666666666 [2023-12-05 21:10:54,064 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 247 transitions. [2023-12-05 21:10:54,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 247 transitions. [2023-12-05 21:10:54,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:54,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 247 transitions. [2023-12-05 21:10:54,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:54,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:54,066 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:54,067 INFO L308 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2023-12-05 21:10:54,067 INFO L500 AbstractCegarLoop]: Abstraction has has 66 places, 51 transitions, 200 flow [2023-12-05 21:10:54,067 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-12-05 21:10:54,067 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:54,067 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:54,068 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:10:54,068 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-12-05 21:10:54,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:54,068 INFO L85 PathProgramCache]: Analyzing trace with hash 2046283149, now seen corresponding path program 1 times [2023-12-05 21:10:54,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:54,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458240036] [2023-12-05 21:10:54,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:54,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:54,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:54,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458240036] [2023-12-05 21:10:54,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458240036] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:54,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:54,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:54,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966635221] [2023-12-05 21:10:54,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:54,158 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:54,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:54,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:54,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:54,159 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 104 [2023-12-05 21:10:54,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 51 transitions, 200 flow. Second operand has 3 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-12-05 21:10:54,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:54,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 104 [2023-12-05 21:10:54,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:54,185 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2023-12-05 21:10:54,185 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2023-12-05 21:10:54,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 50 events. 0/50 cut-off events. For 76/76 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 11 conditions per place. [2023-12-05 21:10:54,187 INFO L140 encePairwiseOnDemand]: 102/104 looper letters, 11 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2023-12-05 21:10:54,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 50 transitions, 218 flow [2023-12-05 21:10:54,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:54,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:54,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 247 transitions. [2023-12-05 21:10:54,188 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7916666666666666 [2023-12-05 21:10:54,188 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 247 transitions. [2023-12-05 21:10:54,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 247 transitions. [2023-12-05 21:10:54,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:54,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 247 transitions. [2023-12-05 21:10:54,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:54,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:54,190 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:54,193 INFO L308 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2023-12-05 21:10:54,193 INFO L500 AbstractCegarLoop]: Abstraction has has 67 places, 50 transitions, 218 flow [2023-12-05 21:10:54,193 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-12-05 21:10:54,193 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:54,193 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:54,194 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:10:54,194 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-12-05 21:10:54,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:54,200 INFO L85 PathProgramCache]: Analyzing trace with hash 2046283150, now seen corresponding path program 1 times [2023-12-05 21:10:54,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:54,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152786694] [2023-12-05 21:10:54,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:54,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:54,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:54,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:54,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152786694] [2023-12-05 21:10:54,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152786694] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:54,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:54,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:54,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725828536] [2023-12-05 21:10:54,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:54,284 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:54,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:54,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:54,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:54,286 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 104 [2023-12-05 21:10:54,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 50 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:54,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:54,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 104 [2023-12-05 21:10:54,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:54,313 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2023-12-05 21:10:54,313 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2023-12-05 21:10:54,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 49 events. 0/49 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 1/50 useless extension candidates. Maximal degree in co-relation 0. Up to 11 conditions per place. [2023-12-05 21:10:54,313 INFO L140 encePairwiseOnDemand]: 102/104 looper letters, 0 selfloop transitions, 0 changer transitions 49/49 dead transitions. [2023-12-05 21:10:54,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 49 transitions, 230 flow [2023-12-05 21:10:54,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:54,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:54,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2023-12-05 21:10:54,314 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8141025641025641 [2023-12-05 21:10:54,315 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 254 transitions. [2023-12-05 21:10:54,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 254 transitions. [2023-12-05 21:10:54,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:54,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 254 transitions. [2023-12-05 21:10:54,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:54,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:54,316 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:54,318 INFO L308 CegarLoopForPetriNet]: 62 programPoint places, 6 predicate places. [2023-12-05 21:10:54,319 INFO L500 AbstractCegarLoop]: Abstraction has has 68 places, 49 transitions, 230 flow [2023-12-05 21:10:54,319 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:54,326 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe034_tso.i_BEv2_AllErrorsAtOnce [2023-12-05 21:10:54,356 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 9 remaining) [2023-12-05 21:10:54,358 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2023-12-05 21:10:54,359 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2023-12-05 21:10:54,359 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2023-12-05 21:10:54,359 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2023-12-05 21:10:54,359 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2023-12-05 21:10:54,359 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2023-12-05 21:10:54,360 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 9 remaining) [2023-12-05 21:10:54,360 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 9 remaining) [2023-12-05 21:10:54,360 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:10:54,361 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-05 21:10:54,363 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:10:54,363 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:10:54,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:10:54 BasicIcfg [2023-12-05 21:10:54,371 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:10:54,376 INFO L158 Benchmark]: Toolchain (without parser) took 1960.92ms. Allocated memory is still 255.9MB. Free memory was 209.4MB in the beginning and 126.0MB in the end (delta: 83.3MB). Peak memory consumption was 84.4MB. Max. memory is 8.0GB. [2023-12-05 21:10:54,377 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:10:54,378 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.72ms. Allocated memory is still 255.9MB. Free memory was 209.4MB in the beginning and 188.9MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-05 21:10:54,378 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.76ms. Allocated memory is still 255.9MB. Free memory was 188.9MB in the beginning and 186.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:10:54,378 INFO L158 Benchmark]: Boogie Preprocessor took 35.39ms. Allocated memory is still 255.9MB. Free memory was 186.8MB in the beginning and 185.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-05 21:10:54,378 INFO L158 Benchmark]: RCFGBuilder took 349.66ms. Allocated memory is still 255.9MB. Free memory was 185.3MB in the beginning and 170.0MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-05 21:10:54,380 INFO L158 Benchmark]: TraceAbstraction took 1170.94ms. Allocated memory is still 255.9MB. Free memory was 169.5MB in the beginning and 126.0MB in the end (delta: 43.5MB). Peak memory consumption was 44.5MB. Max. memory is 8.0GB. [2023-12-05 21:10:54,382 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 349.72ms. Allocated memory is still 255.9MB. Free memory was 209.4MB in the beginning and 188.9MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.76ms. Allocated memory is still 255.9MB. Free memory was 188.9MB in the beginning and 186.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.39ms. Allocated memory is still 255.9MB. Free memory was 186.8MB in the beginning and 185.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 349.66ms. Allocated memory is still 255.9MB. Free memory was 185.3MB in the beginning and 170.0MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 1170.94ms. Allocated memory is still 255.9MB. Free memory was 169.5MB in the beginning and 126.0MB in the end (delta: 43.5MB). Peak memory consumption was 44.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 131 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.2s, 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=230occurred 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.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 264 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-12-05 21:10:54,396 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...