/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 05:31:16,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 05:31:16,516 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 05:31:16,554 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 05:31:16,555 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 05:31:16,555 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 05:31:16,556 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 05:31:16,556 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 05:31:16,557 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 05:31:16,560 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 05:31:16,561 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 05:31:16,561 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 05:31:16,562 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 05:31:16,563 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 05:31:16,563 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 05:31:16,563 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 05:31:16,563 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 05:31:16,563 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 05:31:16,564 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 05:31:16,564 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 05:31:16,564 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 05:31:16,565 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 05:31:16,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 05:31:16,565 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 05:31:16,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 05:31:16,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 05:31:16,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 05:31:16,567 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 05:31:16,567 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 05:31:16,568 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 05:31:16,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 05:31:16,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 05:31:16,569 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 05:31:16,569 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-11-30 05:31:16,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 05:31:16,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 05:31:16,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 05:31:16,801 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 05:31:16,802 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 05:31:16,803 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2023-11-30 05:31:17,905 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 05:31:18,086 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 05:31:18,087 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2023-11-30 05:31:18,096 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f07f7571a/a69f9e8ae2ee43e7892e22b3dc44307f/FLAG116616c2a [2023-11-30 05:31:18,112 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f07f7571a/a69f9e8ae2ee43e7892e22b3dc44307f [2023-11-30 05:31:18,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 05:31:18,117 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 05:31:18,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 05:31:18,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 05:31:18,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 05:31:18,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 05:31:18" (1/1) ... [2023-11-30 05:31:18,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22d7feea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:31:18, skipping insertion in model container [2023-11-30 05:31:18,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 05:31:18" (1/1) ... [2023-11-30 05:31:18,152 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 05:31:18,348 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 05:31:18,360 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 05:31:18,405 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 05:31:18,420 INFO L206 MainTranslator]: Completed translation [2023-11-30 05:31:18,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:31:18 WrapperNode [2023-11-30 05:31:18,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 05:31:18,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 05:31:18,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 05:31:18,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 05:31:18,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:31:18" (1/1) ... [2023-11-30 05:31:18,446 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:31:18" (1/1) ... [2023-11-30 05:31:18,478 INFO L138 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2023-11-30 05:31:18,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 05:31:18,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 05:31:18,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 05:31:18,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 05:31:18,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:31:18" (1/1) ... [2023-11-30 05:31:18,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:31:18" (1/1) ... [2023-11-30 05:31:18,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:31:18" (1/1) ... [2023-11-30 05:31:18,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:31:18" (1/1) ... [2023-11-30 05:31:18,505 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:31:18" (1/1) ... [2023-11-30 05:31:18,508 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:31:18" (1/1) ... [2023-11-30 05:31:18,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:31:18" (1/1) ... [2023-11-30 05:31:18,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:31:18" (1/1) ... [2023-11-30 05:31:18,528 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 05:31:18,529 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 05:31:18,529 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 05:31:18,529 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 05:31:18,530 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:31:18" (1/1) ... [2023-11-30 05:31:18,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 05:31:18,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:31:18,566 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 05:31:18,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 05:31:18,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 05:31:18,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 05:31:18,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 05:31:18,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 05:31:18,605 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 05:31:18,605 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 05:31:18,605 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 05:31:18,605 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 05:31:18,605 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-30 05:31:18,606 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-30 05:31:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-30 05:31:18,606 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-30 05:31:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 05:31:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-11-30 05:31:18,606 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-11-30 05:31:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-11-30 05:31:18,606 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-11-30 05:31:18,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 05:31:18,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 05:31:18,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 05:31:18,608 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 05:31:18,737 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 05:31:18,740 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 05:31:19,120 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 05:31:19,131 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 05:31:19,132 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-30 05:31:19,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 05:31:19 BoogieIcfgContainer [2023-11-30 05:31:19,133 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 05:31:19,135 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 05:31:19,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 05:31:19,138 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 05:31:19,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 05:31:18" (1/3) ... [2023-11-30 05:31:19,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b12cf20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 05:31:19, skipping insertion in model container [2023-11-30 05:31:19,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:31:18" (2/3) ... [2023-11-30 05:31:19,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b12cf20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 05:31:19, skipping insertion in model container [2023-11-30 05:31:19,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 05:31:19" (3/3) ... [2023-11-30 05:31:19,141 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2023-11-30 05:31:19,155 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 05:31:19,155 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2023-11-30 05:31:19,156 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 05:31:19,268 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-11-30 05:31:19,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 204 transitions, 450 flow [2023-11-30 05:31:19,400 INFO L124 PetriNetUnfolderBase]: 14/198 cut-off events. [2023-11-30 05:31:19,401 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-30 05:31:19,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 198 events. 14/198 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 145 event pairs, 0 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 140. Up to 2 conditions per place. [2023-11-30 05:31:19,408 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 204 transitions, 450 flow [2023-11-30 05:31:19,415 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 168 transitions, 369 flow [2023-11-30 05:31:19,429 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:31:19,435 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;@1b91a0d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:31:19,435 INFO L363 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2023-11-30 05:31:19,449 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:31:19,450 INFO L124 PetriNetUnfolderBase]: 1/53 cut-off events. [2023-11-30 05:31:19,450 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:31:19,450 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:31:19,451 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] [2023-11-30 05:31:19,451 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:31:19,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:31:19,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1371041594, now seen corresponding path program 1 times [2023-11-30 05:31:19,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:31:19,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093058716] [2023-11-30 05:31:19,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:19,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:31:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:20,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:31:20,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:31:20,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093058716] [2023-11-30 05:31:20,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093058716] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:31:20,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:31:20,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:31:20,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034411852] [2023-11-30 05:31:20,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:31:20,239 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:31:20,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:31:20,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:31:20,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:31:20,281 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 204 [2023-11-30 05:31:20,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 168 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:20,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:31:20,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 204 [2023-11-30 05:31:20,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:31:20,443 INFO L124 PetriNetUnfolderBase]: 6/159 cut-off events. [2023-11-30 05:31:20,443 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-30 05:31:20,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 159 events. 6/159 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 120 event pairs, 0 based on Foata normal form. 109/249 useless extension candidates. Maximal degree in co-relation 160. Up to 41 conditions per place. [2023-11-30 05:31:20,450 INFO L140 encePairwiseOnDemand]: 194/204 looper letters, 44 selfloop transitions, 1 changer transitions 1/159 dead transitions. [2023-11-30 05:31:20,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 159 transitions, 441 flow [2023-11-30 05:31:20,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:31:20,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:31:20,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2023-11-30 05:31:20,469 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7696078431372549 [2023-11-30 05:31:20,469 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 471 transitions. [2023-11-30 05:31:20,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 471 transitions. [2023-11-30 05:31:20,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:31:20,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 471 transitions. [2023-11-30 05:31:20,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:20,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:20,485 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:20,489 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, 0 predicate places. [2023-11-30 05:31:20,489 INFO L500 AbstractCegarLoop]: Abstraction has has 174 places, 159 transitions, 441 flow [2023-11-30 05:31:20,490 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:20,490 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:31:20,490 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] [2023-11-30 05:31:20,491 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 05:31:20,491 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:31:20,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:31:20,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1371041593, now seen corresponding path program 1 times [2023-11-30 05:31:20,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:31:20,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38361855] [2023-11-30 05:31:20,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:20,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:31:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:20,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:31:20,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:31:20,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38361855] [2023-11-30 05:31:20,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38361855] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:31:20,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:31:20,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 05:31:20,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769484423] [2023-11-30 05:31:20,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:31:20,928 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 05:31:20,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:31:20,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 05:31:20,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-30 05:31:20,931 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 204 [2023-11-30 05:31:20,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 159 transitions, 441 flow. Second operand has 5 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:20,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:31:20,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 204 [2023-11-30 05:31:20,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:31:21,047 INFO L124 PetriNetUnfolderBase]: 6/157 cut-off events. [2023-11-30 05:31:21,047 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-30 05:31:21,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 157 events. 6/157 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 117 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 189. Up to 49 conditions per place. [2023-11-30 05:31:21,049 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 52 selfloop transitions, 1 changer transitions 1/157 dead transitions. [2023-11-30 05:31:21,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 157 transitions, 539 flow [2023-11-30 05:31:21,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:31:21,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:31:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2023-11-30 05:31:21,051 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-30 05:31:21,051 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2023-11-30 05:31:21,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2023-11-30 05:31:21,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:31:21,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2023-11-30 05:31:21,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:21,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:21,055 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:21,056 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, 0 predicate places. [2023-11-30 05:31:21,056 INFO L500 AbstractCegarLoop]: Abstraction has has 174 places, 157 transitions, 539 flow [2023-11-30 05:31:21,056 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:21,056 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:31:21,057 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] [2023-11-30 05:31:21,057 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 05:31:21,057 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:31:21,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:31:21,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1268645415, now seen corresponding path program 1 times [2023-11-30 05:31:21,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:31:21,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768513982] [2023-11-30 05:31:21,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:21,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:31:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:21,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:31:21,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:31:21,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768513982] [2023-11-30 05:31:21,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768513982] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:31:21,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:31:21,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:31:21,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057406308] [2023-11-30 05:31:21,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:31:21,320 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:31:21,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:31:21,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:31:21,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:31:21,324 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 204 [2023-11-30 05:31:21,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 157 transitions, 539 flow. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:21,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:31:21,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 204 [2023-11-30 05:31:21,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:31:21,410 INFO L124 PetriNetUnfolderBase]: 6/155 cut-off events. [2023-11-30 05:31:21,410 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-11-30 05:31:21,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 155 events. 6/155 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 212. Up to 47 conditions per place. [2023-11-30 05:31:21,412 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 42 selfloop transitions, 1 changer transitions 1/155 dead transitions. [2023-11-30 05:31:21,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 155 transitions, 613 flow [2023-11-30 05:31:21,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:31:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:31:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2023-11-30 05:31:21,414 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7549019607843137 [2023-11-30 05:31:21,414 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 462 transitions. [2023-11-30 05:31:21,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 462 transitions. [2023-11-30 05:31:21,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:31:21,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 462 transitions. [2023-11-30 05:31:21,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:21,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:21,417 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:21,418 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, 0 predicate places. [2023-11-30 05:31:21,418 INFO L500 AbstractCegarLoop]: Abstraction has has 174 places, 155 transitions, 613 flow [2023-11-30 05:31:21,419 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:21,419 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:31:21,419 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] [2023-11-30 05:31:21,419 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 05:31:21,419 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:31:21,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:31:21,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1268645416, now seen corresponding path program 1 times [2023-11-30 05:31:21,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:31:21,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879043462] [2023-11-30 05:31:21,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:21,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:31:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:21,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:31:21,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:31:21,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879043462] [2023-11-30 05:31:21,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879043462] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:31:21,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:31:21,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 05:31:21,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002993899] [2023-11-30 05:31:21,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:31:21,714 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 05:31:21,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:31:21,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 05:31:21,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-30 05:31:21,719 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 204 [2023-11-30 05:31:21,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 155 transitions, 613 flow. Second operand has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:21,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:31:21,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 204 [2023-11-30 05:31:21,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:31:21,814 INFO L124 PetriNetUnfolderBase]: 6/153 cut-off events. [2023-11-30 05:31:21,814 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2023-11-30 05:31:21,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 153 events. 6/153 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 2/140 useless extension candidates. Maximal degree in co-relation 238. Up to 45 conditions per place. [2023-11-30 05:31:21,816 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 48 selfloop transitions, 1 changer transitions 1/153 dead transitions. [2023-11-30 05:31:21,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 153 transitions, 699 flow [2023-11-30 05:31:21,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:31:21,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:31:21,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2023-11-30 05:31:21,818 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7156862745098039 [2023-11-30 05:31:21,818 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2023-11-30 05:31:21,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2023-11-30 05:31:21,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:31:21,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2023-11-30 05:31:21,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:21,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:21,821 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:21,822 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, 0 predicate places. [2023-11-30 05:31:21,822 INFO L500 AbstractCegarLoop]: Abstraction has has 174 places, 153 transitions, 699 flow [2023-11-30 05:31:21,823 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:21,823 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:31:21,823 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 05:31:21,823 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 05:31:21,824 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:31:21,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:31:21,824 INFO L85 PathProgramCache]: Analyzing trace with hash 389208948, now seen corresponding path program 1 times [2023-11-30 05:31:21,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:31:21,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142347609] [2023-11-30 05:31:21,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:21,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:31:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:22,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:31:22,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:31:22,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142347609] [2023-11-30 05:31:22,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142347609] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:31:22,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:31:22,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:31:22,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87050101] [2023-11-30 05:31:22,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:31:22,069 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:31:22,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:31:22,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:31:22,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:31:22,071 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 204 [2023-11-30 05:31:22,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 153 transitions, 699 flow. Second operand has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:22,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:31:22,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 204 [2023-11-30 05:31:22,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:31:22,154 INFO L124 PetriNetUnfolderBase]: 6/149 cut-off events. [2023-11-30 05:31:22,154 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2023-11-30 05:31:22,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 149 events. 6/149 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 2/138 useless extension candidates. Maximal degree in co-relation 257. Up to 41 conditions per place. [2023-11-30 05:31:22,156 INFO L140 encePairwiseOnDemand]: 199/204 looper letters, 44 selfloop transitions, 1 changer transitions 1/149 dead transitions. [2023-11-30 05:31:22,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 149 transitions, 757 flow [2023-11-30 05:31:22,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:31:22,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:31:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2023-11-30 05:31:22,158 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7124183006535948 [2023-11-30 05:31:22,158 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 436 transitions. [2023-11-30 05:31:22,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 436 transitions. [2023-11-30 05:31:22,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:31:22,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 436 transitions. [2023-11-30 05:31:22,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:22,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:22,162 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:22,164 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, -2 predicate places. [2023-11-30 05:31:22,164 INFO L500 AbstractCegarLoop]: Abstraction has has 172 places, 149 transitions, 757 flow [2023-11-30 05:31:22,165 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:22,165 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:31:22,166 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] [2023-11-30 05:31:22,168 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 05:31:22,169 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:31:22,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:31:22,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1765882480, now seen corresponding path program 1 times [2023-11-30 05:31:22,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:31:22,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324239403] [2023-11-30 05:31:22,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:22,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:31:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:22,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:31:22,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:31:22,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324239403] [2023-11-30 05:31:22,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324239403] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:31:22,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:31:22,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:31:22,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743785672] [2023-11-30 05:31:22,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:31:22,379 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:31:22,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:31:22,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:31:22,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:31:22,380 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 204 [2023-11-30 05:31:22,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 149 transitions, 757 flow. Second operand has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:22,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:31:22,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 204 [2023-11-30 05:31:22,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:31:22,455 INFO L124 PetriNetUnfolderBase]: 6/145 cut-off events. [2023-11-30 05:31:22,455 INFO L125 PetriNetUnfolderBase]: For 266/266 co-relation queries the response was YES. [2023-11-30 05:31:22,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 145 events. 6/145 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 2/136 useless extension candidates. Maximal degree in co-relation 272. Up to 37 conditions per place. [2023-11-30 05:31:22,457 INFO L140 encePairwiseOnDemand]: 199/204 looper letters, 40 selfloop transitions, 1 changer transitions 1/145 dead transitions. [2023-11-30 05:31:22,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 145 transitions, 799 flow [2023-11-30 05:31:22,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:31:22,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:31:22,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2023-11-30 05:31:22,459 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2023-11-30 05:31:22,459 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2023-11-30 05:31:22,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2023-11-30 05:31:22,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:31:22,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2023-11-30 05:31:22,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:22,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:22,462 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:22,462 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, -4 predicate places. [2023-11-30 05:31:22,462 INFO L500 AbstractCegarLoop]: Abstraction has has 170 places, 145 transitions, 799 flow [2023-11-30 05:31:22,463 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:22,463 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:31:22,463 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] [2023-11-30 05:31:22,463 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 05:31:22,463 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:31:22,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:31:22,464 INFO L85 PathProgramCache]: Analyzing trace with hash 123365748, now seen corresponding path program 1 times [2023-11-30 05:31:22,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:31:22,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595203536] [2023-11-30 05:31:22,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:22,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:31:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:22,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:31:22,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:31:22,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595203536] [2023-11-30 05:31:22,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595203536] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:31:22,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:31:22,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:31:22,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750316673] [2023-11-30 05:31:22,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:31:22,662 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:31:22,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:31:22,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:31:22,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:31:22,664 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 204 [2023-11-30 05:31:22,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 145 transitions, 799 flow. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:22,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:31:22,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 204 [2023-11-30 05:31:22,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:31:22,735 INFO L124 PetriNetUnfolderBase]: 6/141 cut-off events. [2023-11-30 05:31:22,735 INFO L125 PetriNetUnfolderBase]: For 360/360 co-relation queries the response was YES. [2023-11-30 05:31:22,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 427 conditions, 141 events. 6/141 cut-off events. For 360/360 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 78 event pairs, 0 based on Foata normal form. 2/134 useless extension candidates. Maximal degree in co-relation 283. Up to 33 conditions per place. [2023-11-30 05:31:22,737 INFO L140 encePairwiseOnDemand]: 199/204 looper letters, 36 selfloop transitions, 1 changer transitions 1/141 dead transitions. [2023-11-30 05:31:22,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 141 transitions, 825 flow [2023-11-30 05:31:22,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:31:22,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:31:22,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2023-11-30 05:31:22,739 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6993464052287581 [2023-11-30 05:31:22,739 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2023-11-30 05:31:22,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2023-11-30 05:31:22,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:31:22,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2023-11-30 05:31:22,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:22,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:22,742 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:22,742 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, -6 predicate places. [2023-11-30 05:31:22,742 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 141 transitions, 825 flow [2023-11-30 05:31:22,743 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:22,743 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:31:22,743 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] [2023-11-30 05:31:22,743 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 05:31:22,743 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:31:22,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:31:22,744 INFO L85 PathProgramCache]: Analyzing trace with hash 444301773, now seen corresponding path program 1 times [2023-11-30 05:31:22,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:31:22,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511541682] [2023-11-30 05:31:22,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:22,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:31:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:22,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:31:22,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:31:22,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511541682] [2023-11-30 05:31:22,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511541682] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:31:22,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:31:22,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:31:22,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562587204] [2023-11-30 05:31:22,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:31:22,820 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:31:22,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:31:22,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:31:22,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:31:22,822 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 204 [2023-11-30 05:31:22,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 141 transitions, 825 flow. Second operand has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:22,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:31:22,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 204 [2023-11-30 05:31:22,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:31:22,883 INFO L124 PetriNetUnfolderBase]: 6/139 cut-off events. [2023-11-30 05:31:22,883 INFO L125 PetriNetUnfolderBase]: For 455/455 co-relation queries the response was YES. [2023-11-30 05:31:22,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 139 events. 6/139 cut-off events. For 455/455 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 297. Up to 31 conditions per place. [2023-11-30 05:31:22,885 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 34 selfloop transitions, 1 changer transitions 1/139 dead transitions. [2023-11-30 05:31:22,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 139 transitions, 863 flow [2023-11-30 05:31:22,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:31:22,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:31:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2023-11-30 05:31:22,887 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7418300653594772 [2023-11-30 05:31:22,887 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 454 transitions. [2023-11-30 05:31:22,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 454 transitions. [2023-11-30 05:31:22,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:31:22,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 454 transitions. [2023-11-30 05:31:22,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:22,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:22,890 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:22,891 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, -6 predicate places. [2023-11-30 05:31:22,891 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 139 transitions, 863 flow [2023-11-30 05:31:22,892 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:22,892 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:31:22,892 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] [2023-11-30 05:31:22,892 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 05:31:22,892 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:31:22,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:31:22,893 INFO L85 PathProgramCache]: Analyzing trace with hash 444301774, now seen corresponding path program 1 times [2023-11-30 05:31:22,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:31:22,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601514970] [2023-11-30 05:31:22,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:22,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:31:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:23,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:31:23,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:31:23,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601514970] [2023-11-30 05:31:23,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601514970] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:31:23,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:31:23,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:31:23,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111833772] [2023-11-30 05:31:23,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:31:23,022 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:31:23,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:31:23,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:31:23,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:31:23,024 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 204 [2023-11-30 05:31:23,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 139 transitions, 863 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:23,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:31:23,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 204 [2023-11-30 05:31:23,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:31:23,082 INFO L124 PetriNetUnfolderBase]: 6/137 cut-off events. [2023-11-30 05:31:23,082 INFO L125 PetriNetUnfolderBase]: For 587/587 co-relation queries the response was YES. [2023-11-30 05:31:23,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 137 events. 6/137 cut-off events. For 587/587 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 2/132 useless extension candidates. Maximal degree in co-relation 310. Up to 29 conditions per place. [2023-11-30 05:31:23,084 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 0 selfloop transitions, 0 changer transitions 137/137 dead transitions. [2023-11-30 05:31:23,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 137 transitions, 899 flow [2023-11-30 05:31:23,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:31:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:31:23,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2023-11-30 05:31:23,086 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7663398692810458 [2023-11-30 05:31:23,086 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 469 transitions. [2023-11-30 05:31:23,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 469 transitions. [2023-11-30 05:31:23,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:31:23,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 469 transitions. [2023-11-30 05:31:23,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:23,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:23,089 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:23,091 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, -6 predicate places. [2023-11-30 05:31:23,091 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 137 transitions, 899 flow [2023-11-30 05:31:23,091 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:23,100 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bench-exp3x3-opt.wvr.c_BEv2_AllErrorsAtOnce [2023-11-30 05:31:23,145 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 30 remaining) [2023-11-30 05:31:23,146 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 30 remaining) [2023-11-30 05:31:23,146 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 30 remaining) [2023-11-30 05:31:23,146 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 30 remaining) [2023-11-30 05:31:23,146 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 30 remaining) [2023-11-30 05:31:23,146 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 30 remaining) [2023-11-30 05:31:23,146 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 30 remaining) [2023-11-30 05:31:23,146 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 30 remaining) [2023-11-30 05:31:23,146 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 30 remaining) [2023-11-30 05:31:23,146 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 30 remaining) [2023-11-30 05:31:23,147 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 30 remaining) [2023-11-30 05:31:23,147 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 30 remaining) [2023-11-30 05:31:23,147 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 30 remaining) [2023-11-30 05:31:23,147 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 30 remaining) [2023-11-30 05:31:23,147 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 30 remaining) [2023-11-30 05:31:23,147 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 30 remaining) [2023-11-30 05:31:23,147 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 30 remaining) [2023-11-30 05:31:23,147 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 30 remaining) [2023-11-30 05:31:23,147 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 30 remaining) [2023-11-30 05:31:23,148 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 30 remaining) [2023-11-30 05:31:23,148 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 30 remaining) [2023-11-30 05:31:23,148 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 30 remaining) [2023-11-30 05:31:23,148 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 30 remaining) [2023-11-30 05:31:23,148 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 30 remaining) [2023-11-30 05:31:23,149 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 30 remaining) [2023-11-30 05:31:23,149 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 30 remaining) [2023-11-30 05:31:23,149 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 30 remaining) [2023-11-30 05:31:23,149 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 30 remaining) [2023-11-30 05:31:23,149 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 30 remaining) [2023-11-30 05:31:23,149 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 30 remaining) [2023-11-30 05:31:23,150 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 05:31:23,150 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:31:23,153 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 05:31:23,154 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 05:31:23,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 05:31:23 BasicIcfg [2023-11-30 05:31:23,161 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 05:31:23,161 INFO L158 Benchmark]: Toolchain (without parser) took 5044.06ms. Allocated memory was 574.6MB in the beginning and 690.0MB in the end (delta: 115.3MB). Free memory was 524.0MB in the beginning and 497.4MB in the end (delta: 26.6MB). Peak memory consumption was 144.8MB. Max. memory is 16.0GB. [2023-11-30 05:31:23,161 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 364.9MB. Free memory was 314.8MB in the beginning and 314.7MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 05:31:23,161 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.00ms. Allocated memory is still 574.6MB. Free memory was 524.0MB in the beginning and 512.1MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-30 05:31:23,162 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.21ms. Allocated memory is still 574.6MB. Free memory was 512.1MB in the beginning and 510.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 05:31:23,162 INFO L158 Benchmark]: Boogie Preprocessor took 48.72ms. Allocated memory is still 574.6MB. Free memory was 510.0MB in the beginning and 508.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 05:31:23,162 INFO L158 Benchmark]: RCFGBuilder took 604.55ms. Allocated memory is still 574.6MB. Free memory was 508.4MB in the beginning and 486.7MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-11-30 05:31:23,162 INFO L158 Benchmark]: TraceAbstraction took 4025.46ms. Allocated memory was 574.6MB in the beginning and 690.0MB in the end (delta: 115.3MB). Free memory was 486.0MB in the beginning and 497.4MB in the end (delta: -11.4MB). Peak memory consumption was 107.1MB. Max. memory is 16.0GB. [2023-11-30 05:31:23,163 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 364.9MB. Free memory was 314.8MB in the beginning and 314.7MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 301.00ms. Allocated memory is still 574.6MB. Free memory was 524.0MB in the beginning and 512.1MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.21ms. Allocated memory is still 574.6MB. Free memory was 512.1MB in the beginning and 510.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 48.72ms. Allocated memory is still 574.6MB. Free memory was 510.0MB in the beginning and 508.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 604.55ms. Allocated memory is still 574.6MB. Free memory was 508.4MB in the beginning and 486.7MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 4025.46ms. Allocated memory was 574.6MB in the beginning and 690.0MB in the end (delta: 115.3MB). Free memory was 486.0MB in the beginning and 497.4MB in the end (delta: -11.4MB). Peak memory consumption was 107.1MB. 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 233 locations, 30 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: 3.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 407 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 407 mSDsluCounter, 71 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 378 IncrementalHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 65 mSDtfsCounter, 378 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=899occurred in iteration=9, InterpolantAutomatonStates: 27, 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, 585 NumberOfCodeBlocks, 585 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 576 ConstructedInterpolants, 0 QuantifiedInterpolants, 3448 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 24 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 05:31:23,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...