/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_02-list_nr.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:12:21,881 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:12:21,916 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 21:12:21,931 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:12:21,932 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:12:21,932 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:12:21,933 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:12:21,933 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:12:21,933 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:12:21,933 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:12:21,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:12:21,934 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:12:21,934 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:12:21,934 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:12:21,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:12:21,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:12:21,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:12:21,935 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:12:21,936 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:12:21,936 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:12:21,936 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:12:21,936 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:12:21,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:12:21,937 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:12:21,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:12:21,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:12:21,937 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:12:21,938 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:12:21,938 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:12:21,938 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:12:21,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:12:21,938 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:12:21,939 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:12:21,939 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 21:12:22,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:12:22,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:12:22,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:12:22,145 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:12:22,145 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:12:22,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_02-list_nr.i [2023-12-05 21:12:23,235 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:12:23,432 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:12:23,432 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_02-list_nr.i [2023-12-05 21:12:23,447 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76713d78f/4db767c364d5441a92ef84ee04e3cd20/FLAGdb93418c8 [2023-12-05 21:12:23,458 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76713d78f/4db767c364d5441a92ef84ee04e3cd20 [2023-12-05 21:12:23,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:12:23,461 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:12:23,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:12:23,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:12:23,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:12:23,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:12:23" (1/1) ... [2023-12-05 21:12:23,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70d45021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:23, skipping insertion in model container [2023-12-05 21:12:23,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:12:23" (1/1) ... [2023-12-05 21:12:23,510 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:12:23,887 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:12:23,911 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:12:23,957 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:12:24,035 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:12:24,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:24 WrapperNode [2023-12-05 21:12:24,036 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:12:24,037 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:12:24,037 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:12:24,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:12:24,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:24" (1/1) ... [2023-12-05 21:12:24,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:24" (1/1) ... [2023-12-05 21:12:24,071 INFO L138 Inliner]: procedures = 369, calls = 31, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 85 [2023-12-05 21:12:24,072 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:12:24,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:12:24,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:12:24,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:12:24,078 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:24" (1/1) ... [2023-12-05 21:12:24,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:24" (1/1) ... [2023-12-05 21:12:24,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:24" (1/1) ... [2023-12-05 21:12:24,081 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:24" (1/1) ... [2023-12-05 21:12:24,087 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:24" (1/1) ... [2023-12-05 21:12:24,088 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:24" (1/1) ... [2023-12-05 21:12:24,089 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:24" (1/1) ... [2023-12-05 21:12:24,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:24" (1/1) ... [2023-12-05 21:12:24,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:12:24,093 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:12:24,093 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:12:24,093 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:12:24,095 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:24" (1/1) ... [2023-12-05 21:12:24,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:12:24,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:12:24,123 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 21:12:24,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 21:12:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:12:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-05 21:12:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:12:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:12:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:12:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:12:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:12:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-05 21:12:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:12:24,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-05 21:12:24,152 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-05 21:12:24,152 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-05 21:12:24,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:12:24,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:12:24,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:12:24,153 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:12:24,260 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:12:24,261 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:12:24,592 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:12:24,608 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:12:24,608 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:12:24,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:12:24 BoogieIcfgContainer [2023-12-05 21:12:24,609 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:12:24,611 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:12:24,611 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:12:24,613 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:12:24,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:12:23" (1/3) ... [2023-12-05 21:12:24,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4ab592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:12:24, skipping insertion in model container [2023-12-05 21:12:24,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:24" (2/3) ... [2023-12-05 21:12:24,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4ab592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:12:24, skipping insertion in model container [2023-12-05 21:12:24,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:12:24" (3/3) ... [2023-12-05 21:12:24,614 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_02-list_nr.i [2023-12-05 21:12:24,626 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:12:24,626 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2023-12-05 21:12:24,626 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:12:24,676 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:12:24,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 119 transitions, 242 flow [2023-12-05 21:12:24,761 INFO L124 PetriNetUnfolderBase]: 0/118 cut-off events. [2023-12-05 21:12:24,761 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:12:24,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 118 events. 0/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 135 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2023-12-05 21:12:24,764 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 119 transitions, 242 flow [2023-12-05 21:12:24,767 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 118 transitions, 239 flow [2023-12-05 21:12:24,774 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:12:24,779 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;@74a452ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:12:24,779 INFO L363 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2023-12-05 21:12:24,785 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:12:24,785 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2023-12-05 21:12:24,785 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:12:24,785 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:24,786 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:12:24,786 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-12-05 21:12:24,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:24,790 INFO L85 PathProgramCache]: Analyzing trace with hash 391308333, now seen corresponding path program 1 times [2023-12-05 21:12:24,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:24,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524213773] [2023-12-05 21:12:24,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:24,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:25,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:25,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524213773] [2023-12-05 21:12:25,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524213773] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:25,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:25,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:12:25,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76049692] [2023-12-05 21:12:25,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:25,164 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:12:25,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:25,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:12:25,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:12:25,189 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 119 [2023-12-05 21:12:25,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 118 transitions, 239 flow. Second operand has 6 states, 6 states have (on average 62.833333333333336) internal successors, (377), 6 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:25,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:25,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 119 [2023-12-05 21:12:25,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:25,539 INFO L124 PetriNetUnfolderBase]: 130/531 cut-off events. [2023-12-05 21:12:25,540 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:12:25,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 531 events. 130/531 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2827 event pairs, 65 based on Foata normal form. 0/421 useless extension candidates. Maximal degree in co-relation 755. Up to 163 conditions per place. [2023-12-05 21:12:25,547 INFO L140 encePairwiseOnDemand]: 104/119 looper letters, 56 selfloop transitions, 12 changer transitions 0/128 dead transitions. [2023-12-05 21:12:25,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 128 transitions, 395 flow [2023-12-05 21:12:25,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:12:25,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:12:25,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 559 transitions. [2023-12-05 21:12:25,565 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5871848739495799 [2023-12-05 21:12:25,566 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 559 transitions. [2023-12-05 21:12:25,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 559 transitions. [2023-12-05 21:12:25,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:25,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 559 transitions. [2023-12-05 21:12:25,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 69.875) internal successors, (559), 8 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:25,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:25,583 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:25,588 INFO L308 CegarLoopForPetriNet]: 122 programPoint places, 4 predicate places. [2023-12-05 21:12:25,588 INFO L500 AbstractCegarLoop]: Abstraction has has 126 places, 128 transitions, 395 flow [2023-12-05 21:12:25,589 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.833333333333336) internal successors, (377), 6 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:25,589 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:25,589 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:12:25,589 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:12:25,590 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-12-05 21:12:25,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:25,591 INFO L85 PathProgramCache]: Analyzing trace with hash 391308334, now seen corresponding path program 1 times [2023-12-05 21:12:25,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:25,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597177027] [2023-12-05 21:12:25,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:25,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:25,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:25,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:25,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597177027] [2023-12-05 21:12:25,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597177027] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:25,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:25,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:12:25,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452730643] [2023-12-05 21:12:25,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:25,775 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:12:25,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:25,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:12:25,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:12:25,777 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 119 [2023-12-05 21:12:25,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 128 transitions, 395 flow. Second operand has 6 states, 6 states have (on average 64.66666666666667) internal successors, (388), 6 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:25,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:25,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 119 [2023-12-05 21:12:25,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:26,008 INFO L124 PetriNetUnfolderBase]: 183/692 cut-off events. [2023-12-05 21:12:26,009 INFO L125 PetriNetUnfolderBase]: For 134/170 co-relation queries the response was YES. [2023-12-05 21:12:26,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1415 conditions, 692 events. 183/692 cut-off events. For 134/170 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4227 event pairs, 72 based on Foata normal form. 7/645 useless extension candidates. Maximal degree in co-relation 1293. Up to 204 conditions per place. [2023-12-05 21:12:26,015 INFO L140 encePairwiseOnDemand]: 109/119 looper letters, 62 selfloop transitions, 8 changer transitions 2/139 dead transitions. [2023-12-05 21:12:26,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 139 transitions, 573 flow [2023-12-05 21:12:26,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:12:26,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:12:26,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 507 transitions. [2023-12-05 21:12:26,017 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6086434573829532 [2023-12-05 21:12:26,017 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 507 transitions. [2023-12-05 21:12:26,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 507 transitions. [2023-12-05 21:12:26,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:26,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 507 transitions. [2023-12-05 21:12:26,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 72.42857142857143) internal successors, (507), 7 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:26,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:26,020 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:26,021 INFO L308 CegarLoopForPetriNet]: 122 programPoint places, 8 predicate places. [2023-12-05 21:12:26,021 INFO L500 AbstractCegarLoop]: Abstraction has has 130 places, 139 transitions, 573 flow [2023-12-05 21:12:26,022 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.66666666666667) internal successors, (388), 6 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:26,022 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:26,022 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:12:26,022 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:12:26,022 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-12-05 21:12:26,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:26,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1787782053, now seen corresponding path program 1 times [2023-12-05 21:12:26,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:26,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222249957] [2023-12-05 21:12:26,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:26,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:26,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:26,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:26,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222249957] [2023-12-05 21:12:26,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222249957] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:26,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:26,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:12:26,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798645129] [2023-12-05 21:12:26,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:26,148 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:12:26,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:26,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:12:26,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:12:26,151 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 119 [2023-12-05 21:12:26,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 139 transitions, 573 flow. Second operand has 6 states, 6 states have (on average 61.333333333333336) internal successors, (368), 6 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:26,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:26,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 119 [2023-12-05 21:12:26,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:26,326 INFO L124 PetriNetUnfolderBase]: 164/627 cut-off events. [2023-12-05 21:12:26,330 INFO L125 PetriNetUnfolderBase]: For 417/502 co-relation queries the response was YES. [2023-12-05 21:12:26,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1629 conditions, 627 events. 164/627 cut-off events. For 417/502 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3595 event pairs, 56 based on Foata normal form. 38/633 useless extension candidates. Maximal degree in co-relation 1481. Up to 247 conditions per place. [2023-12-05 21:12:26,333 INFO L140 encePairwiseOnDemand]: 102/119 looper letters, 72 selfloop transitions, 12 changer transitions 4/148 dead transitions. [2023-12-05 21:12:26,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 148 transitions, 801 flow [2023-12-05 21:12:26,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:12:26,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:12:26,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 536 transitions. [2023-12-05 21:12:26,335 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5630252100840336 [2023-12-05 21:12:26,335 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 536 transitions. [2023-12-05 21:12:26,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 536 transitions. [2023-12-05 21:12:26,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:26,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 536 transitions. [2023-12-05 21:12:26,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:26,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:26,339 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:26,340 INFO L308 CegarLoopForPetriNet]: 122 programPoint places, 12 predicate places. [2023-12-05 21:12:26,341 INFO L500 AbstractCegarLoop]: Abstraction has has 134 places, 148 transitions, 801 flow [2023-12-05 21:12:26,341 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 61.333333333333336) internal successors, (368), 6 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:26,341 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:26,341 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:12:26,341 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:12:26,341 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-12-05 21:12:26,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:26,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1787782052, now seen corresponding path program 1 times [2023-12-05 21:12:26,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:26,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743881977] [2023-12-05 21:12:26,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:26,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:26,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:26,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:26,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743881977] [2023-12-05 21:12:26,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743881977] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:26,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:26,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:12:26,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151731624] [2023-12-05 21:12:26,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:26,511 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:12:26,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:26,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:12:26,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:12:26,512 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 119 [2023-12-05 21:12:26,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 148 transitions, 801 flow. Second operand has 6 states, 6 states have (on average 63.166666666666664) internal successors, (379), 6 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:26,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:26,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 119 [2023-12-05 21:12:26,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:26,652 INFO L124 PetriNetUnfolderBase]: 129/519 cut-off events. [2023-12-05 21:12:26,652 INFO L125 PetriNetUnfolderBase]: For 775/922 co-relation queries the response was YES. [2023-12-05 21:12:26,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1591 conditions, 519 events. 129/519 cut-off events. For 775/922 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2750 event pairs, 36 based on Foata normal form. 41/547 useless extension candidates. Maximal degree in co-relation 1427. Up to 223 conditions per place. [2023-12-05 21:12:26,655 INFO L140 encePairwiseOnDemand]: 106/119 looper letters, 62 selfloop transitions, 7 changer transitions 4/138 dead transitions. [2023-12-05 21:12:26,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 138 transitions, 883 flow [2023-12-05 21:12:26,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:12:26,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:12:26,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 471 transitions. [2023-12-05 21:12:26,656 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5654261704681873 [2023-12-05 21:12:26,656 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 471 transitions. [2023-12-05 21:12:26,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 471 transitions. [2023-12-05 21:12:26,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:26,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 471 transitions. [2023-12-05 21:12:26,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 67.28571428571429) internal successors, (471), 7 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:26,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:26,659 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:26,659 INFO L308 CegarLoopForPetriNet]: 122 programPoint places, 12 predicate places. [2023-12-05 21:12:26,659 INFO L500 AbstractCegarLoop]: Abstraction has has 134 places, 138 transitions, 883 flow [2023-12-05 21:12:26,660 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.166666666666664) internal successors, (379), 6 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:26,660 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:26,660 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:12:26,660 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:12:26,660 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-12-05 21:12:26,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:26,660 INFO L85 PathProgramCache]: Analyzing trace with hash -291160208, now seen corresponding path program 1 times [2023-12-05 21:12:26,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:26,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009033261] [2023-12-05 21:12:26,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:26,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:26,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:26,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:26,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009033261] [2023-12-05 21:12:26,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009033261] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:26,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:26,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:12:26,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488606135] [2023-12-05 21:12:26,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:26,882 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:12:26,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:26,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:12:26,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:12:26,884 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 119 [2023-12-05 21:12:26,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 138 transitions, 883 flow. Second operand has 6 states, 6 states have (on average 64.5) internal successors, (387), 6 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:26,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:26,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 119 [2023-12-05 21:12:26,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:27,017 INFO L124 PetriNetUnfolderBase]: 153/559 cut-off events. [2023-12-05 21:12:27,018 INFO L125 PetriNetUnfolderBase]: For 1451/1731 co-relation queries the response was YES. [2023-12-05 21:12:27,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2042 conditions, 559 events. 153/559 cut-off events. For 1451/1731 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3007 event pairs, 34 based on Foata normal form. 5/551 useless extension candidates. Maximal degree in co-relation 1867. Up to 242 conditions per place. [2023-12-05 21:12:27,021 INFO L140 encePairwiseOnDemand]: 112/119 looper letters, 87 selfloop transitions, 5 changer transitions 10/163 dead transitions. [2023-12-05 21:12:27,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 163 transitions, 1297 flow [2023-12-05 21:12:27,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-05 21:12:27,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-05 21:12:27,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2023-12-05 21:12:27,022 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6436974789915967 [2023-12-05 21:12:27,022 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 383 transitions. [2023-12-05 21:12:27,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 383 transitions. [2023-12-05 21:12:27,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:27,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 383 transitions. [2023-12-05 21:12:27,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 76.6) internal successors, (383), 5 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:27,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:27,024 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:27,025 INFO L308 CegarLoopForPetriNet]: 122 programPoint places, 14 predicate places. [2023-12-05 21:12:27,025 INFO L500 AbstractCegarLoop]: Abstraction has has 136 places, 163 transitions, 1297 flow [2023-12-05 21:12:27,025 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.5) internal successors, (387), 6 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:27,025 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:27,025 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:12:27,025 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:12:27,026 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-12-05 21:12:27,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:27,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1575508237, now seen corresponding path program 1 times [2023-12-05 21:12:27,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:27,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910447368] [2023-12-05 21:12:27,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:27,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:27,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:27,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:27,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910447368] [2023-12-05 21:12:27,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910447368] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:27,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:27,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-05 21:12:27,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432887615] [2023-12-05 21:12:27,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:27,324 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:12:27,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:27,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:12:27,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:12:27,326 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 119 [2023-12-05 21:12:27,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 163 transitions, 1297 flow. Second operand has 11 states, 11 states have (on average 64.36363636363636) internal successors, (708), 11 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:27,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:27,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 119 [2023-12-05 21:12:27,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:27,641 INFO L124 PetriNetUnfolderBase]: 218/728 cut-off events. [2023-12-05 21:12:27,641 INFO L125 PetriNetUnfolderBase]: For 2513/2860 co-relation queries the response was YES. [2023-12-05 21:12:27,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3147 conditions, 728 events. 218/728 cut-off events. For 2513/2860 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4277 event pairs, 16 based on Foata normal form. 18/738 useless extension candidates. Maximal degree in co-relation 2950. Up to 328 conditions per place. [2023-12-05 21:12:27,646 INFO L140 encePairwiseOnDemand]: 103/119 looper letters, 115 selfloop transitions, 22 changer transitions 12/215 dead transitions. [2023-12-05 21:12:27,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 215 transitions, 2135 flow [2023-12-05 21:12:27,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-05 21:12:27,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-12-05 21:12:27,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 848 transitions. [2023-12-05 21:12:27,648 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5938375350140056 [2023-12-05 21:12:27,648 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 848 transitions. [2023-12-05 21:12:27,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 848 transitions. [2023-12-05 21:12:27,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:27,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 848 transitions. [2023-12-05 21:12:27,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 70.66666666666667) internal successors, (848), 12 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:27,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 119.0) internal successors, (1547), 13 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:27,652 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 119.0) internal successors, (1547), 13 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:27,652 INFO L308 CegarLoopForPetriNet]: 122 programPoint places, 25 predicate places. [2023-12-05 21:12:27,652 INFO L500 AbstractCegarLoop]: Abstraction has has 147 places, 215 transitions, 2135 flow [2023-12-05 21:12:27,653 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 64.36363636363636) internal successors, (708), 11 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:27,653 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:27,653 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:12:27,653 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:12:27,653 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-12-05 21:12:27,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:27,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1575508238, now seen corresponding path program 1 times [2023-12-05 21:12:27,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:27,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606446406] [2023-12-05 21:12:27,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:27,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:28,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:28,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:28,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606446406] [2023-12-05 21:12:28,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606446406] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:28,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:28,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-05 21:12:28,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999344847] [2023-12-05 21:12:28,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:28,025 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:12:28,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:28,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:12:28,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:12:28,027 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 119 [2023-12-05 21:12:28,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 215 transitions, 2135 flow. Second operand has 11 states, 11 states have (on average 65.27272727272727) internal successors, (718), 11 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:28,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:28,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 119 [2023-12-05 21:12:28,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:28,393 INFO L124 PetriNetUnfolderBase]: 243/792 cut-off events. [2023-12-05 21:12:28,394 INFO L125 PetriNetUnfolderBase]: For 3807/4104 co-relation queries the response was YES. [2023-12-05 21:12:28,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3899 conditions, 792 events. 243/792 cut-off events. For 3807/4104 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4673 event pairs, 15 based on Foata normal form. 24/812 useless extension candidates. Maximal degree in co-relation 3681. Up to 352 conditions per place. [2023-12-05 21:12:28,399 INFO L140 encePairwiseOnDemand]: 104/119 looper letters, 124 selfloop transitions, 26 changer transitions 26/255 dead transitions. [2023-12-05 21:12:28,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 255 transitions, 2949 flow [2023-12-05 21:12:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-05 21:12:28,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-12-05 21:12:28,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1054 transitions. [2023-12-05 21:12:28,401 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5904761904761905 [2023-12-05 21:12:28,401 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1054 transitions. [2023-12-05 21:12:28,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1054 transitions. [2023-12-05 21:12:28,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:28,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1054 transitions. [2023-12-05 21:12:28,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 70.26666666666667) internal successors, (1054), 15 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:28,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 119.0) internal successors, (1904), 16 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:28,405 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 119.0) internal successors, (1904), 16 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:28,406 INFO L308 CegarLoopForPetriNet]: 122 programPoint places, 39 predicate places. [2023-12-05 21:12:28,406 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 255 transitions, 2949 flow [2023-12-05 21:12:28,406 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 65.27272727272727) internal successors, (718), 11 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:28,406 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:28,407 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:12:28,407 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:12:28,407 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-12-05 21:12:28,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:28,407 INFO L85 PathProgramCache]: Analyzing trace with hash 213765277, now seen corresponding path program 1 times [2023-12-05 21:12:28,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:28,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117353373] [2023-12-05 21:12:28,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:28,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:28,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:28,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:28,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117353373] [2023-12-05 21:12:28,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117353373] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:28,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:28,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:12:28,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505299918] [2023-12-05 21:12:28,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:28,555 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:12:28,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:28,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:12:28,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:12:28,556 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 119 [2023-12-05 21:12:28,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 255 transitions, 2949 flow. Second operand has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:28,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:28,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 119 [2023-12-05 21:12:28,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:28,750 INFO L124 PetriNetUnfolderBase]: 228/739 cut-off events. [2023-12-05 21:12:28,751 INFO L125 PetriNetUnfolderBase]: For 5278/5325 co-relation queries the response was YES. [2023-12-05 21:12:28,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4000 conditions, 739 events. 228/739 cut-off events. For 5278/5325 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4086 event pairs, 2 based on Foata normal form. 80/818 useless extension candidates. Maximal degree in co-relation 3770. Up to 309 conditions per place. [2023-12-05 21:12:28,757 INFO L140 encePairwiseOnDemand]: 109/119 looper letters, 141 selfloop transitions, 14 changer transitions 26/264 dead transitions. [2023-12-05 21:12:28,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 264 transitions, 3601 flow [2023-12-05 21:12:28,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:12:28,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:12:28,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 570 transitions. [2023-12-05 21:12:28,759 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6842737094837935 [2023-12-05 21:12:28,759 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 570 transitions. [2023-12-05 21:12:28,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 570 transitions. [2023-12-05 21:12:28,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:28,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 570 transitions. [2023-12-05 21:12:28,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 81.42857142857143) internal successors, (570), 7 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:28,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:28,761 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:28,762 INFO L308 CegarLoopForPetriNet]: 122 programPoint places, 42 predicate places. [2023-12-05 21:12:28,762 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 264 transitions, 3601 flow [2023-12-05 21:12:28,762 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:28,762 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:28,762 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:12:28,762 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:12:28,762 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-12-05 21:12:28,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:28,763 INFO L85 PathProgramCache]: Analyzing trace with hash 213765276, now seen corresponding path program 1 times [2023-12-05 21:12:28,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:28,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114541945] [2023-12-05 21:12:28,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:28,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:28,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:28,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:28,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114541945] [2023-12-05 21:12:28,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114541945] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:28,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:28,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:12:28,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971176304] [2023-12-05 21:12:28,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:28,845 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:12:28,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:28,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:12:28,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:12:28,846 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 119 [2023-12-05 21:12:28,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 264 transitions, 3601 flow. Second operand has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:28,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:28,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 119 [2023-12-05 21:12:28,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:29,121 INFO L124 PetriNetUnfolderBase]: 228/810 cut-off events. [2023-12-05 21:12:29,121 INFO L125 PetriNetUnfolderBase]: For 6795/6852 co-relation queries the response was YES. [2023-12-05 21:12:29,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4613 conditions, 810 events. 228/810 cut-off events. For 6795/6852 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4816 event pairs, 1 based on Foata normal form. 69/878 useless extension candidates. Maximal degree in co-relation 4370. Up to 342 conditions per place. [2023-12-05 21:12:29,127 INFO L140 encePairwiseOnDemand]: 105/119 looper letters, 150 selfloop transitions, 33 changer transitions 39/295 dead transitions. [2023-12-05 21:12:29,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 295 transitions, 4513 flow [2023-12-05 21:12:29,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:12:29,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:12:29,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 654 transitions. [2023-12-05 21:12:29,129 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6869747899159664 [2023-12-05 21:12:29,129 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 654 transitions. [2023-12-05 21:12:29,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 654 transitions. [2023-12-05 21:12:29,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:29,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 654 transitions. [2023-12-05 21:12:29,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 81.75) internal successors, (654), 8 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:29,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:29,132 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:29,133 INFO L308 CegarLoopForPetriNet]: 122 programPoint places, 49 predicate places. [2023-12-05 21:12:29,133 INFO L500 AbstractCegarLoop]: Abstraction has has 171 places, 295 transitions, 4513 flow [2023-12-05 21:12:29,133 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:29,133 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:29,134 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:12:29,134 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:12:29,134 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-12-05 21:12:29,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:29,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1713142387, now seen corresponding path program 1 times [2023-12-05 21:12:29,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:29,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114294353] [2023-12-05 21:12:29,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:29,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:29,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:29,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:29,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114294353] [2023-12-05 21:12:29,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114294353] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:29,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:29,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-12-05 21:12:29,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986435461] [2023-12-05 21:12:29,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:29,913 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-05 21:12:29,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:29,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-05 21:12:29,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2023-12-05 21:12:29,914 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 119 [2023-12-05 21:12:29,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 295 transitions, 4513 flow. Second operand has 18 states, 18 states have (on average 42.27777777777778) internal successors, (761), 18 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:29,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:29,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 119 [2023-12-05 21:12:29,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:31,651 INFO L124 PetriNetUnfolderBase]: 299/995 cut-off events. [2023-12-05 21:12:31,652 INFO L125 PetriNetUnfolderBase]: For 8318/8350 co-relation queries the response was YES. [2023-12-05 21:12:31,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6142 conditions, 995 events. 299/995 cut-off events. For 8318/8350 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 6103 event pairs, 2 based on Foata normal form. 23/1018 useless extension candidates. Maximal degree in co-relation 5869. Up to 383 conditions per place. [2023-12-05 21:12:31,659 INFO L140 encePairwiseOnDemand]: 90/119 looper letters, 181 selfloop transitions, 185 changer transitions 53/458 dead transitions. [2023-12-05 21:12:31,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 458 transitions, 7243 flow [2023-12-05 21:12:31,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-12-05 21:12:31,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2023-12-05 21:12:31,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 2553 transitions. [2023-12-05 21:12:31,666 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.37638213180008845 [2023-12-05 21:12:31,666 INFO L72 ComplementDD]: Start complementDD. Operand 57 states and 2553 transitions. [2023-12-05 21:12:31,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 2553 transitions. [2023-12-05 21:12:31,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:31,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 57 states and 2553 transitions. [2023-12-05 21:12:31,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 58 states, 57 states have (on average 44.78947368421053) internal successors, (2553), 57 states have internal predecessors, (2553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:31,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 58 states, 58 states have (on average 119.0) internal successors, (6902), 58 states have internal predecessors, (6902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:31,684 INFO L81 ComplementDD]: Finished complementDD. Result has 58 states, 58 states have (on average 119.0) internal successors, (6902), 58 states have internal predecessors, (6902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:31,684 INFO L308 CegarLoopForPetriNet]: 122 programPoint places, 105 predicate places. [2023-12-05 21:12:31,686 INFO L500 AbstractCegarLoop]: Abstraction has has 227 places, 458 transitions, 7243 flow [2023-12-05 21:12:31,686 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 42.27777777777778) internal successors, (761), 18 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:31,686 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:31,686 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:12:31,686 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:12:31,687 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-12-05 21:12:31,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:31,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1713142386, now seen corresponding path program 1 times [2023-12-05 21:12:31,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:31,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792522578] [2023-12-05 21:12:31,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:31,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:32,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:32,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:32,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792522578] [2023-12-05 21:12:32,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792522578] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:32,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:32,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-05 21:12:32,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739151976] [2023-12-05 21:12:32,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:32,164 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-05 21:12:32,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:32,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-05 21:12:32,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2023-12-05 21:12:32,165 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 119 [2023-12-05 21:12:32,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 458 transitions, 7243 flow. Second operand has 16 states, 16 states have (on average 54.0625) internal successors, (865), 16 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:32,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:32,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 119 [2023-12-05 21:12:32,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:32,960 INFO L124 PetriNetUnfolderBase]: 297/1007 cut-off events. [2023-12-05 21:12:32,960 INFO L125 PetriNetUnfolderBase]: For 9982/10026 co-relation queries the response was YES. [2023-12-05 21:12:32,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6868 conditions, 1007 events. 297/1007 cut-off events. For 9982/10026 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 6256 event pairs, 0 based on Foata normal form. 23/1030 useless extension candidates. Maximal degree in co-relation 6573. Up to 389 conditions per place. [2023-12-05 21:12:32,968 INFO L140 encePairwiseOnDemand]: 95/119 looper letters, 252 selfloop transitions, 108 changer transitions 80/487 dead transitions. [2023-12-05 21:12:32,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 487 transitions, 8633 flow [2023-12-05 21:12:32,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-05 21:12:32,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-12-05 21:12:32,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1683 transitions. [2023-12-05 21:12:32,970 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4876847290640394 [2023-12-05 21:12:32,970 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 1683 transitions. [2023-12-05 21:12:32,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 1683 transitions. [2023-12-05 21:12:32,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:32,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 1683 transitions. [2023-12-05 21:12:32,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 58.03448275862069) internal successors, (1683), 29 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:32,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 119.0) internal successors, (3570), 30 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:32,977 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 119.0) internal successors, (3570), 30 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:32,977 INFO L308 CegarLoopForPetriNet]: 122 programPoint places, 133 predicate places. [2023-12-05 21:12:32,977 INFO L500 AbstractCegarLoop]: Abstraction has has 255 places, 487 transitions, 8633 flow [2023-12-05 21:12:32,978 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 54.0625) internal successors, (865), 16 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:32,978 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:32,978 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:12:32,978 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:12:32,978 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-12-05 21:12:32,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:32,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1946048179, now seen corresponding path program 1 times [2023-12-05 21:12:32,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:32,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414110074] [2023-12-05 21:12:32,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:32,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:33,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:33,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:33,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414110074] [2023-12-05 21:12:33,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414110074] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:33,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:33,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 21:12:33,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304835339] [2023-12-05 21:12:33,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:33,147 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 21:12:33,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:33,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 21:12:33,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-05 21:12:33,148 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 119 [2023-12-05 21:12:33,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 487 transitions, 8633 flow. Second operand has 8 states, 8 states have (on average 70.125) internal successors, (561), 8 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:33,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:33,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 119 [2023-12-05 21:12:33,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:33,460 INFO L124 PetriNetUnfolderBase]: 289/985 cut-off events. [2023-12-05 21:12:33,460 INFO L125 PetriNetUnfolderBase]: For 11228/11262 co-relation queries the response was YES. [2023-12-05 21:12:33,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7370 conditions, 985 events. 289/985 cut-off events. For 11228/11262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 6097 event pairs, 0 based on Foata normal form. 27/1012 useless extension candidates. Maximal degree in co-relation 7061. Up to 391 conditions per place. [2023-12-05 21:12:33,468 INFO L140 encePairwiseOnDemand]: 105/119 looper letters, 234 selfloop transitions, 80 changer transitions 81/487 dead transitions. [2023-12-05 21:12:33,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 487 transitions, 9425 flow [2023-12-05 21:12:33,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-05 21:12:33,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-12-05 21:12:33,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1047 transitions. [2023-12-05 21:12:33,470 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6284513805522209 [2023-12-05 21:12:33,470 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1047 transitions. [2023-12-05 21:12:33,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1047 transitions. [2023-12-05 21:12:33,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:33,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1047 transitions. [2023-12-05 21:12:33,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 74.78571428571429) internal successors, (1047), 14 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:33,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 119.0) internal successors, (1785), 15 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:33,474 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 119.0) internal successors, (1785), 15 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:33,475 INFO L308 CegarLoopForPetriNet]: 122 programPoint places, 145 predicate places. [2023-12-05 21:12:33,475 INFO L500 AbstractCegarLoop]: Abstraction has has 267 places, 487 transitions, 9425 flow [2023-12-05 21:12:33,475 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 70.125) internal successors, (561), 8 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:33,476 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:33,476 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:12:33,476 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:12:33,476 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-12-05 21:12:33,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:33,476 INFO L85 PathProgramCache]: Analyzing trace with hash -861648858, now seen corresponding path program 1 times [2023-12-05 21:12:33,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:33,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070421942] [2023-12-05 21:12:33,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:33,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:33,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:33,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:33,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070421942] [2023-12-05 21:12:33,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070421942] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:33,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:33,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 21:12:33,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249135016] [2023-12-05 21:12:33,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:33,624 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 21:12:33,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:33,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 21:12:33,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-05 21:12:33,625 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 119 [2023-12-05 21:12:33,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 487 transitions, 9425 flow. Second operand has 8 states, 8 states have (on average 70.25) internal successors, (562), 8 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:33,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:33,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 119 [2023-12-05 21:12:33,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:33,988 INFO L124 PetriNetUnfolderBase]: 297/1016 cut-off events. [2023-12-05 21:12:33,988 INFO L125 PetriNetUnfolderBase]: For 13468/13522 co-relation queries the response was YES. [2023-12-05 21:12:33,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8242 conditions, 1016 events. 297/1016 cut-off events. For 13468/13522 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 6323 event pairs, 0 based on Foata normal form. 12/1028 useless extension candidates. Maximal degree in co-relation 7919. Up to 405 conditions per place. [2023-12-05 21:12:33,999 INFO L140 encePairwiseOnDemand]: 106/119 looper letters, 245 selfloop transitions, 94 changer transitions 81/512 dead transitions. [2023-12-05 21:12:33,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 512 transitions, 10731 flow [2023-12-05 21:12:33,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-05 21:12:33,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-12-05 21:12:34,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1190 transitions. [2023-12-05 21:12:34,001 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.625 [2023-12-05 21:12:34,001 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1190 transitions. [2023-12-05 21:12:34,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1190 transitions. [2023-12-05 21:12:34,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:34,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1190 transitions. [2023-12-05 21:12:34,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 74.375) internal successors, (1190), 16 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:34,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 119.0) internal successors, (2023), 17 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:34,005 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 119.0) internal successors, (2023), 17 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:34,005 INFO L308 CegarLoopForPetriNet]: 122 programPoint places, 160 predicate places. [2023-12-05 21:12:34,005 INFO L500 AbstractCegarLoop]: Abstraction has has 282 places, 512 transitions, 10731 flow [2023-12-05 21:12:34,005 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 70.25) internal successors, (562), 8 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:34,005 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:34,005 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:12:34,006 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:12:34,006 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-12-05 21:12:34,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:34,006 INFO L85 PathProgramCache]: Analyzing trace with hash 775314684, now seen corresponding path program 2 times [2023-12-05 21:12:34,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:34,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150975427] [2023-12-05 21:12:34,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:34,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:34,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:34,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:34,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150975427] [2023-12-05 21:12:34,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150975427] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:34,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:34,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 21:12:34,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356261901] [2023-12-05 21:12:34,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:34,239 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 21:12:34,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:34,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 21:12:34,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-05 21:12:34,240 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 119 [2023-12-05 21:12:34,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 512 transitions, 10731 flow. Second operand has 8 states, 8 states have (on average 70.25) internal successors, (562), 8 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:34,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:34,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 119 [2023-12-05 21:12:34,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:34,713 INFO L124 PetriNetUnfolderBase]: 319/1092 cut-off events. [2023-12-05 21:12:34,714 INFO L125 PetriNetUnfolderBase]: For 16992/17034 co-relation queries the response was YES. [2023-12-05 21:12:34,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9616 conditions, 1092 events. 319/1092 cut-off events. For 16992/17034 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 7069 event pairs, 0 based on Foata normal form. 23/1115 useless extension candidates. Maximal degree in co-relation 9279. Up to 443 conditions per place. [2023-12-05 21:12:34,727 INFO L140 encePairwiseOnDemand]: 104/119 looper letters, 248 selfloop transitions, 106 changer transitions 134/576 dead transitions. [2023-12-05 21:12:34,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 576 transitions, 13031 flow [2023-12-05 21:12:34,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-05 21:12:34,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-12-05 21:12:34,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1413 transitions. [2023-12-05 21:12:34,729 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6249447147279965 [2023-12-05 21:12:34,729 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1413 transitions. [2023-12-05 21:12:34,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1413 transitions. [2023-12-05 21:12:34,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:34,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1413 transitions. [2023-12-05 21:12:34,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 74.36842105263158) internal successors, (1413), 19 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:34,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 119.0) internal successors, (2380), 20 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:34,735 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 119.0) internal successors, (2380), 20 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:34,736 INFO L308 CegarLoopForPetriNet]: 122 programPoint places, 178 predicate places. [2023-12-05 21:12:34,736 INFO L500 AbstractCegarLoop]: Abstraction has has 300 places, 576 transitions, 13031 flow [2023-12-05 21:12:34,736 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 70.25) internal successors, (562), 8 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:34,736 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:34,737 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:12:34,737 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:12:34,737 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-12-05 21:12:34,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:34,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1126883582, now seen corresponding path program 3 times [2023-12-05 21:12:34,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:34,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233713452] [2023-12-05 21:12:34,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:34,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:34,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:34,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:34,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233713452] [2023-12-05 21:12:34,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233713452] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:34,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:34,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 21:12:34,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734282769] [2023-12-05 21:12:34,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:34,864 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 21:12:34,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:34,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 21:12:34,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-05 21:12:34,866 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 119 [2023-12-05 21:12:34,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 576 transitions, 13031 flow. Second operand has 8 states, 8 states have (on average 70.25) internal successors, (562), 8 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:34,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:34,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 119 [2023-12-05 21:12:34,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:35,255 INFO L124 PetriNetUnfolderBase]: 350/1202 cut-off events. [2023-12-05 21:12:35,255 INFO L125 PetriNetUnfolderBase]: For 21132/21202 co-relation queries the response was YES. [2023-12-05 21:12:35,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11340 conditions, 1202 events. 350/1202 cut-off events. For 21132/21202 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 8104 event pairs, 0 based on Foata normal form. 10/1212 useless extension candidates. Maximal degree in co-relation 10989. Up to 488 conditions per place. [2023-12-05 21:12:35,264 INFO L140 encePairwiseOnDemand]: 104/119 looper letters, 288 selfloop transitions, 131 changer transitions 158/665 dead transitions. [2023-12-05 21:12:35,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 665 transitions, 16199 flow [2023-12-05 21:12:35,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-05 21:12:35,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-12-05 21:12:35,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1185 transitions. [2023-12-05 21:12:35,266 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6223739495798319 [2023-12-05 21:12:35,266 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1185 transitions. [2023-12-05 21:12:35,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1185 transitions. [2023-12-05 21:12:35,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:35,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1185 transitions. [2023-12-05 21:12:35,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 74.0625) internal successors, (1185), 16 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:35,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 119.0) internal successors, (2023), 17 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:35,280 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 119.0) internal successors, (2023), 17 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:35,280 INFO L308 CegarLoopForPetriNet]: 122 programPoint places, 191 predicate places. [2023-12-05 21:12:35,280 INFO L500 AbstractCegarLoop]: Abstraction has has 313 places, 665 transitions, 16199 flow [2023-12-05 21:12:35,280 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 70.25) internal successors, (562), 8 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:35,281 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:35,281 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:12:35,281 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-05 21:12:35,281 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-12-05 21:12:35,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:35,281 INFO L85 PathProgramCache]: Analyzing trace with hash 486211279, now seen corresponding path program 1 times [2023-12-05 21:12:35,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:35,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538506009] [2023-12-05 21:12:35,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:35,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:35,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:35,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:35,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538506009] [2023-12-05 21:12:35,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538506009] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:35,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:35,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:12:35,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505708367] [2023-12-05 21:12:35,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:35,352 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:12:35,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:35,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:12:35,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:12:35,353 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 119 [2023-12-05 21:12:35,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 665 transitions, 16199 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:35,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:35,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 119 [2023-12-05 21:12:35,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:35,559 INFO L124 PetriNetUnfolderBase]: 267/934 cut-off events. [2023-12-05 21:12:35,559 INFO L125 PetriNetUnfolderBase]: For 16770/16774 co-relation queries the response was YES. [2023-12-05 21:12:35,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8905 conditions, 934 events. 267/934 cut-off events. For 16770/16774 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5710 event pairs, 0 based on Foata normal form. 13/947 useless extension candidates. Maximal degree in co-relation 8546. Up to 379 conditions per place. [2023-12-05 21:12:35,565 INFO L140 encePairwiseOnDemand]: 115/119 looper letters, 7 selfloop transitions, 39 changer transitions 98/578 dead transitions. [2023-12-05 21:12:35,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 578 transitions, 13869 flow [2023-12-05 21:12:35,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:12:35,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:12:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2023-12-05 21:12:35,566 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9439775910364145 [2023-12-05 21:12:35,566 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 337 transitions. [2023-12-05 21:12:35,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions. [2023-12-05 21:12:35,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:35,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions. [2023-12-05 21:12:35,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:35,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:35,568 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:35,568 INFO L308 CegarLoopForPetriNet]: 122 programPoint places, 184 predicate places. [2023-12-05 21:12:35,568 INFO L500 AbstractCegarLoop]: Abstraction has has 306 places, 578 transitions, 13869 flow [2023-12-05 21:12:35,568 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:35,568 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:35,568 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:12:35,568 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-05 21:12:35,569 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-12-05 21:12:35,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:35,569 INFO L85 PathProgramCache]: Analyzing trace with hash 438400838, now seen corresponding path program 1 times [2023-12-05 21:12:35,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:35,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799430976] [2023-12-05 21:12:35,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:35,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:35,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:35,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:35,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799430976] [2023-12-05 21:12:35,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799430976] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:35,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:35,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:12:35,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49593925] [2023-12-05 21:12:35,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:35,666 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:12:35,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:35,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:12:35,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:12:35,667 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 119 [2023-12-05 21:12:35,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 578 transitions, 13869 flow. Second operand has 7 states, 7 states have (on average 72.0) internal successors, (504), 7 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:35,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:35,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 119 [2023-12-05 21:12:35,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:35,879 INFO L124 PetriNetUnfolderBase]: 254/897 cut-off events. [2023-12-05 21:12:35,879 INFO L125 PetriNetUnfolderBase]: For 18728/18740 co-relation queries the response was YES. [2023-12-05 21:12:35,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8937 conditions, 897 events. 254/897 cut-off events. For 18728/18740 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5365 event pairs, 0 based on Foata normal form. 22/919 useless extension candidates. Maximal degree in co-relation 8559. Up to 354 conditions per place. [2023-12-05 21:12:35,885 INFO L140 encePairwiseOnDemand]: 111/119 looper letters, 23 selfloop transitions, 5 changer transitions 477/560 dead transitions. [2023-12-05 21:12:35,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 560 transitions, 14069 flow [2023-12-05 21:12:35,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:12:35,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:12:35,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 589 transitions. [2023-12-05 21:12:35,886 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6186974789915967 [2023-12-05 21:12:35,886 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 589 transitions. [2023-12-05 21:12:35,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 589 transitions. [2023-12-05 21:12:35,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:35,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 589 transitions. [2023-12-05 21:12:35,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 73.625) internal successors, (589), 8 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:35,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:35,889 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:35,889 INFO L308 CegarLoopForPetriNet]: 122 programPoint places, 189 predicate places. [2023-12-05 21:12:35,889 INFO L500 AbstractCegarLoop]: Abstraction has has 311 places, 560 transitions, 14069 flow [2023-12-05 21:12:35,889 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 72.0) internal successors, (504), 7 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:35,890 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:35,890 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:12:35,890 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-05 21:12:35,890 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-12-05 21:12:35,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:35,890 INFO L85 PathProgramCache]: Analyzing trace with hash 968931081, now seen corresponding path program 1 times [2023-12-05 21:12:35,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:35,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953329796] [2023-12-05 21:12:35,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:35,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:35,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:36,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:36,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:36,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953329796] [2023-12-05 21:12:36,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953329796] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:36,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:36,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-05 21:12:36,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483657090] [2023-12-05 21:12:36,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:36,149 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-05 21:12:36,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:36,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-05 21:12:36,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-05 21:12:36,150 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 119 [2023-12-05 21:12:36,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 560 transitions, 14069 flow. Second operand has 9 states, 9 states have (on average 59.77777777777778) internal successors, (538), 9 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:36,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:36,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 119 [2023-12-05 21:12:36,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:36,591 INFO L124 PetriNetUnfolderBase]: 254/907 cut-off events. [2023-12-05 21:12:36,591 INFO L125 PetriNetUnfolderBase]: For 20772/20780 co-relation queries the response was YES. [2023-12-05 21:12:36,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9458 conditions, 907 events. 254/907 cut-off events. For 20772/20780 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5439 event pairs, 0 based on Foata normal form. 5/912 useless extension candidates. Maximal degree in co-relation 9061. Up to 358 conditions per place. [2023-12-05 21:12:36,596 INFO L140 encePairwiseOnDemand]: 107/119 looper letters, 0 selfloop transitions, 0 changer transitions 563/563 dead transitions. [2023-12-05 21:12:36,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 563 transitions, 14945 flow [2023-12-05 21:12:36,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-05 21:12:36,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-12-05 21:12:36,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 936 transitions. [2023-12-05 21:12:36,601 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5243697478991597 [2023-12-05 21:12:36,601 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 936 transitions. [2023-12-05 21:12:36,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 936 transitions. [2023-12-05 21:12:36,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:36,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 936 transitions. [2023-12-05 21:12:36,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 62.4) internal successors, (936), 15 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:36,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 119.0) internal successors, (1904), 16 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:36,605 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 119.0) internal successors, (1904), 16 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:36,605 INFO L308 CegarLoopForPetriNet]: 122 programPoint places, 202 predicate places. [2023-12-05 21:12:36,605 INFO L500 AbstractCegarLoop]: Abstraction has has 324 places, 563 transitions, 14945 flow [2023-12-05 21:12:36,606 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 59.77777777777778) internal successors, (538), 9 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:36,611 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/09-regions_02-list_nr.i_BEv2_AllErrorsAtOnce [2023-12-05 21:12:36,691 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 37 remaining) [2023-12-05 21:12:36,691 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 37 remaining) [2023-12-05 21:12:36,691 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 37 remaining) [2023-12-05 21:12:36,691 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 37 remaining) [2023-12-05 21:12:36,691 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 37 remaining) [2023-12-05 21:12:36,692 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 37 remaining) [2023-12-05 21:12:36,692 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 37 remaining) [2023-12-05 21:12:36,692 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 37 remaining) [2023-12-05 21:12:36,692 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 37 remaining) [2023-12-05 21:12:36,692 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 37 remaining) [2023-12-05 21:12:36,692 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 37 remaining) [2023-12-05 21:12:36,692 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 37 remaining) [2023-12-05 21:12:36,692 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 37 remaining) [2023-12-05 21:12:36,692 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 37 remaining) [2023-12-05 21:12:36,692 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 37 remaining) [2023-12-05 21:12:36,692 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 37 remaining) [2023-12-05 21:12:36,692 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 37 remaining) [2023-12-05 21:12:36,692 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 37 remaining) [2023-12-05 21:12:36,693 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 37 remaining) [2023-12-05 21:12:36,693 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 37 remaining) [2023-12-05 21:12:36,693 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 37 remaining) [2023-12-05 21:12:36,693 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 37 remaining) [2023-12-05 21:12:36,693 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 37 remaining) [2023-12-05 21:12:36,693 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 37 remaining) [2023-12-05 21:12:36,693 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 37 remaining) [2023-12-05 21:12:36,695 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 37 remaining) [2023-12-05 21:12:36,695 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 37 remaining) [2023-12-05 21:12:36,695 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 37 remaining) [2023-12-05 21:12:36,695 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 37 remaining) [2023-12-05 21:12:36,695 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 37 remaining) [2023-12-05 21:12:36,695 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 37 remaining) [2023-12-05 21:12:36,695 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 37 remaining) [2023-12-05 21:12:36,695 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 37 remaining) [2023-12-05 21:12:36,695 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 37 remaining) [2023-12-05 21:12:36,696 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 37 remaining) [2023-12-05 21:12:36,696 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 37 remaining) [2023-12-05 21:12:36,696 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 37 remaining) [2023-12-05 21:12:36,696 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-05 21:12:36,696 INFO L457 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:12:36,701 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:12:36,701 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:12:36,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:12:36 BasicIcfg [2023-12-05 21:12:36,707 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:12:36,708 INFO L158 Benchmark]: Toolchain (without parser) took 13246.77ms. Allocated memory was 155.2MB in the beginning and 599.8MB in the end (delta: 444.6MB). Free memory was 105.0MB in the beginning and 386.9MB in the end (delta: -281.9MB). Peak memory consumption was 161.3MB. Max. memory is 8.0GB. [2023-12-05 21:12:36,708 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 155.2MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:12:36,708 INFO L158 Benchmark]: CACSL2BoogieTranslator took 574.35ms. Allocated memory is still 155.2MB. Free memory was 105.0MB in the beginning and 119.7MB in the end (delta: -14.7MB). Peak memory consumption was 46.8MB. Max. memory is 8.0GB. [2023-12-05 21:12:36,708 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.41ms. Allocated memory is still 155.2MB. Free memory was 119.7MB in the beginning and 117.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-05 21:12:36,708 INFO L158 Benchmark]: Boogie Preprocessor took 20.32ms. Allocated memory is still 155.2MB. Free memory was 116.6MB in the beginning and 115.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:12:36,708 INFO L158 Benchmark]: RCFGBuilder took 516.02ms. Allocated memory is still 155.2MB. Free memory was 115.0MB in the beginning and 94.0MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-05 21:12:36,708 INFO L158 Benchmark]: TraceAbstraction took 12096.51ms. Allocated memory was 155.2MB in the beginning and 599.8MB in the end (delta: 444.6MB). Free memory was 93.5MB in the beginning and 386.9MB in the end (delta: -293.4MB). Peak memory consumption was 149.1MB. Max. memory is 8.0GB. [2023-12-05 21:12:36,709 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 155.2MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 574.35ms. Allocated memory is still 155.2MB. Free memory was 105.0MB in the beginning and 119.7MB in the end (delta: -14.7MB). Peak memory consumption was 46.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.41ms. Allocated memory is still 155.2MB. Free memory was 119.7MB in the beginning and 117.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.32ms. Allocated memory is still 155.2MB. Free memory was 116.6MB in the beginning and 115.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 516.02ms. Allocated memory is still 155.2MB. Free memory was 115.0MB in the beginning and 94.0MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 12096.51ms. Allocated memory was 155.2MB in the beginning and 599.8MB in the end (delta: 444.6MB). Free memory was 93.5MB in the beginning and 386.9MB in the end (delta: -293.4MB). Peak memory consumption was 149.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - 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 3 procedures, 156 locations, 37 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: 12.0s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1844 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1844 mSDsluCounter, 1279 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 931 mSDsCounter, 225 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5031 IncrementalHoareTripleChecker+Invalid, 5256 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 225 mSolverCounterUnsat, 348 mSDtfsCounter, 5031 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 293 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1878 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16199occurred in iteration=15, InterpolantAutomatonStates: 254, 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.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1108 NumberOfCodeBlocks, 1108 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1090 ConstructedInterpolants, 0 QuantifiedInterpolants, 5782 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 26 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:12:36,740 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...