/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/weaver/bench-exp2x6.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:19:21,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:19:21,606 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:19:21,642 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:19:21,643 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:19:21,643 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:19:21,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:19:21,644 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:19:21,644 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:19:21,647 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:19:21,648 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:19:21,648 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:19:21,648 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:19:21,649 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:19:21,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:19:21,649 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:19:21,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:19:21,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:19:21,650 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:19:21,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:19:21,650 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:19:21,651 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:19:21,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:19:21,651 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:19:21,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:19:21,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:19:21,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:19:21,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:19:21,652 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:19:21,653 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:19:21,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:19:21,653 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:19:21,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:19:21,654 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:19:21,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:19:21,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:19:21,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:19:21,845 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:19:21,846 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:19:21,847 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c [2023-12-05 21:19:23,030 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:19:23,184 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:19:23,184 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c [2023-12-05 21:19:23,192 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/129454350/abfc42fc117c45df96187a3fb6725761/FLAGbe02c3364 [2023-12-05 21:19:23,207 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/129454350/abfc42fc117c45df96187a3fb6725761 [2023-12-05 21:19:23,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:19:23,210 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:19:23,213 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:19:23,213 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:19:23,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:19:23,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:19:23" (1/1) ... [2023-12-05 21:19:23,218 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23f938c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:23, skipping insertion in model container [2023-12-05 21:19:23,218 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:19:23" (1/1) ... [2023-12-05 21:19:23,239 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:19:23,391 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:19:23,400 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:19:23,433 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:19:23,444 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:19:23,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:23 WrapperNode [2023-12-05 21:19:23,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:19:23,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:19:23,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:19:23,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:19:23,450 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:19:23" (1/1) ... [2023-12-05 21:19:23,464 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:19:23" (1/1) ... [2023-12-05 21:19:23,485 INFO L138 Inliner]: procedures = 20, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 97 [2023-12-05 21:19:23,486 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:19:23,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:19:23,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:19:23,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:19:23,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:23" (1/1) ... [2023-12-05 21:19:23,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:23" (1/1) ... [2023-12-05 21:19:23,503 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:23" (1/1) ... [2023-12-05 21:19:23,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:23" (1/1) ... [2023-12-05 21:19:23,510 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:23" (1/1) ... [2023-12-05 21:19:23,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:23" (1/1) ... [2023-12-05 21:19:23,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:23" (1/1) ... [2023-12-05 21:19:23,514 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:23" (1/1) ... [2023-12-05 21:19:23,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:19:23,516 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:19:23,516 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:19:23,517 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:19:23,517 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:23" (1/1) ... [2023-12-05 21:19:23,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:19:23,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:19:23,539 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:19:23,555 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:19:23,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:19:23,599 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-05 21:19:23,599 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-05 21:19:23,599 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-05 21:19:23,599 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-05 21:19:23,599 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-05 21:19:23,599 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-05 21:19:23,599 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-12-05 21:19:23,599 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-12-05 21:19:23,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:19:23,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:19:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:19:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:19:23,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:19:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:19:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:19:23,601 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:19:23,684 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:19:23,685 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:19:23,893 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:19:23,917 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:19:23,917 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-05 21:19:23,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:19:23 BoogieIcfgContainer [2023-12-05 21:19:23,918 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:19:23,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:19:23,923 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:19:23,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:19:23,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:19:23" (1/3) ... [2023-12-05 21:19:23,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf4b6f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:19:23, skipping insertion in model container [2023-12-05 21:19:23,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:23" (2/3) ... [2023-12-05 21:19:23,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf4b6f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:19:23, skipping insertion in model container [2023-12-05 21:19:23,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:19:23" (3/3) ... [2023-12-05 21:19:23,927 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x6.wvr.c [2023-12-05 21:19:23,950 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:19:23,951 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-12-05 21:19:23,951 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:19:24,057 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-12-05 21:19:24,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 160 transitions, 348 flow [2023-12-05 21:19:24,144 INFO L124 PetriNetUnfolderBase]: 10/156 cut-off events. [2023-12-05 21:19:24,144 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-12-05 21:19:24,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 156 events. 10/156 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 156 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2023-12-05 21:19:24,150 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 160 transitions, 348 flow [2023-12-05 21:19:24,153 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 130 transitions, 281 flow [2023-12-05 21:19:24,162 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:19:24,167 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;@cb5de62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:19:24,167 INFO L363 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2023-12-05 21:19:24,176 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:19:24,176 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2023-12-05 21:19:24,176 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:19:24,176 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:24,177 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:19:24,177 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:19:24,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:24,181 INFO L85 PathProgramCache]: Analyzing trace with hash 2056932053, now seen corresponding path program 1 times [2023-12-05 21:19:24,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:24,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971531357] [2023-12-05 21:19:24,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:24,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:24,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:19:24,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:24,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971531357] [2023-12-05 21:19:24,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971531357] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:24,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:24,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:19:24,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032700145] [2023-12-05 21:19:24,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:24,785 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:19:24,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:24,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:19:24,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:19:24,819 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 160 [2023-12-05 21:19:24,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 130 transitions, 281 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:24,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:24,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 160 [2023-12-05 21:19:24,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:24,941 INFO L124 PetriNetUnfolderBase]: 4/123 cut-off events. [2023-12-05 21:19:24,942 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-05 21:19:24,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 123 events. 4/123 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 127 event pairs, 0 based on Foata normal form. 49/159 useless extension candidates. Maximal degree in co-relation 119. Up to 27 conditions per place. [2023-12-05 21:19:24,947 INFO L140 encePairwiseOnDemand]: 152/160 looper letters, 30 selfloop transitions, 1 changer transitions 1/123 dead transitions. [2023-12-05 21:19:24,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 123 transitions, 329 flow [2023-12-05 21:19:24,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:19:24,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:19:24,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2023-12-05 21:19:24,962 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7854166666666667 [2023-12-05 21:19:24,963 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 377 transitions. [2023-12-05 21:19:24,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 377 transitions. [2023-12-05 21:19:24,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:24,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 377 transitions. [2023-12-05 21:19:24,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 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:19:24,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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:19:24,977 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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:19:24,979 INFO L308 CegarLoopForPetriNet]: 134 programPoint places, 0 predicate places. [2023-12-05 21:19:24,980 INFO L500 AbstractCegarLoop]: Abstraction has has 134 places, 123 transitions, 329 flow [2023-12-05 21:19:24,980 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:24,980 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:24,980 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:19:24,981 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:19:24,981 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:19:24,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:24,982 INFO L85 PathProgramCache]: Analyzing trace with hash 2056932054, now seen corresponding path program 1 times [2023-12-05 21:19:24,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:24,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121405971] [2023-12-05 21:19:24,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:24,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:25,265 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:19:25,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:25,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121405971] [2023-12-05 21:19:25,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121405971] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:25,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:25,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:19:25,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321592959] [2023-12-05 21:19:25,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:25,267 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:19:25,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:25,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:19:25,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:19:25,269 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 160 [2023-12-05 21:19:25,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 123 transitions, 329 flow. Second operand has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 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:19:25,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:25,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 160 [2023-12-05 21:19:25,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:25,347 INFO L124 PetriNetUnfolderBase]: 4/121 cut-off events. [2023-12-05 21:19:25,348 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-12-05 21:19:25,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 121 events. 4/121 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 121 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 138. Up to 31 conditions per place. [2023-12-05 21:19:25,351 INFO L140 encePairwiseOnDemand]: 157/160 looper letters, 34 selfloop transitions, 1 changer transitions 1/121 dead transitions. [2023-12-05 21:19:25,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 121 transitions, 391 flow [2023-12-05 21:19:25,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:19:25,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:19:25,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-12-05 21:19:25,354 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7458333333333333 [2023-12-05 21:19:25,354 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-12-05 21:19:25,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-12-05 21:19:25,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:25,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-12-05 21:19:25,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:25,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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:19:25,357 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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:19:25,358 INFO L308 CegarLoopForPetriNet]: 134 programPoint places, 0 predicate places. [2023-12-05 21:19:25,358 INFO L500 AbstractCegarLoop]: Abstraction has has 134 places, 121 transitions, 391 flow [2023-12-05 21:19:25,358 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 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:19:25,358 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:25,358 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:19:25,359 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:19:25,359 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:19:25,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:25,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1202542380, now seen corresponding path program 1 times [2023-12-05 21:19:25,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:25,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878759333] [2023-12-05 21:19:25,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:25,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:25,564 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:19:25,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:25,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878759333] [2023-12-05 21:19:25,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878759333] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:25,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:25,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:19:25,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546359920] [2023-12-05 21:19:25,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:25,568 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:19:25,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:25,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:19:25,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:19:25,571 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 160 [2023-12-05 21:19:25,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 121 transitions, 391 flow. Second operand has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 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:19:25,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:25,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 160 [2023-12-05 21:19:25,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:25,629 INFO L124 PetriNetUnfolderBase]: 4/117 cut-off events. [2023-12-05 21:19:25,629 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-12-05 21:19:25,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 117 events. 4/117 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 109 event pairs, 0 based on Foata normal form. 2/110 useless extension candidates. Maximal degree in co-relation 152. Up to 27 conditions per place. [2023-12-05 21:19:25,630 INFO L140 encePairwiseOnDemand]: 155/160 looper letters, 30 selfloop transitions, 1 changer transitions 1/117 dead transitions. [2023-12-05 21:19:25,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 117 transitions, 433 flow [2023-12-05 21:19:25,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:19:25,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:19:25,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-12-05 21:19:25,631 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7416666666666667 [2023-12-05 21:19:25,631 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-12-05 21:19:25,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-12-05 21:19:25,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:25,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-12-05 21:19:25,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:25,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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:19:25,634 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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:19:25,635 INFO L308 CegarLoopForPetriNet]: 134 programPoint places, -2 predicate places. [2023-12-05 21:19:25,635 INFO L500 AbstractCegarLoop]: Abstraction has has 132 places, 117 transitions, 433 flow [2023-12-05 21:19:25,636 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 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:19:25,636 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:25,636 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:19:25,636 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:19:25,636 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:19:25,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:25,637 INFO L85 PathProgramCache]: Analyzing trace with hash -418415929, now seen corresponding path program 1 times [2023-12-05 21:19:25,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:25,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666388984] [2023-12-05 21:19:25,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:25,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:25,721 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:19:25,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:25,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666388984] [2023-12-05 21:19:25,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666388984] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:25,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:25,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:19:25,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784012240] [2023-12-05 21:19:25,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:25,722 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:19:25,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:25,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:19:25,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:19:25,723 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 160 [2023-12-05 21:19:25,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 117 transitions, 433 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:25,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:25,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 160 [2023-12-05 21:19:25,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:25,756 INFO L124 PetriNetUnfolderBase]: 4/115 cut-off events. [2023-12-05 21:19:25,756 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2023-12-05 21:19:25,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 115 events. 4/115 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 103 event pairs, 0 based on Foata normal form. 2/110 useless extension candidates. Maximal degree in co-relation 165. Up to 25 conditions per place. [2023-12-05 21:19:25,757 INFO L140 encePairwiseOnDemand]: 157/160 looper letters, 25 selfloop transitions, 1 changer transitions 1/115 dead transitions. [2023-12-05 21:19:25,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 115 transitions, 473 flow [2023-12-05 21:19:25,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:19:25,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:19:25,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-12-05 21:19:25,758 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7895833333333333 [2023-12-05 21:19:25,758 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-12-05 21:19:25,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-12-05 21:19:25,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:25,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-12-05 21:19:25,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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:19:25,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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:19:25,760 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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:19:25,761 INFO L308 CegarLoopForPetriNet]: 134 programPoint places, -2 predicate places. [2023-12-05 21:19:25,761 INFO L500 AbstractCegarLoop]: Abstraction has has 132 places, 115 transitions, 473 flow [2023-12-05 21:19:25,761 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:25,761 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:25,761 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:19:25,761 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:19:25,762 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:19:25,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:25,762 INFO L85 PathProgramCache]: Analyzing trace with hash -418415930, now seen corresponding path program 1 times [2023-12-05 21:19:25,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:25,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267298216] [2023-12-05 21:19:25,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:25,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:25,819 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:19:25,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:25,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267298216] [2023-12-05 21:19:25,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267298216] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:25,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:25,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:19:25,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595287334] [2023-12-05 21:19:25,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:25,820 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:19:25,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:25,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:19:25,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:19:25,821 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 160 [2023-12-05 21:19:25,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 115 transitions, 473 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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:19:25,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:25,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 160 [2023-12-05 21:19:25,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:25,852 INFO L124 PetriNetUnfolderBase]: 4/113 cut-off events. [2023-12-05 21:19:25,853 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2023-12-05 21:19:25,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 113 events. 4/113 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 100 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 176. Up to 23 conditions per place. [2023-12-05 21:19:25,854 INFO L140 encePairwiseOnDemand]: 157/160 looper letters, 24 selfloop transitions, 1 changer transitions 1/113 dead transitions. [2023-12-05 21:19:25,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 113 transitions, 503 flow [2023-12-05 21:19:25,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:19:25,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:19:25,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-12-05 21:19:25,855 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7625 [2023-12-05 21:19:25,855 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-12-05 21:19:25,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-12-05 21:19:25,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:25,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-12-05 21:19:25,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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:19:25,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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:19:25,857 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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:19:25,857 INFO L308 CegarLoopForPetriNet]: 134 programPoint places, -2 predicate places. [2023-12-05 21:19:25,857 INFO L500 AbstractCegarLoop]: Abstraction has has 132 places, 113 transitions, 503 flow [2023-12-05 21:19:25,858 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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:19:25,858 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:25,858 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, 1, 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:19:25,858 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:19:25,858 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:19:25,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:25,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1386193026, now seen corresponding path program 1 times [2023-12-05 21:19:25,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:25,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305339698] [2023-12-05 21:19:25,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:25,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:25,904 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:19:25,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:25,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305339698] [2023-12-05 21:19:25,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305339698] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:25,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:25,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:19:25,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124422094] [2023-12-05 21:19:25,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:25,906 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:19:25,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:25,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:19:25,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:19:25,907 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 160 [2023-12-05 21:19:25,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 113 transitions, 503 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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:19:25,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:25,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 160 [2023-12-05 21:19:25,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:25,941 INFO L124 PetriNetUnfolderBase]: 4/111 cut-off events. [2023-12-05 21:19:25,941 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2023-12-05 21:19:25,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 111 events. 4/111 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 2/108 useless extension candidates. Maximal degree in co-relation 187. Up to 21 conditions per place. [2023-12-05 21:19:25,942 INFO L140 encePairwiseOnDemand]: 157/160 looper letters, 24 selfloop transitions, 1 changer transitions 1/111 dead transitions. [2023-12-05 21:19:25,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 111 transitions, 533 flow [2023-12-05 21:19:25,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:19:25,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:19:25,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-12-05 21:19:25,944 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7625 [2023-12-05 21:19:25,944 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-12-05 21:19:25,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-12-05 21:19:25,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:25,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-12-05 21:19:25,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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:19:25,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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:19:25,946 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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:19:25,947 INFO L308 CegarLoopForPetriNet]: 134 programPoint places, -2 predicate places. [2023-12-05 21:19:25,947 INFO L500 AbstractCegarLoop]: Abstraction has has 132 places, 111 transitions, 533 flow [2023-12-05 21:19:25,947 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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:19:25,947 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:25,947 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, 1, 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:19:25,947 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:19:25,947 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:19:25,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:25,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1386193027, now seen corresponding path program 1 times [2023-12-05 21:19:25,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:25,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101320298] [2023-12-05 21:19:25,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:25,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:26,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:19:26,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:26,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101320298] [2023-12-05 21:19:26,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101320298] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:26,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:26,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:19:26,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595889180] [2023-12-05 21:19:26,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:26,044 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:19:26,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:26,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:19:26,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:19:26,045 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 160 [2023-12-05 21:19:26,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 111 transitions, 533 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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:19:26,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:26,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 160 [2023-12-05 21:19:26,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:26,075 INFO L124 PetriNetUnfolderBase]: 4/109 cut-off events. [2023-12-05 21:19:26,076 INFO L125 PetriNetUnfolderBase]: For 254/254 co-relation queries the response was YES. [2023-12-05 21:19:26,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 109 events. 4/109 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 87 event pairs, 0 based on Foata normal form. 2/106 useless extension candidates. Maximal degree in co-relation 196. Up to 19 conditions per place. [2023-12-05 21:19:26,077 INFO L140 encePairwiseOnDemand]: 157/160 looper letters, 0 selfloop transitions, 0 changer transitions 109/109 dead transitions. [2023-12-05 21:19:26,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 109 transitions, 557 flow [2023-12-05 21:19:26,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:19:26,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:19:26,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-12-05 21:19:26,078 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.78125 [2023-12-05 21:19:26,078 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-12-05 21:19:26,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-12-05 21:19:26,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:26,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-12-05 21:19:26,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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:19:26,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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:19:26,080 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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:19:26,081 INFO L308 CegarLoopForPetriNet]: 134 programPoint places, -2 predicate places. [2023-12-05 21:19:26,081 INFO L500 AbstractCegarLoop]: Abstraction has has 132 places, 109 transitions, 557 flow [2023-12-05 21:19:26,081 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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:19:26,087 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bench-exp2x6.wvr.c_BEv2_AllErrorsAtOnce [2023-12-05 21:19:26,105 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 20 remaining) [2023-12-05 21:19:26,106 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2023-12-05 21:19:26,106 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2023-12-05 21:19:26,106 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2023-12-05 21:19:26,106 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2023-12-05 21:19:26,106 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2023-12-05 21:19:26,106 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2023-12-05 21:19:26,106 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2023-12-05 21:19:26,107 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2023-12-05 21:19:26,107 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2023-12-05 21:19:26,107 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2023-12-05 21:19:26,107 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2023-12-05 21:19:26,107 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2023-12-05 21:19:26,107 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2023-12-05 21:19:26,107 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2023-12-05 21:19:26,108 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2023-12-05 21:19:26,108 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 20 remaining) [2023-12-05 21:19:26,108 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 20 remaining) [2023-12-05 21:19:26,108 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 20 remaining) [2023-12-05 21:19:26,108 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 20 remaining) [2023-12-05 21:19:26,108 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:19:26,109 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:19:26,111 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:19:26,111 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:19:26,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:19:26 BasicIcfg [2023-12-05 21:19:26,115 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:19:26,116 INFO L158 Benchmark]: Toolchain (without parser) took 2905.50ms. Allocated memory was 192.9MB in the beginning and 336.6MB in the end (delta: 143.7MB). Free memory was 130.4MB in the beginning and 255.4MB in the end (delta: -125.0MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-05 21:19:26,116 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory was 142.3MB in the beginning and 142.2MB in the end (delta: 133.1kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:19:26,116 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.56ms. Allocated memory is still 192.9MB. Free memory was 130.1MB in the beginning and 118.8MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-05 21:19:26,117 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.77ms. Allocated memory is still 192.9MB. Free memory was 118.8MB in the beginning and 117.0MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-05 21:19:26,117 INFO L158 Benchmark]: Boogie Preprocessor took 29.42ms. Allocated memory is still 192.9MB. Free memory was 117.0MB in the beginning and 115.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:19:26,117 INFO L158 Benchmark]: RCFGBuilder took 402.05ms. Allocated memory was 192.9MB in the beginning and 253.8MB in the end (delta: 60.8MB). Free memory was 115.2MB in the beginning and 211.8MB in the end (delta: -96.6MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. [2023-12-05 21:19:26,118 INFO L158 Benchmark]: TraceAbstraction took 2192.87ms. Allocated memory was 253.8MB in the beginning and 336.6MB in the end (delta: 82.8MB). Free memory was 210.7MB in the beginning and 255.4MB in the end (delta: -44.6MB). Peak memory consumption was 38.2MB. Max. memory is 8.0GB. [2023-12-05 21:19:26,119 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory was 142.3MB in the beginning and 142.2MB in the end (delta: 133.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 231.56ms. Allocated memory is still 192.9MB. Free memory was 130.1MB in the beginning and 118.8MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.77ms. Allocated memory is still 192.9MB. Free memory was 118.8MB in the beginning and 117.0MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.42ms. Allocated memory is still 192.9MB. Free memory was 117.0MB in the beginning and 115.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 402.05ms. Allocated memory was 192.9MB in the beginning and 253.8MB in the end (delta: 60.8MB). Free memory was 115.2MB in the beginning and 211.8MB in the end (delta: -96.6MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. * TraceAbstraction took 2192.87ms. Allocated memory was 253.8MB in the beginning and 336.6MB in the end (delta: 82.8MB). Free memory was 210.7MB in the beginning and 255.4MB in the end (delta: -44.6MB). Peak memory consumption was 38.2MB. 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 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 191 locations, 20 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: 2.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 142 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 142 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 194 IncrementalHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 44 mSDtfsCounter, 194 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=557occurred in iteration=7, InterpolantAutomatonStates: 21, 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, 1.1s InterpolantComputationTime, 353 NumberOfCodeBlocks, 353 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 346 ConstructedInterpolants, 0 QuantifiedInterpolants, 1895 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:19:26,135 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...