/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/weaver/parallel-ticket-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 05:35:08,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 05:35:08,479 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 05:35:08,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 05:35:08,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 05:35:08,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 05:35:08,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 05:35:08,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 05:35:08,504 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 05:35:08,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 05:35:08,508 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 05:35:08,508 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 05:35:08,508 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 05:35:08,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 05:35:08,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 05:35:08,509 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 05:35:08,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 05:35:08,509 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 05:35:08,510 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 05:35:08,510 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 05:35:08,510 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 05:35:08,510 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 05:35:08,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 05:35:08,511 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 05:35:08,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 05:35:08,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 05:35:08,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 05:35:08,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 05:35:08,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 05:35:08,512 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 05:35:08,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 05:35:08,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 05:35:08,513 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 05:35:08,513 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-11-30 05:35:08,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 05:35:08,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 05:35:08,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 05:35:08,702 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 05:35:08,702 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 05:35:08,703 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-5.wvr.c [2023-11-30 05:35:09,679 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 05:35:09,824 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 05:35:09,824 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-5.wvr.c [2023-11-30 05:35:09,829 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c420b85ee/ec247d31a4f342378cb58214610f3614/FLAGb035d2cb9 [2023-11-30 05:35:09,838 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c420b85ee/ec247d31a4f342378cb58214610f3614 [2023-11-30 05:35:09,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 05:35:09,841 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 05:35:09,841 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 05:35:09,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 05:35:09,844 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 05:35:09,845 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 05:35:09" (1/1) ... [2023-11-30 05:35:09,846 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e48b15b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:35:09, skipping insertion in model container [2023-11-30 05:35:09,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 05:35:09" (1/1) ... [2023-11-30 05:35:09,862 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 05:35:10,000 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 05:35:10,010 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 05:35:10,037 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 05:35:10,044 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 05:35:10,044 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 05:35:10,049 INFO L206 MainTranslator]: Completed translation [2023-11-30 05:35:10,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:35:10 WrapperNode [2023-11-30 05:35:10,049 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 05:35:10,050 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 05:35:10,050 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 05:35:10,050 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 05:35:10,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:35:10" (1/1) ... [2023-11-30 05:35:10,061 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:35:10" (1/1) ... [2023-11-30 05:35:10,080 INFO L138 Inliner]: procedures = 24, calls = 86, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 253 [2023-11-30 05:35:10,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 05:35:10,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 05:35:10,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 05:35:10,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 05:35:10,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:35:10" (1/1) ... [2023-11-30 05:35:10,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:35:10" (1/1) ... [2023-11-30 05:35:10,090 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:35:10" (1/1) ... [2023-11-30 05:35:10,090 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:35:10" (1/1) ... [2023-11-30 05:35:10,095 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:35:10" (1/1) ... [2023-11-30 05:35:10,096 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:35:10" (1/1) ... [2023-11-30 05:35:10,097 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:35:10" (1/1) ... [2023-11-30 05:35:10,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:35:10" (1/1) ... [2023-11-30 05:35:10,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 05:35:10,101 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 05:35:10,101 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 05:35:10,101 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 05:35:10,101 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:35:10" (1/1) ... [2023-11-30 05:35:10,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 05:35:10,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:35:10,132 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 05:35:10,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 05:35:10,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 05:35:10,155 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 05:35:10,155 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 05:35:10,155 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 05:35:10,155 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 05:35:10,155 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-30 05:35:10,156 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-30 05:35:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-30 05:35:10,156 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-30 05:35:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 05:35:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-11-30 05:35:10,156 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-11-30 05:35:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 05:35:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 05:35:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 05:35:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 05:35:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 05:35:10,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 05:35:10,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 05:35:10,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 05:35:10,158 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 05:35:10,241 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 05:35:10,242 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 05:35:10,530 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 05:35:10,590 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 05:35:10,590 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 05:35:10,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 05:35:10 BoogieIcfgContainer [2023-11-30 05:35:10,591 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 05:35:10,593 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 05:35:10,593 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 05:35:10,595 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 05:35:10,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 05:35:09" (1/3) ... [2023-11-30 05:35:10,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725190c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 05:35:10, skipping insertion in model container [2023-11-30 05:35:10,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:35:10" (2/3) ... [2023-11-30 05:35:10,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725190c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 05:35:10, skipping insertion in model container [2023-11-30 05:35:10,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 05:35:10" (3/3) ... [2023-11-30 05:35:10,597 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-5.wvr.c [2023-11-30 05:35:10,609 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 05:35:10,609 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2023-11-30 05:35:10,609 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 05:35:10,696 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2023-11-30 05:35:10,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 211 places, 197 transitions, 429 flow [2023-11-30 05:35:10,777 INFO L124 PetriNetUnfolderBase]: 2/192 cut-off events. [2023-11-30 05:35:10,777 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-30 05:35:10,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 192 events. 2/192 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 153 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 139. Up to 2 conditions per place. [2023-11-30 05:35:10,780 INFO L82 GeneralOperation]: Start removeDead. Operand has 211 places, 197 transitions, 429 flow [2023-11-30 05:35:10,783 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 178 places, 163 transitions, 353 flow [2023-11-30 05:35:10,789 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:35:10,793 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;@1cca2d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:35:10,793 INFO L363 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2023-11-30 05:35:10,802 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:35:10,802 INFO L124 PetriNetUnfolderBase]: 1/68 cut-off events. [2023-11-30 05:35:10,802 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:35:10,802 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:35:10,803 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:35:10,803 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-30 05:35:10,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:35:10,806 INFO L85 PathProgramCache]: Analyzing trace with hash 890482205, now seen corresponding path program 1 times [2023-11-30 05:35:10,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:35:10,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193587643] [2023-11-30 05:35:10,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:35:10,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:35:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:35:11,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:35:11,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:35:11,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193587643] [2023-11-30 05:35:11,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193587643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:35:11,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:35:11,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:35:11,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778856058] [2023-11-30 05:35:11,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:35:11,269 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:35:11,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:35:11,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:35:11,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:35:11,289 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 197 [2023-11-30 05:35:11,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 163 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:11,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:35:11,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 197 [2023-11-30 05:35:11,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:35:14,239 INFO L124 PetriNetUnfolderBase]: 16128/26334 cut-off events. [2023-11-30 05:35:14,240 INFO L125 PetriNetUnfolderBase]: For 979/979 co-relation queries the response was YES. [2023-11-30 05:35:14,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48610 conditions, 26334 events. 16128/26334 cut-off events. For 979/979 co-relation queries the response was YES. Maximal size of possible extension queue 1128. Compared 203952 event pairs, 16128 based on Foata normal form. 1/24462 useless extension candidates. Maximal degree in co-relation 39840. Up to 21243 conditions per place. [2023-11-30 05:35:14,454 INFO L140 encePairwiseOnDemand]: 193/197 looper letters, 51 selfloop transitions, 1 changer transitions 1/160 dead transitions. [2023-11-30 05:35:14,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 160 transitions, 451 flow [2023-11-30 05:35:14,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:35:14,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:35:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2023-11-30 05:35:14,464 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7580372250423012 [2023-11-30 05:35:14,465 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 448 transitions. [2023-11-30 05:35:14,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions. [2023-11-30 05:35:14,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:35:14,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions. [2023-11-30 05:35:14,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:14,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:14,473 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:14,475 INFO L307 CegarLoopForPetriNet]: 178 programPoint places, 0 predicate places. [2023-11-30 05:35:14,476 INFO L500 AbstractCegarLoop]: Abstraction has has 178 places, 160 transitions, 451 flow [2023-11-30 05:35:14,476 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:14,476 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:35:14,476 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:35:14,476 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 05:35:14,477 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-30 05:35:14,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:35:14,477 INFO L85 PathProgramCache]: Analyzing trace with hash 890482206, now seen corresponding path program 1 times [2023-11-30 05:35:14,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:35:14,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465256960] [2023-11-30 05:35:14,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:35:14,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:35:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:35:14,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:35:14,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:35:14,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465256960] [2023-11-30 05:35:14,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465256960] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:35:14,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:35:14,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:35:14,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893443580] [2023-11-30 05:35:14,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:35:14,761 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:35:14,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:35:14,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:35:14,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:35:14,763 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 197 [2023-11-30 05:35:14,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 160 transitions, 451 flow. Second operand has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:14,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:35:14,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 197 [2023-11-30 05:35:14,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:35:16,862 INFO L124 PetriNetUnfolderBase]: 14166/23090 cut-off events. [2023-11-30 05:35:16,862 INFO L125 PetriNetUnfolderBase]: For 4223/4735 co-relation queries the response was YES. [2023-11-30 05:35:16,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61320 conditions, 23090 events. 14166/23090 cut-off events. For 4223/4735 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 174575 event pairs, 14166 based on Foata normal form. 0/22072 useless extension candidates. Maximal degree in co-relation 45553. Up to 18936 conditions per place. [2023-11-30 05:35:17,024 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 57 selfloop transitions, 1 changer transitions 1/158 dead transitions. [2023-11-30 05:35:17,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 158 transitions, 559 flow [2023-11-30 05:35:17,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:35:17,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:35:17,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-11-30 05:35:17,026 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7258883248730964 [2023-11-30 05:35:17,027 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-11-30 05:35:17,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-11-30 05:35:17,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:35:17,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-11-30 05:35:17,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:17,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:17,029 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:17,030 INFO L307 CegarLoopForPetriNet]: 178 programPoint places, 0 predicate places. [2023-11-30 05:35:17,030 INFO L500 AbstractCegarLoop]: Abstraction has has 178 places, 158 transitions, 559 flow [2023-11-30 05:35:17,031 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:17,031 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:35:17,031 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:35:17,031 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 05:35:17,031 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-30 05:35:17,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:35:17,032 INFO L85 PathProgramCache]: Analyzing trace with hash 326705467, now seen corresponding path program 1 times [2023-11-30 05:35:17,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:35:17,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020910949] [2023-11-30 05:35:17,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:35:17,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:35:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:35:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:35:17,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:35:17,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020910949] [2023-11-30 05:35:17,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020910949] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:35:17,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:35:17,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 05:35:17,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180826875] [2023-11-30 05:35:17,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:35:17,221 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 05:35:17,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:35:17,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 05:35:17,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-30 05:35:17,223 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 197 [2023-11-30 05:35:17,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 158 transitions, 559 flow. Second operand has 5 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:17,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:35:17,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 197 [2023-11-30 05:35:17,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:35:19,402 INFO L124 PetriNetUnfolderBase]: 12624/21020 cut-off events. [2023-11-30 05:35:19,402 INFO L125 PetriNetUnfolderBase]: For 8141/9675 co-relation queries the response was YES. [2023-11-30 05:35:19,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72265 conditions, 21020 events. 12624/21020 cut-off events. For 8141/9675 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 161636 event pairs, 12624 based on Foata normal form. 258/20522 useless extension candidates. Maximal degree in co-relation 59313. Up to 16874 conditions per place. [2023-11-30 05:35:19,586 INFO L140 encePairwiseOnDemand]: 192/197 looper letters, 53 selfloop transitions, 1 changer transitions 1/154 dead transitions. [2023-11-30 05:35:19,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 154 transitions, 647 flow [2023-11-30 05:35:19,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:35:19,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:35:19,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2023-11-30 05:35:19,588 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7225042301184433 [2023-11-30 05:35:19,588 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 427 transitions. [2023-11-30 05:35:19,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions. [2023-11-30 05:35:19,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:35:19,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions. [2023-11-30 05:35:19,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:19,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:19,590 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:19,592 INFO L307 CegarLoopForPetriNet]: 178 programPoint places, -2 predicate places. [2023-11-30 05:35:19,592 INFO L500 AbstractCegarLoop]: Abstraction has has 176 places, 154 transitions, 647 flow [2023-11-30 05:35:19,592 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:19,592 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:35:19,592 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:35:19,593 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 05:35:19,593 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-30 05:35:19,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:35:19,593 INFO L85 PathProgramCache]: Analyzing trace with hash 919882347, now seen corresponding path program 1 times [2023-11-30 05:35:19,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:35:19,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169581571] [2023-11-30 05:35:19,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:35:19,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:35:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:35:19,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:35:19,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:35:19,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169581571] [2023-11-30 05:35:19,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169581571] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:35:19,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:35:19,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:35:19,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383273972] [2023-11-30 05:35:19,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:35:19,716 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:35:19,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:35:19,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:35:19,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:35:19,721 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 197 [2023-11-30 05:35:19,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 154 transitions, 647 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:19,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:35:19,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 197 [2023-11-30 05:35:19,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:35:21,835 INFO L124 PetriNetUnfolderBase]: 12456/20760 cut-off events. [2023-11-30 05:35:21,835 INFO L125 PetriNetUnfolderBase]: For 14701/16765 co-relation queries the response was YES. [2023-11-30 05:35:21,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87552 conditions, 20760 events. 12456/20760 cut-off events. For 14701/16765 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 159958 event pairs, 12456 based on Foata normal form. 0/20084 useless extension candidates. Maximal degree in co-relation 72587. Up to 16626 conditions per place. [2023-11-30 05:35:22,056 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 47 selfloop transitions, 1 changer transitions 1/152 dead transitions. [2023-11-30 05:35:22,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 152 transitions, 727 flow [2023-11-30 05:35:22,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:35:22,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:35:22,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2023-11-30 05:35:22,060 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7495769881556683 [2023-11-30 05:35:22,060 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 443 transitions. [2023-11-30 05:35:22,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 443 transitions. [2023-11-30 05:35:22,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:35:22,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 443 transitions. [2023-11-30 05:35:22,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:22,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:22,064 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:22,065 INFO L307 CegarLoopForPetriNet]: 178 programPoint places, -2 predicate places. [2023-11-30 05:35:22,065 INFO L500 AbstractCegarLoop]: Abstraction has has 176 places, 152 transitions, 727 flow [2023-11-30 05:35:22,066 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:22,066 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:35:22,066 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:35:22,066 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 05:35:22,066 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-30 05:35:22,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:35:22,066 INFO L85 PathProgramCache]: Analyzing trace with hash 919882348, now seen corresponding path program 1 times [2023-11-30 05:35:22,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:35:22,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897325115] [2023-11-30 05:35:22,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:35:22,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:35:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:35:22,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:35:22,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:35:22,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897325115] [2023-11-30 05:35:22,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897325115] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:35:22,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:35:22,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:35:22,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368801419] [2023-11-30 05:35:22,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:35:22,214 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:35:22,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:35:22,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:35:22,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:35:22,215 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 197 [2023-11-30 05:35:22,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 152 transitions, 727 flow. Second operand has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:22,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:35:22,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 197 [2023-11-30 05:35:22,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:35:24,428 INFO L124 PetriNetUnfolderBase]: 12288/20500 cut-off events. [2023-11-30 05:35:24,428 INFO L125 PetriNetUnfolderBase]: For 23430/26510 co-relation queries the response was YES. [2023-11-30 05:35:24,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102763 conditions, 20500 events. 12288/20500 cut-off events. For 23430/26510 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 158298 event pairs, 12288 based on Foata normal form. 72/19904 useless extension candidates. Maximal degree in co-relation 86117. Up to 16378 conditions per place. [2023-11-30 05:35:24,830 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 49 selfloop transitions, 1 changer transitions 1/150 dead transitions. [2023-11-30 05:35:24,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 150 transitions, 811 flow [2023-11-30 05:35:24,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:35:24,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:35:24,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-11-30 05:35:24,845 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7123519458544839 [2023-11-30 05:35:24,845 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-11-30 05:35:24,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-11-30 05:35:24,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:35:24,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-11-30 05:35:24,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:24,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:24,857 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:24,859 INFO L307 CegarLoopForPetriNet]: 178 programPoint places, -2 predicate places. [2023-11-30 05:35:24,860 INFO L500 AbstractCegarLoop]: Abstraction has has 176 places, 150 transitions, 811 flow [2023-11-30 05:35:24,860 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:24,860 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:35:24,862 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:35:24,862 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 05:35:24,863 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-30 05:35:24,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:35:24,864 INFO L85 PathProgramCache]: Analyzing trace with hash 733919610, now seen corresponding path program 1 times [2023-11-30 05:35:24,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:35:24,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296730718] [2023-11-30 05:35:24,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:35:24,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:35:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:35:24,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:35:24,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:35:24,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296730718] [2023-11-30 05:35:24,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296730718] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:35:24,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:35:24,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:35:24,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683487099] [2023-11-30 05:35:24,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:35:24,990 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:35:24,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:35:24,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:35:24,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:35:24,991 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 197 [2023-11-30 05:35:24,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 150 transitions, 811 flow. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:24,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:35:24,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 197 [2023-11-30 05:35:24,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:35:27,014 INFO L124 PetriNetUnfolderBase]: 11952/19908 cut-off events. [2023-11-30 05:35:27,014 INFO L125 PetriNetUnfolderBase]: For 33277/37277 co-relation queries the response was YES. [2023-11-30 05:35:27,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115738 conditions, 19908 events. 11952/19908 cut-off events. For 33277/37277 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 153335 event pairs, 11952 based on Foata normal form. 48/19400 useless extension candidates. Maximal degree in co-relation 96963. Up to 15882 conditions per place. [2023-11-30 05:35:27,186 INFO L140 encePairwiseOnDemand]: 192/197 looper letters, 45 selfloop transitions, 1 changer transitions 1/146 dead transitions. [2023-11-30 05:35:27,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 146 transitions, 863 flow [2023-11-30 05:35:27,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:35:27,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:35:27,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-11-30 05:35:27,188 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7089678510998308 [2023-11-30 05:35:27,188 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-11-30 05:35:27,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-11-30 05:35:27,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:35:27,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-11-30 05:35:27,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:27,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:27,191 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:27,194 INFO L307 CegarLoopForPetriNet]: 178 programPoint places, -4 predicate places. [2023-11-30 05:35:27,194 INFO L500 AbstractCegarLoop]: Abstraction has has 174 places, 146 transitions, 863 flow [2023-11-30 05:35:27,194 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:27,194 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:35:27,195 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:35:27,195 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 05:35:27,195 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-30 05:35:27,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:35:27,195 INFO L85 PathProgramCache]: Analyzing trace with hash 11325089, now seen corresponding path program 1 times [2023-11-30 05:35:27,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:35:27,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906796613] [2023-11-30 05:35:27,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:35:27,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:35:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:35:27,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:35:27,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:35:27,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906796613] [2023-11-30 05:35:27,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906796613] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:35:27,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:35:27,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:35:27,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739313190] [2023-11-30 05:35:27,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:35:27,253 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:35:27,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:35:27,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:35:27,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:35:27,254 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 197 [2023-11-30 05:35:27,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 146 transitions, 863 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:27,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:35:27,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 197 [2023-11-30 05:35:27,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:35:29,350 INFO L124 PetriNetUnfolderBase]: 11181/18685 cut-off events. [2023-11-30 05:35:29,350 INFO L125 PetriNetUnfolderBase]: For 44375/48983 co-relation queries the response was YES. [2023-11-30 05:35:29,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123185 conditions, 18685 events. 11181/18685 cut-off events. For 44375/48983 co-relation queries the response was YES. Maximal size of possible extension queue 796. Compared 142093 event pairs, 11181 based on Foata normal form. 4/18389 useless extension candidates. Maximal degree in co-relation 101889. Up to 14851 conditions per place. [2023-11-30 05:35:29,549 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 43 selfloop transitions, 1 changer transitions 1/144 dead transitions. [2023-11-30 05:35:29,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 144 transitions, 923 flow [2023-11-30 05:35:29,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:35:29,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:35:29,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2023-11-30 05:35:29,551 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7428087986463621 [2023-11-30 05:35:29,552 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2023-11-30 05:35:29,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2023-11-30 05:35:29,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:35:29,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2023-11-30 05:35:29,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 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-11-30 05:35:29,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:29,554 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:29,554 INFO L307 CegarLoopForPetriNet]: 178 programPoint places, -4 predicate places. [2023-11-30 05:35:29,555 INFO L500 AbstractCegarLoop]: Abstraction has has 174 places, 144 transitions, 923 flow [2023-11-30 05:35:29,555 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:29,555 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:35:29,555 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:35:29,555 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 05:35:29,555 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-30 05:35:29,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:35:29,555 INFO L85 PathProgramCache]: Analyzing trace with hash 11325090, now seen corresponding path program 1 times [2023-11-30 05:35:29,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:35:29,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204983312] [2023-11-30 05:35:29,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:35:29,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:35:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:35:29,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:35:29,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:35:29,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204983312] [2023-11-30 05:35:29,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204983312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:35:29,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:35:29,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:35:29,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055536451] [2023-11-30 05:35:29,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:35:29,638 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:35:29,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:35:29,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:35:29,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:35:29,639 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 197 [2023-11-30 05:35:29,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 144 transitions, 923 flow. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:29,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:35:29,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 197 [2023-11-30 05:35:29,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:35:31,560 INFO L124 PetriNetUnfolderBase]: 10410/17462 cut-off events. [2023-11-30 05:35:31,560 INFO L125 PetriNetUnfolderBase]: For 56419/61923 co-relation queries the response was YES. [2023-11-30 05:35:31,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129089 conditions, 17462 events. 10410/17462 cut-off events. For 56419/61923 co-relation queries the response was YES. Maximal size of possible extension queue 757. Compared 131142 event pairs, 10410 based on Foata normal form. 132/17422 useless extension candidates. Maximal degree in co-relation 105279. Up to 13820 conditions per place. [2023-11-30 05:35:31,645 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 0 selfloop transitions, 0 changer transitions 142/142 dead transitions. [2023-11-30 05:35:31,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 142 transitions, 981 flow [2023-11-30 05:35:31,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:35:31,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:35:31,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 451 transitions. [2023-11-30 05:35:31,651 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7631133671742809 [2023-11-30 05:35:31,651 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 451 transitions. [2023-11-30 05:35:31,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 451 transitions. [2023-11-30 05:35:31,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:35:31,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 451 transitions. [2023-11-30 05:35:31,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:31,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:31,653 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:31,654 INFO L307 CegarLoopForPetriNet]: 178 programPoint places, -4 predicate places. [2023-11-30 05:35:31,654 INFO L500 AbstractCegarLoop]: Abstraction has has 174 places, 142 transitions, 981 flow [2023-11-30 05:35:31,654 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:31,659 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-ticket-5.wvr.c_BEv2_AllErrorsAtOnce [2023-11-30 05:35:31,679 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 25 remaining) [2023-11-30 05:35:31,679 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 25 remaining) [2023-11-30 05:35:31,679 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 25 remaining) [2023-11-30 05:35:31,679 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 25 remaining) [2023-11-30 05:35:31,680 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 25 remaining) [2023-11-30 05:35:31,680 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 25 remaining) [2023-11-30 05:35:31,680 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 25 remaining) [2023-11-30 05:35:31,680 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 25 remaining) [2023-11-30 05:35:31,680 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 25 remaining) [2023-11-30 05:35:31,680 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 25 remaining) [2023-11-30 05:35:31,680 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 25 remaining) [2023-11-30 05:35:31,680 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 25 remaining) [2023-11-30 05:35:31,680 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 25 remaining) [2023-11-30 05:35:31,680 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 25 remaining) [2023-11-30 05:35:31,681 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 25 remaining) [2023-11-30 05:35:31,681 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 25 remaining) [2023-11-30 05:35:31,681 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 25 remaining) [2023-11-30 05:35:31,681 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 25 remaining) [2023-11-30 05:35:31,681 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 25 remaining) [2023-11-30 05:35:31,681 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 25 remaining) [2023-11-30 05:35:31,681 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 25 remaining) [2023-11-30 05:35:31,681 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 25 remaining) [2023-11-30 05:35:31,681 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 25 remaining) [2023-11-30 05:35:31,681 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 25 remaining) [2023-11-30 05:35:31,681 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 25 remaining) [2023-11-30 05:35:31,682 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 05:35:31,682 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:35:31,684 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 05:35:31,685 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 05:35:31,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 05:35:31 BasicIcfg [2023-11-30 05:35:31,689 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 05:35:31,690 INFO L158 Benchmark]: Toolchain (without parser) took 21849.15ms. Allocated memory was 515.9MB in the beginning and 12.2GB in the end (delta: 11.7GB). Free memory was 471.4MB in the beginning and 9.6GB in the end (delta: -9.1GB). Peak memory consumption was 2.7GB. Max. memory is 16.0GB. [2023-11-30 05:35:31,690 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 348.1MB. Free memory was 298.0MB in the beginning and 297.8MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 05:35:31,690 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.35ms. Allocated memory is still 515.9MB. Free memory was 471.0MB in the beginning and 458.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-30 05:35:31,690 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.22ms. Allocated memory is still 515.9MB. Free memory was 458.9MB in the beginning and 456.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 05:35:31,691 INFO L158 Benchmark]: Boogie Preprocessor took 19.48ms. Allocated memory is still 515.9MB. Free memory was 456.8MB in the beginning and 454.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 05:35:31,691 INFO L158 Benchmark]: RCFGBuilder took 490.53ms. Allocated memory is still 515.9MB. Free memory was 454.7MB in the beginning and 424.4MB in the end (delta: 30.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2023-11-30 05:35:31,691 INFO L158 Benchmark]: TraceAbstraction took 21096.73ms. Allocated memory was 515.9MB in the beginning and 12.2GB in the end (delta: 11.7GB). Free memory was 423.6MB in the beginning and 9.6GB in the end (delta: -9.2GB). Peak memory consumption was 2.6GB. Max. memory is 16.0GB. [2023-11-30 05:35:31,692 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 348.1MB. Free memory was 298.0MB in the beginning and 297.8MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 208.35ms. Allocated memory is still 515.9MB. Free memory was 471.0MB in the beginning and 458.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 30.22ms. Allocated memory is still 515.9MB. Free memory was 458.9MB in the beginning and 456.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 19.48ms. Allocated memory is still 515.9MB. Free memory was 456.8MB in the beginning and 454.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 490.53ms. Allocated memory is still 515.9MB. Free memory was 454.7MB in the beginning and 424.4MB in the end (delta: 30.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * TraceAbstraction took 21096.73ms. Allocated memory was 515.9MB in the beginning and 12.2GB in the end (delta: 11.7GB). Free memory was 423.6MB in the beginning and 9.6GB in the end (delta: -9.2GB). Peak memory consumption was 2.6GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - 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 11 procedures, 242 locations, 25 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: 21.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 302 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 302 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 403 IncrementalHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 55 mSDtfsCounter, 403 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=981occurred in iteration=8, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 624 NumberOfCodeBlocks, 624 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 616 ConstructedInterpolants, 0 QuantifiedInterpolants, 3658 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 05:35:31,704 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...