/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe009_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:48:19,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:48:19,391 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 04:48:19,423 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:48:19,424 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:48:19,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:48:19,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:48:19,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:48:19,426 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:48:19,431 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:48:19,432 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:48:19,432 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:48:19,432 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:48:19,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:48:19,434 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:48:19,434 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:48:19,434 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:48:19,434 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:48:19,434 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:48:19,435 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:48:19,435 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:48:19,436 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:48:19,436 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:48:19,436 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:48:19,436 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:48:19,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:48:19,438 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:48:19,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:48:19,439 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:48:19,439 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:48:19,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:48:19,440 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:48:19,440 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:48:19,440 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-11-30 04:48:19,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:48:19,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:48:19,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:48:19,682 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:48:19,684 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:48:19,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe009_rmo.oepc.i [2023-11-30 04:48:20,839 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:48:21,111 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:48:21,111 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_rmo.oepc.i [2023-11-30 04:48:21,137 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/681a98d77/d9a8cf67b0c24e6ab239f0ab89932c3e/FLAG7ca337adb [2023-11-30 04:48:21,152 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/681a98d77/d9a8cf67b0c24e6ab239f0ab89932c3e [2023-11-30 04:48:21,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:48:21,155 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:48:21,157 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:48:21,157 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:48:21,161 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:48:21,162 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:48:21" (1/1) ... [2023-11-30 04:48:21,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dd3a5ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:21, skipping insertion in model container [2023-11-30 04:48:21,164 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:48:21" (1/1) ... [2023-11-30 04:48:21,210 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:48:21,583 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:48:21,598 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:48:21,663 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:48:21,698 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:48:21,699 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:48:21,705 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:48:21,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:21 WrapperNode [2023-11-30 04:48:21,706 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:48:21,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:48:21,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:48:21,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:48:21,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:21" (1/1) ... [2023-11-30 04:48:21,742 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:21" (1/1) ... [2023-11-30 04:48:21,776 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 171 [2023-11-30 04:48:21,777 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:48:21,778 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:48:21,778 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:48:21,778 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:48:21,795 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:21" (1/1) ... [2023-11-30 04:48:21,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:21" (1/1) ... [2023-11-30 04:48:21,798 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:21" (1/1) ... [2023-11-30 04:48:21,798 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:21" (1/1) ... [2023-11-30 04:48:21,807 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:21" (1/1) ... [2023-11-30 04:48:21,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:21" (1/1) ... [2023-11-30 04:48:21,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:21" (1/1) ... [2023-11-30 04:48:21,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:21" (1/1) ... [2023-11-30 04:48:21,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:48:21,817 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:48:21,817 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:48:21,817 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:48:21,818 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:21" (1/1) ... [2023-11-30 04:48:21,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:48:21,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:48:21,849 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 04:48:21,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 04:48:21,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 04:48:21,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:48:21,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:48:21,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:48:21,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:48:21,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:48:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-30 04:48:21,901 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-30 04:48:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-30 04:48:21,901 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-30 04:48:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-30 04:48:21,901 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-30 04:48:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:48:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:48:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:48:21,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:48:21,903 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 04:48:22,081 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:48:22,092 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:48:22,598 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:48:23,049 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:48:23,049 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:48:23,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:48:23 BoogieIcfgContainer [2023-11-30 04:48:23,051 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:48:23,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:48:23,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:48:23,055 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:48:23,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:48:21" (1/3) ... [2023-11-30 04:48:23,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2965a53a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:48:23, skipping insertion in model container [2023-11-30 04:48:23,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:21" (2/3) ... [2023-11-30 04:48:23,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2965a53a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:48:23, skipping insertion in model container [2023-11-30 04:48:23,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:48:23" (3/3) ... [2023-11-30 04:48:23,058 INFO L112 eAbstractionObserver]: Analyzing ICFG safe009_rmo.oepc.i [2023-11-30 04:48:23,073 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:48:23,074 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2023-11-30 04:48:23,074 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:48:23,164 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:48:23,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 179 transitions, 370 flow [2023-11-30 04:48:23,260 INFO L124 PetriNetUnfolderBase]: 3/176 cut-off events. [2023-11-30 04:48:23,260 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:48:23,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 176 events. 3/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 282 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 121. Up to 2 conditions per place. [2023-11-30 04:48:23,267 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 179 transitions, 370 flow [2023-11-30 04:48:23,272 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 183 places, 176 transitions, 361 flow [2023-11-30 04:48:23,279 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:48:23,285 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;@3d432114, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:48:23,285 INFO L363 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2023-11-30 04:48:23,294 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:48:23,295 INFO L124 PetriNetUnfolderBase]: 0/56 cut-off events. [2023-11-30 04:48:23,295 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:48:23,295 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:23,295 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:23,296 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-30 04:48:23,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:23,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1521848530, now seen corresponding path program 1 times [2023-11-30 04:48:23,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:23,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502368813] [2023-11-30 04:48:23,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:23,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:23,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:48:23,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:23,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502368813] [2023-11-30 04:48:23,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502368813] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:23,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:23,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:48:23,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767306778] [2023-11-30 04:48:23,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:23,671 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:23,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:23,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:23,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:23,702 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 179 [2023-11-30 04:48:23,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 176 transitions, 361 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:23,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:23,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 179 [2023-11-30 04:48:23,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:27,844 INFO L124 PetriNetUnfolderBase]: 13029/24112 cut-off events. [2023-11-30 04:48:27,844 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-11-30 04:48:27,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42580 conditions, 24112 events. 13029/24112 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 1942. Compared 220585 event pairs, 8934 based on Foata normal form. 684/11829 useless extension candidates. Maximal degree in co-relation 42506. Up to 12661 conditions per place. [2023-11-30 04:48:28,095 INFO L140 encePairwiseOnDemand]: 153/179 looper letters, 68 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2023-11-30 04:48:28,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 168 transitions, 485 flow [2023-11-30 04:48:28,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:28,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:28,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2023-11-30 04:48:28,108 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7690875232774674 [2023-11-30 04:48:28,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2023-11-30 04:48:28,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2023-11-30 04:48:28,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:28,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2023-11-30 04:48:28,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:28,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:28,120 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:28,123 INFO L307 CegarLoopForPetriNet]: 183 programPoint places, -22 predicate places. [2023-11-30 04:48:28,123 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 168 transitions, 485 flow [2023-11-30 04:48:28,124 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:28,124 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:28,124 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:28,124 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:48:28,124 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-30 04:48:28,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:28,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1521848531, now seen corresponding path program 1 times [2023-11-30 04:48:28,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:28,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91849872] [2023-11-30 04:48:28,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:28,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:28,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:48:28,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:28,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91849872] [2023-11-30 04:48:28,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91849872] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:28,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:28,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:48:28,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420891609] [2023-11-30 04:48:28,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:28,297 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:28,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:28,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:28,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:28,299 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 179 [2023-11-30 04:48:28,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 168 transitions, 485 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:28,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:28,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 179 [2023-11-30 04:48:28,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:31,859 INFO L124 PetriNetUnfolderBase]: 13091/24225 cut-off events. [2023-11-30 04:48:31,859 INFO L125 PetriNetUnfolderBase]: For 1531/4147 co-relation queries the response was YES. [2023-11-30 04:48:31,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60548 conditions, 24225 events. 13091/24225 cut-off events. For 1531/4147 co-relation queries the response was YES. Maximal size of possible extension queue 1942. Compared 221376 event pairs, 8996 based on Foata normal form. 0/11249 useless extension candidates. Maximal degree in co-relation 60468. Up to 13865 conditions per place. [2023-11-30 04:48:32,032 INFO L140 encePairwiseOnDemand]: 176/179 looper letters, 83 selfloop transitions, 2 changer transitions 0/186 dead transitions. [2023-11-30 04:48:32,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 186 transitions, 727 flow [2023-11-30 04:48:32,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:32,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:32,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2023-11-30 04:48:32,036 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7169459962756052 [2023-11-30 04:48:32,036 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2023-11-30 04:48:32,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2023-11-30 04:48:32,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:32,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2023-11-30 04:48:32,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:32,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:32,040 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:32,040 INFO L307 CegarLoopForPetriNet]: 183 programPoint places, -21 predicate places. [2023-11-30 04:48:32,041 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 186 transitions, 727 flow [2023-11-30 04:48:32,041 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:32,041 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:32,041 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:32,041 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:48:32,041 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-30 04:48:32,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:32,042 INFO L85 PathProgramCache]: Analyzing trace with hash -284381765, now seen corresponding path program 1 times [2023-11-30 04:48:32,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:32,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300630461] [2023-11-30 04:48:32,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:32,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:32,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:48:32,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:32,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300630461] [2023-11-30 04:48:32,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300630461] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:32,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:32,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:48:32,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813872170] [2023-11-30 04:48:32,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:32,265 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:48:32,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:32,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:48:32,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:48:32,269 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 179 [2023-11-30 04:48:32,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 186 transitions, 727 flow. Second operand has 6 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:32,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:32,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 179 [2023-11-30 04:48:32,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:34,439 INFO L124 PetriNetUnfolderBase]: 7744/15982 cut-off events. [2023-11-30 04:48:34,439 INFO L125 PetriNetUnfolderBase]: For 2905/4519 co-relation queries the response was YES. [2023-11-30 04:48:34,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49580 conditions, 15982 events. 7744/15982 cut-off events. For 2905/4519 co-relation queries the response was YES. Maximal size of possible extension queue 992. Compared 151583 event pairs, 2135 based on Foata normal form. 0/9797 useless extension candidates. Maximal degree in co-relation 49489. Up to 8561 conditions per place. [2023-11-30 04:48:34,560 INFO L140 encePairwiseOnDemand]: 158/179 looper letters, 91 selfloop transitions, 17 changer transitions 0/204 dead transitions. [2023-11-30 04:48:34,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 204 transitions, 1047 flow [2023-11-30 04:48:34,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 04:48:34,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 04:48:34,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 839 transitions. [2023-11-30 04:48:34,564 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6695929768555466 [2023-11-30 04:48:34,564 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 839 transitions. [2023-11-30 04:48:34,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 839 transitions. [2023-11-30 04:48:34,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:34,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 839 transitions. [2023-11-30 04:48:34,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:34,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:34,570 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:34,573 INFO L307 CegarLoopForPetriNet]: 183 programPoint places, -18 predicate places. [2023-11-30 04:48:34,574 INFO L500 AbstractCegarLoop]: Abstraction has has 165 places, 204 transitions, 1047 flow [2023-11-30 04:48:34,574 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:34,574 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:34,574 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:34,575 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:48:34,575 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-30 04:48:34,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:34,576 INFO L85 PathProgramCache]: Analyzing trace with hash -284381764, now seen corresponding path program 1 times [2023-11-30 04:48:34,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:34,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900855691] [2023-11-30 04:48:34,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:34,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:34,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:48:34,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:34,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900855691] [2023-11-30 04:48:34,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900855691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:34,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:34,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:48:34,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294223129] [2023-11-30 04:48:34,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:34,789 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:48:34,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:34,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:48:34,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:48:34,795 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 179 [2023-11-30 04:48:34,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 204 transitions, 1047 flow. Second operand has 6 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:34,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:34,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 179 [2023-11-30 04:48:34,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:35,329 INFO L124 PetriNetUnfolderBase]: 1132/2835 cut-off events. [2023-11-30 04:48:35,329 INFO L125 PetriNetUnfolderBase]: For 1033/2941 co-relation queries the response was YES. [2023-11-30 04:48:35,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10185 conditions, 2835 events. 1132/2835 cut-off events. For 1033/2941 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 21650 event pairs, 530 based on Foata normal form. 0/2269 useless extension candidates. Maximal degree in co-relation 10083. Up to 1572 conditions per place. [2023-11-30 04:48:35,346 INFO L140 encePairwiseOnDemand]: 157/179 looper letters, 68 selfloop transitions, 7 changer transitions 0/169 dead transitions. [2023-11-30 04:48:35,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 169 transitions, 917 flow [2023-11-30 04:48:35,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 04:48:35,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 04:48:35,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 683 transitions. [2023-11-30 04:48:35,349 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6359404096834265 [2023-11-30 04:48:35,349 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 683 transitions. [2023-11-30 04:48:35,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 683 transitions. [2023-11-30 04:48:35,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:35,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 683 transitions. [2023-11-30 04:48:35,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:35,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:35,353 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:35,354 INFO L307 CegarLoopForPetriNet]: 183 programPoint places, -23 predicate places. [2023-11-30 04:48:35,354 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 169 transitions, 917 flow [2023-11-30 04:48:35,354 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:35,354 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:35,355 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:35,355 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:48:35,355 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-30 04:48:35,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:35,355 INFO L85 PathProgramCache]: Analyzing trace with hash -447541372, now seen corresponding path program 1 times [2023-11-30 04:48:35,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:35,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364362455] [2023-11-30 04:48:35,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:35,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:35,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:48:35,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:35,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364362455] [2023-11-30 04:48:35,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364362455] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:35,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:35,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:48:35,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874179926] [2023-11-30 04:48:35,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:35,407 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:35,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:35,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:35,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:35,409 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 179 [2023-11-30 04:48:35,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 169 transitions, 917 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:35,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:35,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 179 [2023-11-30 04:48:35,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:36,038 INFO L124 PetriNetUnfolderBase]: 1459/3558 cut-off events. [2023-11-30 04:48:36,039 INFO L125 PetriNetUnfolderBase]: For 3204/7328 co-relation queries the response was YES. [2023-11-30 04:48:36,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14570 conditions, 3558 events. 1459/3558 cut-off events. For 3204/7328 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 28486 event pairs, 686 based on Foata normal form. 2/2834 useless extension candidates. Maximal degree in co-relation 14459. Up to 2053 conditions per place. [2023-11-30 04:48:36,059 INFO L140 encePairwiseOnDemand]: 176/179 looper letters, 69 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2023-11-30 04:48:36,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 169 transitions, 1061 flow [2023-11-30 04:48:36,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:36,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:36,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2023-11-30 04:48:36,061 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6554934823091247 [2023-11-30 04:48:36,061 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2023-11-30 04:48:36,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2023-11-30 04:48:36,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:36,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2023-11-30 04:48:36,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:36,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:36,064 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:36,067 INFO L307 CegarLoopForPetriNet]: 183 programPoint places, -22 predicate places. [2023-11-30 04:48:36,067 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 169 transitions, 1061 flow [2023-11-30 04:48:36,069 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:36,069 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:36,069 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:36,069 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:48:36,070 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-30 04:48:36,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:36,074 INFO L85 PathProgramCache]: Analyzing trace with hash -447541371, now seen corresponding path program 1 times [2023-11-30 04:48:36,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:36,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256673593] [2023-11-30 04:48:36,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:36,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:48:36,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:36,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256673593] [2023-11-30 04:48:36,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256673593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:36,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:36,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:48:36,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329931335] [2023-11-30 04:48:36,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:36,167 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:36,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:36,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:36,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:36,169 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 179 [2023-11-30 04:48:36,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 169 transitions, 1061 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:36,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:36,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 179 [2023-11-30 04:48:36,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:36,812 INFO L124 PetriNetUnfolderBase]: 1458/3575 cut-off events. [2023-11-30 04:48:36,813 INFO L125 PetriNetUnfolderBase]: For 6752/7936 co-relation queries the response was YES. [2023-11-30 04:48:36,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16730 conditions, 3575 events. 1458/3575 cut-off events. For 6752/7936 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 29036 event pairs, 178 based on Foata normal form. 2/2921 useless extension candidates. Maximal degree in co-relation 16611. Up to 2053 conditions per place. [2023-11-30 04:48:36,837 INFO L140 encePairwiseOnDemand]: 176/179 looper letters, 81 selfloop transitions, 2 changer transitions 0/185 dead transitions. [2023-11-30 04:48:36,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 185 transitions, 1423 flow [2023-11-30 04:48:36,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:36,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:36,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-11-30 04:48:36,838 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6778398510242085 [2023-11-30 04:48:36,838 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-11-30 04:48:36,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-11-30 04:48:36,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:36,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-11-30 04:48:36,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:36,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:36,841 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:36,842 INFO L307 CegarLoopForPetriNet]: 183 programPoint places, -21 predicate places. [2023-11-30 04:48:36,842 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 185 transitions, 1423 flow [2023-11-30 04:48:36,842 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:36,842 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:36,842 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:36,843 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:48:36,843 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-30 04:48:36,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:36,844 INFO L85 PathProgramCache]: Analyzing trace with hash -2083202044, now seen corresponding path program 1 times [2023-11-30 04:48:36,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:36,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877190263] [2023-11-30 04:48:36,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:36,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:36,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:48:36,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:36,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877190263] [2023-11-30 04:48:36,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877190263] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:36,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:36,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:48:36,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016720648] [2023-11-30 04:48:36,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:36,936 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:36,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:36,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:36,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:36,937 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 179 [2023-11-30 04:48:36,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 185 transitions, 1423 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:36,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:36,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 179 [2023-11-30 04:48:36,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:37,674 INFO L124 PetriNetUnfolderBase]: 1779/4031 cut-off events. [2023-11-30 04:48:37,675 INFO L125 PetriNetUnfolderBase]: For 13583/13811 co-relation queries the response was YES. [2023-11-30 04:48:37,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21718 conditions, 4031 events. 1779/4031 cut-off events. For 13583/13811 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 32410 event pairs, 102 based on Foata normal form. 6/3244 useless extension candidates. Maximal degree in co-relation 21591. Up to 2381 conditions per place. [2023-11-30 04:48:37,696 INFO L140 encePairwiseOnDemand]: 176/179 looper letters, 101 selfloop transitions, 2 changer transitions 0/204 dead transitions. [2023-11-30 04:48:37,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 204 transitions, 1901 flow [2023-11-30 04:48:37,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:37,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:37,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-11-30 04:48:37,698 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6778398510242085 [2023-11-30 04:48:37,698 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-11-30 04:48:37,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-11-30 04:48:37,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:37,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-11-30 04:48:37,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:37,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:37,702 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:37,703 INFO L307 CegarLoopForPetriNet]: 183 programPoint places, -20 predicate places. [2023-11-30 04:48:37,703 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 204 transitions, 1901 flow [2023-11-30 04:48:37,703 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:37,703 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:37,703 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:37,703 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:48:37,704 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-30 04:48:37,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:37,704 INFO L85 PathProgramCache]: Analyzing trace with hash -2083202045, now seen corresponding path program 1 times [2023-11-30 04:48:37,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:37,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715259596] [2023-11-30 04:48:37,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:37,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:37,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:48:37,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:37,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715259596] [2023-11-30 04:48:37,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715259596] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:37,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:37,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:48:37,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556759016] [2023-11-30 04:48:37,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:37,756 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:37,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:37,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:37,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:37,757 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 179 [2023-11-30 04:48:37,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 204 transitions, 1901 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:37,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:37,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 179 [2023-11-30 04:48:37,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:38,323 INFO L124 PetriNetUnfolderBase]: 1772/4018 cut-off events. [2023-11-30 04:48:38,323 INFO L125 PetriNetUnfolderBase]: For 17218/17484 co-relation queries the response was YES. [2023-11-30 04:48:38,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24291 conditions, 4018 events. 1772/4018 cut-off events. For 17218/17484 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 32327 event pairs, 102 based on Foata normal form. 6/3231 useless extension candidates. Maximal degree in co-relation 24155. Up to 2396 conditions per place. [2023-11-30 04:48:38,354 INFO L140 encePairwiseOnDemand]: 176/179 looper letters, 104 selfloop transitions, 2 changer transitions 0/203 dead transitions. [2023-11-30 04:48:38,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 203 transitions, 2101 flow [2023-11-30 04:48:38,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:38,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:38,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2023-11-30 04:48:38,356 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6517690875232774 [2023-11-30 04:48:38,356 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2023-11-30 04:48:38,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2023-11-30 04:48:38,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:38,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2023-11-30 04:48:38,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:38,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:38,358 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:38,359 INFO L307 CegarLoopForPetriNet]: 183 programPoint places, -19 predicate places. [2023-11-30 04:48:38,359 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 203 transitions, 2101 flow [2023-11-30 04:48:38,359 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:38,360 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:38,360 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:38,360 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:48:38,360 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-30 04:48:38,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:38,360 INFO L85 PathProgramCache]: Analyzing trace with hash -663832018, now seen corresponding path program 1 times [2023-11-30 04:48:38,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:38,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577971349] [2023-11-30 04:48:38,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:38,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:38,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:48:38,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:38,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577971349] [2023-11-30 04:48:38,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577971349] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:38,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:38,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:48:38,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739034663] [2023-11-30 04:48:38,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:38,513 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:38,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:38,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:38,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:38,514 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 179 [2023-11-30 04:48:38,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 203 transitions, 2101 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:38,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:38,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 179 [2023-11-30 04:48:38,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:39,185 INFO L124 PetriNetUnfolderBase]: 1730/3978 cut-off events. [2023-11-30 04:48:39,186 INFO L125 PetriNetUnfolderBase]: For 20813/21115 co-relation queries the response was YES. [2023-11-30 04:48:39,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25749 conditions, 3978 events. 1730/3978 cut-off events. For 20813/21115 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 32257 event pairs, 90 based on Foata normal form. 0/3203 useless extension candidates. Maximal degree in co-relation 25610. Up to 2396 conditions per place. [2023-11-30 04:48:39,220 INFO L140 encePairwiseOnDemand]: 175/179 looper letters, 142 selfloop transitions, 14 changer transitions 0/271 dead transitions. [2023-11-30 04:48:39,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 271 transitions, 3643 flow [2023-11-30 04:48:39,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:39,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:39,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2023-11-30 04:48:39,221 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7486033519553073 [2023-11-30 04:48:39,222 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2023-11-30 04:48:39,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2023-11-30 04:48:39,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:39,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2023-11-30 04:48:39,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:39,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:39,224 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:39,225 INFO L307 CegarLoopForPetriNet]: 183 programPoint places, -17 predicate places. [2023-11-30 04:48:39,225 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 271 transitions, 3643 flow [2023-11-30 04:48:39,225 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:39,225 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:39,225 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:39,225 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 04:48:39,226 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-30 04:48:39,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:39,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1826688575, now seen corresponding path program 1 times [2023-11-30 04:48:39,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:39,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881482706] [2023-11-30 04:48:39,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:39,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:39,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-11-30 04:48:39,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:39,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881482706] [2023-11-30 04:48:39,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881482706] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:39,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:39,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 04:48:39,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989634323] [2023-11-30 04:48:39,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:39,352 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 04:48:39,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:39,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 04:48:39,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-30 04:48:39,355 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 179 [2023-11-30 04:48:39,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 271 transitions, 3643 flow. Second operand has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:39,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:39,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 179 [2023-11-30 04:48:39,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:40,167 INFO L124 PetriNetUnfolderBase]: 1718/3957 cut-off events. [2023-11-30 04:48:40,167 INFO L125 PetriNetUnfolderBase]: For 25770/26110 co-relation queries the response was YES. [2023-11-30 04:48:40,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27757 conditions, 3957 events. 1718/3957 cut-off events. For 25770/26110 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 32077 event pairs, 84 based on Foata normal form. 0/3192 useless extension candidates. Maximal degree in co-relation 27607. Up to 2396 conditions per place. [2023-11-30 04:48:40,204 INFO L140 encePairwiseOnDemand]: 170/179 looper letters, 145 selfloop transitions, 36 changer transitions 0/279 dead transitions. [2023-11-30 04:48:40,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 279 transitions, 4127 flow [2023-11-30 04:48:40,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:48:40,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:48:40,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 478 transitions. [2023-11-30 04:48:40,206 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6675977653631285 [2023-11-30 04:48:40,206 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 478 transitions. [2023-11-30 04:48:40,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 478 transitions. [2023-11-30 04:48:40,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:40,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 478 transitions. [2023-11-30 04:48:40,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:40,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:40,209 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:40,209 INFO L307 CegarLoopForPetriNet]: 183 programPoint places, -15 predicate places. [2023-11-30 04:48:40,209 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 279 transitions, 4127 flow [2023-11-30 04:48:40,210 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:40,210 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:40,210 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:40,210 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 04:48:40,210 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-30 04:48:40,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:40,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1826688574, now seen corresponding path program 1 times [2023-11-30 04:48:40,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:40,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268105404] [2023-11-30 04:48:40,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:40,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:40,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:48:40,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:40,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268105404] [2023-11-30 04:48:40,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268105404] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:40,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:40,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:48:40,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22798406] [2023-11-30 04:48:40,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:40,513 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:48:40,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:40,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:48:40,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:48:40,515 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 179 [2023-11-30 04:48:40,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 279 transitions, 4127 flow. Second operand has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:40,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:40,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 179 [2023-11-30 04:48:40,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:41,224 INFO L124 PetriNetUnfolderBase]: 1706/3936 cut-off events. [2023-11-30 04:48:41,225 INFO L125 PetriNetUnfolderBase]: For 30968/31346 co-relation queries the response was YES. [2023-11-30 04:48:41,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29485 conditions, 3936 events. 1706/3936 cut-off events. For 30968/31346 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 32074 event pairs, 78 based on Foata normal form. 2/3182 useless extension candidates. Maximal degree in co-relation 29325. Up to 2396 conditions per place. [2023-11-30 04:48:41,258 INFO L140 encePairwiseOnDemand]: 176/179 looper letters, 155 selfloop transitions, 14 changer transitions 0/278 dead transitions. [2023-11-30 04:48:41,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 278 transitions, 4443 flow [2023-11-30 04:48:41,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:48:41,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:48:41,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 480 transitions. [2023-11-30 04:48:41,260 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6703910614525139 [2023-11-30 04:48:41,260 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 480 transitions. [2023-11-30 04:48:41,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 480 transitions. [2023-11-30 04:48:41,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:41,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 480 transitions. [2023-11-30 04:48:41,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:41,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:41,263 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:41,263 INFO L307 CegarLoopForPetriNet]: 183 programPoint places, -13 predicate places. [2023-11-30 04:48:41,263 INFO L500 AbstractCegarLoop]: Abstraction has has 170 places, 278 transitions, 4443 flow [2023-11-30 04:48:41,264 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:41,264 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:41,264 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:41,264 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 04:48:41,264 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-30 04:48:41,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:41,264 INFO L85 PathProgramCache]: Analyzing trace with hash 954192030, now seen corresponding path program 1 times [2023-11-30 04:48:41,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:41,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118240414] [2023-11-30 04:48:41,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:41,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:41,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:48:41,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:41,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118240414] [2023-11-30 04:48:41,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118240414] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:41,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:41,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-30 04:48:41,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470230498] [2023-11-30 04:48:41,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:41,577 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-30 04:48:41,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:41,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-30 04:48:41,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-30 04:48:41,578 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 179 [2023-11-30 04:48:41,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 278 transitions, 4443 flow. Second operand has 9 states, 9 states have (on average 101.44444444444444) internal successors, (913), 9 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:41,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:41,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 179 [2023-11-30 04:48:41,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:42,185 INFO L124 PetriNetUnfolderBase]: 1176/2978 cut-off events. [2023-11-30 04:48:42,185 INFO L125 PetriNetUnfolderBase]: For 26709/27123 co-relation queries the response was YES. [2023-11-30 04:48:42,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23128 conditions, 2978 events. 1176/2978 cut-off events. For 26709/27123 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 23438 event pairs, 78 based on Foata normal form. 0/2510 useless extension candidates. Maximal degree in co-relation 22957. Up to 1717 conditions per place. [2023-11-30 04:48:42,210 INFO L140 encePairwiseOnDemand]: 160/179 looper letters, 160 selfloop transitions, 30 changer transitions 0/283 dead transitions. [2023-11-30 04:48:42,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 283 transitions, 4943 flow [2023-11-30 04:48:42,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-30 04:48:42,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-30 04:48:42,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 864 transitions. [2023-11-30 04:48:42,213 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6033519553072626 [2023-11-30 04:48:42,213 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 864 transitions. [2023-11-30 04:48:42,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 864 transitions. [2023-11-30 04:48:42,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:42,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 864 transitions. [2023-11-30 04:48:42,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:42,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 179.0) internal successors, (1611), 9 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:42,217 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 179.0) internal successors, (1611), 9 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:42,218 INFO L307 CegarLoopForPetriNet]: 183 programPoint places, -6 predicate places. [2023-11-30 04:48:42,218 INFO L500 AbstractCegarLoop]: Abstraction has has 177 places, 283 transitions, 4943 flow [2023-11-30 04:48:42,218 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 101.44444444444444) internal successors, (913), 9 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:42,218 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:42,218 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:42,218 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 04:48:42,219 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-30 04:48:42,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:42,219 INFO L85 PathProgramCache]: Analyzing trace with hash 414957480, now seen corresponding path program 1 times [2023-11-30 04:48:42,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:42,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190033710] [2023-11-30 04:48:42,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:42,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:42,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:48:42,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:42,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190033710] [2023-11-30 04:48:42,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190033710] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:42,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:42,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-30 04:48:42,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130911233] [2023-11-30 04:48:42,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:42,701 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-30 04:48:42,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:42,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-30 04:48:42,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-30 04:48:42,703 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 179 [2023-11-30 04:48:42,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 283 transitions, 4943 flow. Second operand has 11 states, 11 states have (on average 99.18181818181819) internal successors, (1091), 11 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:42,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:42,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 179 [2023-11-30 04:48:42,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:43,141 INFO L124 PetriNetUnfolderBase]: 530/1425 cut-off events. [2023-11-30 04:48:43,141 INFO L125 PetriNetUnfolderBase]: For 14654/15108 co-relation queries the response was YES. [2023-11-30 04:48:43,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11259 conditions, 1425 events. 530/1425 cut-off events. For 14654/15108 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 8270 event pairs, 24 based on Foata normal form. 0/1389 useless extension candidates. Maximal degree in co-relation 11077. Up to 624 conditions per place. [2023-11-30 04:48:43,148 INFO L140 encePairwiseOnDemand]: 164/179 looper letters, 0 selfloop transitions, 0 changer transitions 257/257 dead transitions. [2023-11-30 04:48:43,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 257 transitions, 4597 flow [2023-11-30 04:48:43,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 04:48:43,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 04:48:43,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 936 transitions. [2023-11-30 04:48:43,151 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5810055865921788 [2023-11-30 04:48:43,151 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 936 transitions. [2023-11-30 04:48:43,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 936 transitions. [2023-11-30 04:48:43,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:43,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 936 transitions. [2023-11-30 04:48:43,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 104.0) internal successors, (936), 9 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-11-30 04:48:43,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 179.0) internal successors, (1790), 10 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:43,156 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 179.0) internal successors, (1790), 10 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:43,156 INFO L307 CegarLoopForPetriNet]: 183 programPoint places, -5 predicate places. [2023-11-30 04:48:43,156 INFO L500 AbstractCegarLoop]: Abstraction has has 178 places, 257 transitions, 4597 flow [2023-11-30 04:48:43,157 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 99.18181818181819) internal successors, (1091), 11 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:43,171 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe009_rmo.oepc.i_BEv2_AllErrorsAtOnce [2023-11-30 04:48:43,233 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 75 remaining) [2023-11-30 04:48:43,234 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 75 remaining) [2023-11-30 04:48:43,234 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 75 remaining) [2023-11-30 04:48:43,234 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 75 remaining) [2023-11-30 04:48:43,235 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 75 remaining) [2023-11-30 04:48:43,235 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 75 remaining) [2023-11-30 04:48:43,235 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 75 remaining) [2023-11-30 04:48:43,235 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 75 remaining) [2023-11-30 04:48:43,235 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 75 remaining) [2023-11-30 04:48:43,235 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 75 remaining) [2023-11-30 04:48:43,235 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 75 remaining) [2023-11-30 04:48:43,236 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 75 remaining) [2023-11-30 04:48:43,236 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 75 remaining) [2023-11-30 04:48:43,236 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 75 remaining) [2023-11-30 04:48:43,236 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 75 remaining) [2023-11-30 04:48:43,236 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 75 remaining) [2023-11-30 04:48:43,236 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 75 remaining) [2023-11-30 04:48:43,236 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 75 remaining) [2023-11-30 04:48:43,237 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 75 remaining) [2023-11-30 04:48:43,237 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 75 remaining) [2023-11-30 04:48:43,237 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 75 remaining) [2023-11-30 04:48:43,237 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 75 remaining) [2023-11-30 04:48:43,237 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 75 remaining) [2023-11-30 04:48:43,237 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 75 remaining) [2023-11-30 04:48:43,237 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 75 remaining) [2023-11-30 04:48:43,237 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 75 remaining) [2023-11-30 04:48:43,237 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 75 remaining) [2023-11-30 04:48:43,237 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 75 remaining) [2023-11-30 04:48:43,238 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 75 remaining) [2023-11-30 04:48:43,238 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 75 remaining) [2023-11-30 04:48:43,238 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 75 remaining) [2023-11-30 04:48:43,238 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 75 remaining) [2023-11-30 04:48:43,238 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 75 remaining) [2023-11-30 04:48:43,238 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 75 remaining) [2023-11-30 04:48:43,238 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 75 remaining) [2023-11-30 04:48:43,238 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 75 remaining) [2023-11-30 04:48:43,238 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 75 remaining) [2023-11-30 04:48:43,239 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 75 remaining) [2023-11-30 04:48:43,239 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 75 remaining) [2023-11-30 04:48:43,239 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 75 remaining) [2023-11-30 04:48:43,239 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 75 remaining) [2023-11-30 04:48:43,239 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 75 remaining) [2023-11-30 04:48:43,239 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 75 remaining) [2023-11-30 04:48:43,239 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 75 remaining) [2023-11-30 04:48:43,239 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 75 remaining) [2023-11-30 04:48:43,239 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 75 remaining) [2023-11-30 04:48:43,239 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 75 remaining) [2023-11-30 04:48:43,240 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 75 remaining) [2023-11-30 04:48:43,240 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 75 remaining) [2023-11-30 04:48:43,240 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 75 remaining) [2023-11-30 04:48:43,240 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 75 remaining) [2023-11-30 04:48:43,240 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 75 remaining) [2023-11-30 04:48:43,240 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 75 remaining) [2023-11-30 04:48:43,240 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 75 remaining) [2023-11-30 04:48:43,240 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 75 remaining) [2023-11-30 04:48:43,240 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 75 remaining) [2023-11-30 04:48:43,241 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 75 remaining) [2023-11-30 04:48:43,241 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 75 remaining) [2023-11-30 04:48:43,241 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 75 remaining) [2023-11-30 04:48:43,241 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 75 remaining) [2023-11-30 04:48:43,241 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 75 remaining) [2023-11-30 04:48:43,241 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 75 remaining) [2023-11-30 04:48:43,241 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 75 remaining) [2023-11-30 04:48:43,241 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 75 remaining) [2023-11-30 04:48:43,241 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 75 remaining) [2023-11-30 04:48:43,242 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 75 remaining) [2023-11-30 04:48:43,242 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 75 remaining) [2023-11-30 04:48:43,242 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 75 remaining) [2023-11-30 04:48:43,242 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 75 remaining) [2023-11-30 04:48:43,242 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 75 remaining) [2023-11-30 04:48:43,242 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 75 remaining) [2023-11-30 04:48:43,242 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 75 remaining) [2023-11-30 04:48:43,242 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 75 remaining) [2023-11-30 04:48:43,242 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 75 remaining) [2023-11-30 04:48:43,243 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 75 remaining) [2023-11-30 04:48:43,243 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 04:48:43,243 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:43,248 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:48:43,249 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:48:43,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:48:43 BasicIcfg [2023-11-30 04:48:43,257 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:48:43,258 INFO L158 Benchmark]: Toolchain (without parser) took 22102.69ms. Allocated memory was 480.2MB in the beginning and 7.7GB in the end (delta: 7.2GB). Free memory was 430.6MB in the beginning and 4.1GB in the end (delta: -3.7GB). Peak memory consumption was 3.5GB. Max. memory is 16.0GB. [2023-11-30 04:48:43,258 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 339.7MB. Free memory was 295.5MB in the beginning and 295.3MB in the end (delta: 153.8kB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:48:43,258 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.70ms. Allocated memory is still 480.2MB. Free memory was 430.6MB in the beginning and 406.1MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-11-30 04:48:43,258 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.96ms. Allocated memory is still 480.2MB. Free memory was 405.5MB in the beginning and 403.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:48:43,259 INFO L158 Benchmark]: Boogie Preprocessor took 38.81ms. Allocated memory is still 480.2MB. Free memory was 403.0MB in the beginning and 400.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:48:43,259 INFO L158 Benchmark]: RCFGBuilder took 1233.74ms. Allocated memory is still 480.2MB. Free memory was 400.9MB in the beginning and 363.0MB in the end (delta: 37.9MB). Peak memory consumption was 57.8MB. Max. memory is 16.0GB. [2023-11-30 04:48:43,259 INFO L158 Benchmark]: TraceAbstraction took 20204.65ms. Allocated memory was 480.2MB in the beginning and 7.7GB in the end (delta: 7.2GB). Free memory was 363.0MB in the beginning and 4.1GB in the end (delta: -3.7GB). Peak memory consumption was 3.4GB. Max. memory is 16.0GB. [2023-11-30 04:48:43,261 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.14ms. Allocated memory is still 339.7MB. Free memory was 295.5MB in the beginning and 295.3MB in the end (delta: 153.8kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 549.70ms. Allocated memory is still 480.2MB. Free memory was 430.6MB in the beginning and 406.1MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 69.96ms. Allocated memory is still 480.2MB. Free memory was 405.5MB in the beginning and 403.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 38.81ms. Allocated memory is still 480.2MB. Free memory was 403.0MB in the beginning and 400.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1233.74ms. Allocated memory is still 480.2MB. Free memory was 400.9MB in the beginning and 363.0MB in the end (delta: 37.9MB). Peak memory consumption was 57.8MB. Max. memory is 16.0GB. * TraceAbstraction took 20204.65ms. Allocated memory was 480.2MB in the beginning and 7.7GB in the end (delta: 7.2GB). Free memory was 363.0MB in the beginning and 4.1GB in the end (delta: -3.7GB). Peak memory consumption was 3.4GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - 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 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 227 locations, 75 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: 20.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 618 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 618 mSDsluCounter, 163 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 172 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1042 IncrementalHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 172 mSolverCounterUnsat, 134 mSDtfsCounter, 1042 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4943occurred in iteration=12, InterpolantAutomatonStates: 59, 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, 2.2s InterpolantComputationTime, 936 NumberOfCodeBlocks, 936 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 923 ConstructedInterpolants, 0 QuantifiedInterpolants, 3968 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 48 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 04:48:43,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...