/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe014_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:09:24,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:09:24,373 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 21:09:24,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:09:24,397 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:09:24,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:09:24,397 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:09:24,398 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:09:24,398 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:09:24,401 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:09:24,402 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:09:24,402 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:09:24,402 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:09:24,403 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:09:24,403 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:09:24,403 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:09:24,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:09:24,403 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:09:24,404 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:09:24,404 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:09:24,404 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:09:24,405 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:09:24,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:09:24,405 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:09:24,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:09:24,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:09:24,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:09:24,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:09:24,406 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:09:24,406 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:09:24,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:09:24,407 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:09:24,407 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:09:24,407 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 21:09:24,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:09:24,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:09:24,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:09:24,631 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:09:24,633 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:09:24,633 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe014_power.opt.i [2023-12-05 21:09:25,700 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:09:25,888 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:09:25,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe014_power.opt.i [2023-12-05 21:09:25,905 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecdb93d2a/65ca602a200d4284b1e61ddddec8bddc/FLAGe94a0bbf9 [2023-12-05 21:09:25,924 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecdb93d2a/65ca602a200d4284b1e61ddddec8bddc [2023-12-05 21:09:25,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:09:25,927 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:09:25,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:09:25,930 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:09:25,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:09:25,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:09:25" (1/1) ... [2023-12-05 21:09:25,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70b21324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:25, skipping insertion in model container [2023-12-05 21:09:25,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:09:25" (1/1) ... [2023-12-05 21:09:25,979 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:09:26,311 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:09:26,321 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:09:26,361 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:09:26,382 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:09:26,382 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:09:26,387 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:09:26,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:26 WrapperNode [2023-12-05 21:09:26,388 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:09:26,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:09:26,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:09:26,389 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:09:26,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:26" (1/1) ... [2023-12-05 21:09:26,407 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:26" (1/1) ... [2023-12-05 21:09:26,430 INFO L138 Inliner]: procedures = 176, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 186 [2023-12-05 21:09:26,435 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:09:26,436 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:09:26,436 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:09:26,436 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:09:26,442 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:26" (1/1) ... [2023-12-05 21:09:26,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:26" (1/1) ... [2023-12-05 21:09:26,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:26" (1/1) ... [2023-12-05 21:09:26,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:26" (1/1) ... [2023-12-05 21:09:26,455 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:26" (1/1) ... [2023-12-05 21:09:26,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:26" (1/1) ... [2023-12-05 21:09:26,459 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:26" (1/1) ... [2023-12-05 21:09:26,460 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:26" (1/1) ... [2023-12-05 21:09:26,463 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:09:26,464 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:09:26,464 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:09:26,464 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:09:26,465 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:26" (1/1) ... [2023-12-05 21:09:26,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:09:26,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:09:26,512 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 21:09:26,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 21:09:26,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:09:26,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:09:26,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:09:26,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:09:26,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:09:26,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:09:26,535 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-05 21:09:26,535 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-05 21:09:26,535 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-05 21:09:26,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-05 21:09:26,536 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-05 21:09:26,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-05 21:09:26,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:09:26,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:09:26,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:09:26,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:09:26,537 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:09:26,704 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:09:26,714 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:09:27,019 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:09:27,380 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:09:27,380 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:09:27,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:09:27 BoogieIcfgContainer [2023-12-05 21:09:27,381 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:09:27,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:09:27,383 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:09:27,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:09:27,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:09:25" (1/3) ... [2023-12-05 21:09:27,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@400c9967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:09:27, skipping insertion in model container [2023-12-05 21:09:27,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:26" (2/3) ... [2023-12-05 21:09:27,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@400c9967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:09:27, skipping insertion in model container [2023-12-05 21:09:27,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:09:27" (3/3) ... [2023-12-05 21:09:27,387 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_power.opt.i [2023-12-05 21:09:27,401 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:09:27,401 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2023-12-05 21:09:27,401 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:09:27,486 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:09:27,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 165 transitions, 342 flow [2023-12-05 21:09:27,594 INFO L124 PetriNetUnfolderBase]: 3/162 cut-off events. [2023-12-05 21:09:27,594 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:09:27,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 162 events. 3/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 224 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2023-12-05 21:09:27,600 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 165 transitions, 342 flow [2023-12-05 21:09:27,605 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 162 transitions, 333 flow [2023-12-05 21:09:27,617 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:09:27,622 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;@501d650b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:09:27,623 INFO L363 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2023-12-05 21:09:27,633 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:09:27,633 INFO L124 PetriNetUnfolderBase]: 0/57 cut-off events. [2023-12-05 21:09:27,633 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:09:27,634 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:27,634 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:27,634 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-12-05 21:09:27,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:27,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1322565652, now seen corresponding path program 1 times [2023-12-05 21:09:27,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:27,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019448772] [2023-12-05 21:09:27,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:27,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:27,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:27,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:27,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019448772] [2023-12-05 21:09:27,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019448772] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:27,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:27,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:27,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398165937] [2023-12-05 21:09:27,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:27,899 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:27,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:27,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:27,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:27,924 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 165 [2023-12-05 21:09:27,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 162 transitions, 333 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:27,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:27,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 165 [2023-12-05 21:09:27,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:28,454 INFO L124 PetriNetUnfolderBase]: 627/1695 cut-off events. [2023-12-05 21:09:28,454 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-05 21:09:28,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2777 conditions, 1695 events. 627/1695 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 11468 event pairs, 402 based on Foata normal form. 60/1080 useless extension candidates. Maximal degree in co-relation 2702. Up to 689 conditions per place. [2023-12-05 21:09:28,471 INFO L140 encePairwiseOnDemand]: 145/165 looper letters, 46 selfloop transitions, 2 changer transitions 0/150 dead transitions. [2023-12-05 21:09:28,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 150 transitions, 405 flow [2023-12-05 21:09:28,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:28,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:28,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2023-12-05 21:09:28,485 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8101010101010101 [2023-12-05 21:09:28,486 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2023-12-05 21:09:28,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2023-12-05 21:09:28,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:28,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2023-12-05 21:09:28,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:28,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:28,498 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:28,503 INFO L308 CegarLoopForPetriNet]: 169 programPoint places, -16 predicate places. [2023-12-05 21:09:28,503 INFO L500 AbstractCegarLoop]: Abstraction has has 153 places, 150 transitions, 405 flow [2023-12-05 21:09:28,504 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:28,504 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:28,504 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:28,504 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:09:28,505 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-12-05 21:09:28,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:28,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1322565653, now seen corresponding path program 1 times [2023-12-05 21:09:28,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:28,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837669530] [2023-12-05 21:09:28,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:28,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:28,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:28,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:28,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837669530] [2023-12-05 21:09:28,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837669530] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:28,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:28,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:28,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202224880] [2023-12-05 21:09:28,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:28,657 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:28,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:28,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:28,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:28,658 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 165 [2023-12-05 21:09:28,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 150 transitions, 405 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:28,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:28,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 165 [2023-12-05 21:09:28,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:29,075 INFO L124 PetriNetUnfolderBase]: 633/1708 cut-off events. [2023-12-05 21:09:29,075 INFO L125 PetriNetUnfolderBase]: For 147/339 co-relation queries the response was YES. [2023-12-05 21:09:29,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3803 conditions, 1708 events. 633/1708 cut-off events. For 147/339 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 11530 event pairs, 408 based on Foata normal form. 0/1032 useless extension candidates. Maximal degree in co-relation 3722. Up to 767 conditions per place. [2023-12-05 21:09:29,086 INFO L140 encePairwiseOnDemand]: 162/165 looper letters, 51 selfloop transitions, 2 changer transitions 0/158 dead transitions. [2023-12-05 21:09:29,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 158 transitions, 543 flow [2023-12-05 21:09:29,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:29,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:29,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-12-05 21:09:29,087 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7575757575757576 [2023-12-05 21:09:29,087 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-12-05 21:09:29,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-12-05 21:09:29,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:29,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-12-05 21:09:29,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,090 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,091 INFO L308 CegarLoopForPetriNet]: 169 programPoint places, -15 predicate places. [2023-12-05 21:09:29,091 INFO L500 AbstractCegarLoop]: Abstraction has has 154 places, 158 transitions, 543 flow [2023-12-05 21:09:29,091 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,092 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:29,092 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:29,092 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:09:29,092 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-12-05 21:09:29,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:29,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1475843829, now seen corresponding path program 1 times [2023-12-05 21:09:29,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:29,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428819569] [2023-12-05 21:09:29,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:29,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:29,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:29,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428819569] [2023-12-05 21:09:29,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428819569] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:29,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:29,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:09:29,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106284275] [2023-12-05 21:09:29,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:29,313 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:09:29,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:29,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:09:29,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:09:29,316 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 165 [2023-12-05 21:09:29,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 158 transitions, 543 flow. Second operand has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:29,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 165 [2023-12-05 21:09:29,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:29,500 INFO L124 PetriNetUnfolderBase]: 111/447 cut-off events. [2023-12-05 21:09:29,500 INFO L125 PetriNetUnfolderBase]: For 156/236 co-relation queries the response was YES. [2023-12-05 21:09:29,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 447 events. 111/447 cut-off events. For 156/236 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1752 event pairs, 64 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 1019. Up to 134 conditions per place. [2023-12-05 21:09:29,503 INFO L140 encePairwiseOnDemand]: 150/165 looper letters, 39 selfloop transitions, 5 changer transitions 0/142 dead transitions. [2023-12-05 21:09:29,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 142 transitions, 535 flow [2023-12-05 21:09:29,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 21:09:29,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 21:09:29,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 678 transitions. [2023-12-05 21:09:29,505 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6848484848484848 [2023-12-05 21:09:29,505 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 678 transitions. [2023-12-05 21:09:29,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 678 transitions. [2023-12-05 21:09:29,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:29,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 678 transitions. [2023-12-05 21:09:29,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,508 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,509 INFO L308 CegarLoopForPetriNet]: 169 programPoint places, -17 predicate places. [2023-12-05 21:09:29,509 INFO L500 AbstractCegarLoop]: Abstraction has has 152 places, 142 transitions, 535 flow [2023-12-05 21:09:29,509 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,509 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:29,510 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:29,510 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:09:29,510 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-12-05 21:09:29,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:29,510 INFO L85 PathProgramCache]: Analyzing trace with hash -105693704, now seen corresponding path program 1 times [2023-12-05 21:09:29,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:29,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382737172] [2023-12-05 21:09:29,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:29,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:29,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:29,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:29,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382737172] [2023-12-05 21:09:29,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382737172] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:29,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:29,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:29,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567184031] [2023-12-05 21:09:29,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:29,549 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:29,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:29,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:29,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:29,550 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 165 [2023-12-05 21:09:29,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 142 transitions, 535 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:29,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 165 [2023-12-05 21:09:29,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:29,670 INFO L124 PetriNetUnfolderBase]: 132/466 cut-off events. [2023-12-05 21:09:29,670 INFO L125 PetriNetUnfolderBase]: For 354/450 co-relation queries the response was YES. [2023-12-05 21:09:29,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1441 conditions, 466 events. 132/466 cut-off events. For 354/450 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1784 event pairs, 51 based on Foata normal form. 2/393 useless extension candidates. Maximal degree in co-relation 1340. Up to 169 conditions per place. [2023-12-05 21:09:29,673 INFO L140 encePairwiseOnDemand]: 162/165 looper letters, 39 selfloop transitions, 2 changer transitions 0/142 dead transitions. [2023-12-05 21:09:29,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 142 transitions, 619 flow [2023-12-05 21:09:29,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:29,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:29,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-12-05 21:09:29,675 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7191919191919192 [2023-12-05 21:09:29,675 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-12-05 21:09:29,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-12-05 21:09:29,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:29,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-12-05 21:09:29,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,677 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,679 INFO L308 CegarLoopForPetriNet]: 169 programPoint places, -16 predicate places. [2023-12-05 21:09:29,679 INFO L500 AbstractCegarLoop]: Abstraction has has 153 places, 142 transitions, 619 flow [2023-12-05 21:09:29,679 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,679 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:29,679 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:29,680 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:09:29,680 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-12-05 21:09:29,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:29,680 INFO L85 PathProgramCache]: Analyzing trace with hash -105693703, now seen corresponding path program 1 times [2023-12-05 21:09:29,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:29,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817805542] [2023-12-05 21:09:29,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:29,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:29,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:29,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:29,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817805542] [2023-12-05 21:09:29,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817805542] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:29,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:29,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:29,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605510446] [2023-12-05 21:09:29,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:29,765 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:29,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:29,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:29,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:29,766 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 165 [2023-12-05 21:09:29,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 142 transitions, 619 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:29,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 165 [2023-12-05 21:09:29,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:29,869 INFO L124 PetriNetUnfolderBase]: 131/481 cut-off events. [2023-12-05 21:09:29,869 INFO L125 PetriNetUnfolderBase]: For 591/647 co-relation queries the response was YES. [2023-12-05 21:09:29,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1673 conditions, 481 events. 131/481 cut-off events. For 591/647 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1916 event pairs, 18 based on Foata normal form. 2/414 useless extension candidates. Maximal degree in co-relation 1564. Up to 169 conditions per place. [2023-12-05 21:09:29,873 INFO L140 encePairwiseOnDemand]: 162/165 looper letters, 41 selfloop transitions, 2 changer transitions 0/147 dead transitions. [2023-12-05 21:09:29,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 147 transitions, 757 flow [2023-12-05 21:09:29,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:29,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:29,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-12-05 21:09:29,874 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7353535353535353 [2023-12-05 21:09:29,874 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-12-05 21:09:29,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-12-05 21:09:29,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:29,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-12-05 21:09:29,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,877 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,877 INFO L308 CegarLoopForPetriNet]: 169 programPoint places, -15 predicate places. [2023-12-05 21:09:29,877 INFO L500 AbstractCegarLoop]: Abstraction has has 154 places, 147 transitions, 757 flow [2023-12-05 21:09:29,877 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,877 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:29,878 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:29,878 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:09:29,878 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-12-05 21:09:29,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:29,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1471710858, now seen corresponding path program 1 times [2023-12-05 21:09:29,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:29,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748589931] [2023-12-05 21:09:29,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:29,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:29,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:29,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748589931] [2023-12-05 21:09:29,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748589931] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:29,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:29,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:29,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321389887] [2023-12-05 21:09:29,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:29,918 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:29,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:29,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:29,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:29,919 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 165 [2023-12-05 21:09:29,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 147 transitions, 757 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:29,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 165 [2023-12-05 21:09:29,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:30,047 INFO L124 PetriNetUnfolderBase]: 152/500 cut-off events. [2023-12-05 21:09:30,047 INFO L125 PetriNetUnfolderBase]: For 1069/1139 co-relation queries the response was YES. [2023-12-05 21:09:30,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2061 conditions, 500 events. 152/500 cut-off events. For 1069/1139 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1967 event pairs, 18 based on Foata normal form. 2/422 useless extension candidates. Maximal degree in co-relation 1943. Up to 200 conditions per place. [2023-12-05 21:09:30,051 INFO L140 encePairwiseOnDemand]: 162/165 looper letters, 45 selfloop transitions, 2 changer transitions 0/147 dead transitions. [2023-12-05 21:09:30,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 147 transitions, 855 flow [2023-12-05 21:09:30,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:30,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:30,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-12-05 21:09:30,053 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7171717171717171 [2023-12-05 21:09:30,053 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-12-05 21:09:30,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-12-05 21:09:30,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:30,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-12-05 21:09:30,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:30,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:30,055 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:30,055 INFO L308 CegarLoopForPetriNet]: 169 programPoint places, -14 predicate places. [2023-12-05 21:09:30,055 INFO L500 AbstractCegarLoop]: Abstraction has has 155 places, 147 transitions, 855 flow [2023-12-05 21:09:30,055 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:30,056 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:30,056 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:30,056 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:09:30,056 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-12-05 21:09:30,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:30,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1471710859, now seen corresponding path program 1 times [2023-12-05 21:09:30,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:30,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445172629] [2023-12-05 21:09:30,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:30,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:30,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:30,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:30,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445172629] [2023-12-05 21:09:30,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445172629] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:30,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:30,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:30,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381675957] [2023-12-05 21:09:30,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:30,120 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:30,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:30,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:30,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:30,121 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 165 [2023-12-05 21:09:30,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 147 transitions, 855 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:30,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:30,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 165 [2023-12-05 21:09:30,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:30,276 INFO L124 PetriNetUnfolderBase]: 151/497 cut-off events. [2023-12-05 21:09:30,276 INFO L125 PetriNetUnfolderBase]: For 1440/1524 co-relation queries the response was YES. [2023-12-05 21:09:30,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2298 conditions, 497 events. 151/497 cut-off events. For 1440/1524 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1990 event pairs, 18 based on Foata normal form. 2/419 useless extension candidates. Maximal degree in co-relation 2172. Up to 200 conditions per place. [2023-12-05 21:09:30,281 INFO L140 encePairwiseOnDemand]: 162/165 looper letters, 47 selfloop transitions, 2 changer transitions 0/152 dead transitions. [2023-12-05 21:09:30,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 152 transitions, 1027 flow [2023-12-05 21:09:30,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:30,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:30,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-12-05 21:09:30,283 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-12-05 21:09:30,283 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-12-05 21:09:30,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-12-05 21:09:30,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:30,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-12-05 21:09:30,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:30,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:30,285 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:30,285 INFO L308 CegarLoopForPetriNet]: 169 programPoint places, -13 predicate places. [2023-12-05 21:09:30,285 INFO L500 AbstractCegarLoop]: Abstraction has has 156 places, 152 transitions, 1027 flow [2023-12-05 21:09:30,286 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:30,286 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:30,286 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:30,286 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:09:30,286 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-12-05 21:09:30,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:30,286 INFO L85 PathProgramCache]: Analyzing trace with hash -327662229, now seen corresponding path program 1 times [2023-12-05 21:09:30,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:30,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595319682] [2023-12-05 21:09:30,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:30,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:30,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:30,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:30,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595319682] [2023-12-05 21:09:30,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595319682] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:30,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:30,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:30,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125424826] [2023-12-05 21:09:30,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:30,367 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:30,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:30,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:30,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:30,368 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 165 [2023-12-05 21:09:30,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 152 transitions, 1027 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:30,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:30,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 165 [2023-12-05 21:09:30,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:30,523 INFO L124 PetriNetUnfolderBase]: 141/481 cut-off events. [2023-12-05 21:09:30,523 INFO L125 PetriNetUnfolderBase]: For 1745/1841 co-relation queries the response was YES. [2023-12-05 21:09:30,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2350 conditions, 481 events. 141/481 cut-off events. For 1745/1841 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1896 event pairs, 14 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 2221. Up to 200 conditions per place. [2023-12-05 21:09:30,528 INFO L140 encePairwiseOnDemand]: 161/165 looper letters, 45 selfloop transitions, 9 changer transitions 5/174 dead transitions. [2023-12-05 21:09:30,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 174 transitions, 1503 flow [2023-12-05 21:09:30,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:30,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:30,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2023-12-05 21:09:30,529 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8121212121212121 [2023-12-05 21:09:30,529 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2023-12-05 21:09:30,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2023-12-05 21:09:30,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:30,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2023-12-05 21:09:30,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:30,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:30,532 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:30,532 INFO L308 CegarLoopForPetriNet]: 169 programPoint places, -11 predicate places. [2023-12-05 21:09:30,532 INFO L500 AbstractCegarLoop]: Abstraction has has 158 places, 174 transitions, 1503 flow [2023-12-05 21:09:30,533 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:30,533 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:30,533 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:30,533 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:09:30,533 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-12-05 21:09:30,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:30,534 INFO L85 PathProgramCache]: Analyzing trace with hash 2051577594, now seen corresponding path program 1 times [2023-12-05 21:09:30,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:30,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136710828] [2023-12-05 21:09:30,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:30,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:30,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:30,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:30,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136710828] [2023-12-05 21:09:30,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136710828] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:30,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:30,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:09:30,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692452029] [2023-12-05 21:09:30,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:30,646 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:09:30,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:30,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:09:30,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:09:30,647 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 165 [2023-12-05 21:09:30,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 174 transitions, 1503 flow. Second operand has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:30,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:30,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 165 [2023-12-05 21:09:30,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:30,851 INFO L124 PetriNetUnfolderBase]: 148/585 cut-off events. [2023-12-05 21:09:30,851 INFO L125 PetriNetUnfolderBase]: For 2560/2670 co-relation queries the response was YES. [2023-12-05 21:09:30,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2870 conditions, 585 events. 148/585 cut-off events. For 2560/2670 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2905 event pairs, 12 based on Foata normal form. 0/515 useless extension candidates. Maximal degree in co-relation 2730. Up to 232 conditions per place. [2023-12-05 21:09:30,857 INFO L140 encePairwiseOnDemand]: 157/165 looper letters, 70 selfloop transitions, 11 changer transitions 11/192 dead transitions. [2023-12-05 21:09:30,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 192 transitions, 1973 flow [2023-12-05 21:09:30,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:09:30,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:09:30,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2023-12-05 21:09:30,858 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7303030303030303 [2023-12-05 21:09:30,858 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2023-12-05 21:09:30,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2023-12-05 21:09:30,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:30,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2023-12-05 21:09:30,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:30,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 165.0) internal successors, (825), 5 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:30,861 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 165.0) internal successors, (825), 5 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:30,861 INFO L308 CegarLoopForPetriNet]: 169 programPoint places, -9 predicate places. [2023-12-05 21:09:30,861 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 192 transitions, 1973 flow [2023-12-05 21:09:30,862 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:30,862 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:30,862 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:30,862 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:09:30,863 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-12-05 21:09:30,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:30,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1369473989, now seen corresponding path program 1 times [2023-12-05 21:09:30,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:30,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137807121] [2023-12-05 21:09:30,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:30,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:31,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:31,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:31,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137807121] [2023-12-05 21:09:31,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137807121] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:31,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:31,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:09:31,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815822973] [2023-12-05 21:09:31,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:31,138 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:09:31,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:31,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:09:31,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:09:31,141 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 165 [2023-12-05 21:09:31,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 192 transitions, 1973 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:31,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:31,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 165 [2023-12-05 21:09:31,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:31,322 INFO L124 PetriNetUnfolderBase]: 146/580 cut-off events. [2023-12-05 21:09:31,322 INFO L125 PetriNetUnfolderBase]: For 3149/3273 co-relation queries the response was YES. [2023-12-05 21:09:31,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3019 conditions, 580 events. 146/580 cut-off events. For 3149/3273 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2853 event pairs, 10 based on Foata normal form. 2/515 useless extension candidates. Maximal degree in co-relation 2869. Up to 232 conditions per place. [2023-12-05 21:09:31,327 INFO L140 encePairwiseOnDemand]: 162/165 looper letters, 61 selfloop transitions, 9 changer transitions 12/191 dead transitions. [2023-12-05 21:09:31,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 191 transitions, 2117 flow [2023-12-05 21:09:31,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:09:31,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:09:31,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 484 transitions. [2023-12-05 21:09:31,329 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-12-05 21:09:31,329 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 484 transitions. [2023-12-05 21:09:31,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 484 transitions. [2023-12-05 21:09:31,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:31,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 484 transitions. [2023-12-05 21:09:31,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:31,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 165.0) internal successors, (825), 5 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:31,331 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 165.0) internal successors, (825), 5 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:31,332 INFO L308 CegarLoopForPetriNet]: 169 programPoint places, -7 predicate places. [2023-12-05 21:09:31,332 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 191 transitions, 2117 flow [2023-12-05 21:09:31,332 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:31,332 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:31,332 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:31,332 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:09:31,333 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-12-05 21:09:31,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:31,333 INFO L85 PathProgramCache]: Analyzing trace with hash 963672110, now seen corresponding path program 1 times [2023-12-05 21:09:31,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:31,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021315466] [2023-12-05 21:09:31,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:31,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:31,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:31,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:31,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021315466] [2023-12-05 21:09:31,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021315466] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:31,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:31,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-05 21:09:31,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680665420] [2023-12-05 21:09:31,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:31,621 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-05 21:09:31,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:31,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-05 21:09:31,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-05 21:09:31,622 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 165 [2023-12-05 21:09:31,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 191 transitions, 2117 flow. Second operand has 9 states, 9 states have (on average 105.44444444444444) internal successors, (949), 9 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:31,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:31,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 165 [2023-12-05 21:09:31,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:31,826 INFO L124 PetriNetUnfolderBase]: 117/541 cut-off events. [2023-12-05 21:09:31,826 INFO L125 PetriNetUnfolderBase]: For 3454/3590 co-relation queries the response was YES. [2023-12-05 21:09:31,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2877 conditions, 541 events. 117/541 cut-off events. For 3454/3590 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2603 event pairs, 10 based on Foata normal form. 0/496 useless extension candidates. Maximal degree in co-relation 2716. Up to 198 conditions per place. [2023-12-05 21:09:31,835 INFO L140 encePairwiseOnDemand]: 153/165 looper letters, 68 selfloop transitions, 14 changer transitions 17/196 dead transitions. [2023-12-05 21:09:31,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 196 transitions, 2419 flow [2023-12-05 21:09:31,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:09:31,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:09:31,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 875 transitions. [2023-12-05 21:09:31,838 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6628787878787878 [2023-12-05 21:09:31,838 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 875 transitions. [2023-12-05 21:09:31,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 875 transitions. [2023-12-05 21:09:31,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:31,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 875 transitions. [2023-12-05 21:09:31,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 109.375) internal successors, (875), 8 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:31,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 165.0) internal successors, (1485), 9 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:31,842 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 165.0) internal successors, (1485), 9 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:31,842 INFO L308 CegarLoopForPetriNet]: 169 programPoint places, 0 predicate places. [2023-12-05 21:09:31,843 INFO L500 AbstractCegarLoop]: Abstraction has has 169 places, 196 transitions, 2419 flow [2023-12-05 21:09:31,843 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 105.44444444444444) internal successors, (949), 9 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:31,843 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:31,843 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:31,843 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:09:31,843 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-12-05 21:09:31,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:31,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1625273072, now seen corresponding path program 1 times [2023-12-05 21:09:31,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:31,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617731560] [2023-12-05 21:09:31,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:31,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:32,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:32,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:32,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617731560] [2023-12-05 21:09:32,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617731560] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:32,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:32,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-05 21:09:32,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806230832] [2023-12-05 21:09:32,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:32,200 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:09:32,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:32,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:09:32,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:09:32,201 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 165 [2023-12-05 21:09:32,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 196 transitions, 2419 flow. Second operand has 11 states, 11 states have (on average 103.18181818181819) internal successors, (1135), 11 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:32,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:32,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 165 [2023-12-05 21:09:32,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:32,391 INFO L124 PetriNetUnfolderBase]: 84/433 cut-off events. [2023-12-05 21:09:32,391 INFO L125 PetriNetUnfolderBase]: For 3265/3417 co-relation queries the response was YES. [2023-12-05 21:09:32,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2344 conditions, 433 events. 84/433 cut-off events. For 3265/3417 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1754 event pairs, 8 based on Foata normal form. 0/421 useless extension candidates. Maximal degree in co-relation 2172. Up to 129 conditions per place. [2023-12-05 21:09:32,393 INFO L140 encePairwiseOnDemand]: 154/165 looper letters, 0 selfloop transitions, 0 changer transitions 186/186 dead transitions. [2023-12-05 21:09:32,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 186 transitions, 2359 flow [2023-12-05 21:09:32,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 21:09:32,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 21:09:32,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 954 transitions. [2023-12-05 21:09:32,396 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2023-12-05 21:09:32,396 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 954 transitions. [2023-12-05 21:09:32,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 954 transitions. [2023-12-05 21:09:32,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:32,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 954 transitions. [2023-12-05 21:09:32,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 106.0) internal successors, (954), 9 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:32,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 165.0) internal successors, (1650), 10 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:32,400 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 165.0) internal successors, (1650), 10 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:32,400 INFO L308 CegarLoopForPetriNet]: 169 programPoint places, 5 predicate places. [2023-12-05 21:09:32,400 INFO L500 AbstractCegarLoop]: Abstraction has has 174 places, 186 transitions, 2359 flow [2023-12-05 21:09:32,401 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 103.18181818181819) internal successors, (1135), 11 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:32,410 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe014_power.opt.i_BEv2_AllErrorsAtOnce [2023-12-05 21:09:32,445 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 55 remaining) [2023-12-05 21:09:32,446 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 55 remaining) [2023-12-05 21:09:32,446 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 55 remaining) [2023-12-05 21:09:32,446 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 55 remaining) [2023-12-05 21:09:32,446 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 55 remaining) [2023-12-05 21:09:32,446 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 55 remaining) [2023-12-05 21:09:32,446 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 55 remaining) [2023-12-05 21:09:32,446 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 55 remaining) [2023-12-05 21:09:32,446 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 55 remaining) [2023-12-05 21:09:32,446 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 55 remaining) [2023-12-05 21:09:32,446 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 55 remaining) [2023-12-05 21:09:32,446 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 55 remaining) [2023-12-05 21:09:32,446 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 55 remaining) [2023-12-05 21:09:32,447 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 55 remaining) [2023-12-05 21:09:32,447 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 55 remaining) [2023-12-05 21:09:32,447 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 55 remaining) [2023-12-05 21:09:32,447 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 55 remaining) [2023-12-05 21:09:32,447 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 55 remaining) [2023-12-05 21:09:32,447 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 55 remaining) [2023-12-05 21:09:32,447 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 55 remaining) [2023-12-05 21:09:32,447 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 55 remaining) [2023-12-05 21:09:32,447 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 55 remaining) [2023-12-05 21:09:32,447 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 55 remaining) [2023-12-05 21:09:32,447 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 55 remaining) [2023-12-05 21:09:32,447 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 55 remaining) [2023-12-05 21:09:32,447 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 55 remaining) [2023-12-05 21:09:32,448 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 55 remaining) [2023-12-05 21:09:32,448 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 55 remaining) [2023-12-05 21:09:32,448 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 55 remaining) [2023-12-05 21:09:32,464 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 55 remaining) [2023-12-05 21:09:32,464 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 55 remaining) [2023-12-05 21:09:32,464 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 55 remaining) [2023-12-05 21:09:32,464 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 55 remaining) [2023-12-05 21:09:32,465 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 55 remaining) [2023-12-05 21:09:32,465 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 55 remaining) [2023-12-05 21:09:32,465 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 55 remaining) [2023-12-05 21:09:32,465 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 55 remaining) [2023-12-05 21:09:32,465 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 55 remaining) [2023-12-05 21:09:32,465 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 55 remaining) [2023-12-05 21:09:32,465 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 55 remaining) [2023-12-05 21:09:32,465 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 55 remaining) [2023-12-05 21:09:32,465 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 55 remaining) [2023-12-05 21:09:32,465 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 55 remaining) [2023-12-05 21:09:32,465 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 55 remaining) [2023-12-05 21:09:32,465 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 55 remaining) [2023-12-05 21:09:32,465 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 55 remaining) [2023-12-05 21:09:32,465 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 55 remaining) [2023-12-05 21:09:32,466 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 55 remaining) [2023-12-05 21:09:32,466 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 55 remaining) [2023-12-05 21:09:32,466 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 55 remaining) [2023-12-05 21:09:32,466 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 55 remaining) [2023-12-05 21:09:32,466 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 55 remaining) [2023-12-05 21:09:32,466 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 55 remaining) [2023-12-05 21:09:32,466 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 55 remaining) [2023-12-05 21:09:32,466 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 55 remaining) [2023-12-05 21:09:32,466 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:09:32,467 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:32,470 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:09:32,470 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:09:32,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:09:32 BasicIcfg [2023-12-05 21:09:32,475 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:09:32,475 INFO L158 Benchmark]: Toolchain (without parser) took 6548.10ms. Allocated memory was 187.7MB in the beginning and 554.7MB in the end (delta: 367.0MB). Free memory was 126.0MB in the beginning and 365.7MB in the end (delta: -239.7MB). Peak memory consumption was 128.0MB. Max. memory is 8.0GB. [2023-12-05 21:09:32,475 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 187.7MB. Free memory was 139.0MB in the beginning and 138.9MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:09:32,475 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.26ms. Allocated memory is still 187.7MB. Free memory was 126.0MB in the beginning and 102.0MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-05 21:09:32,475 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.85ms. Allocated memory is still 187.7MB. Free memory was 102.0MB in the beginning and 99.2MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-05 21:09:32,476 INFO L158 Benchmark]: Boogie Preprocessor took 27.60ms. Allocated memory is still 187.7MB. Free memory was 99.2MB in the beginning and 97.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:09:32,476 INFO L158 Benchmark]: RCFGBuilder took 917.16ms. Allocated memory was 187.7MB in the beginning and 240.1MB in the end (delta: 52.4MB). Free memory was 97.1MB in the beginning and 174.9MB in the end (delta: -77.8MB). Peak memory consumption was 40.5MB. Max. memory is 8.0GB. [2023-12-05 21:09:32,476 INFO L158 Benchmark]: TraceAbstraction took 5091.99ms. Allocated memory was 240.1MB in the beginning and 554.7MB in the end (delta: 314.6MB). Free memory was 174.4MB in the beginning and 365.7MB in the end (delta: -191.3MB). Peak memory consumption was 123.2MB. Max. memory is 8.0GB. [2023-12-05 21:09:32,477 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.10ms. Allocated memory is still 187.7MB. Free memory was 139.0MB in the beginning and 138.9MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 458.26ms. Allocated memory is still 187.7MB. Free memory was 126.0MB in the beginning and 102.0MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.85ms. Allocated memory is still 187.7MB. Free memory was 102.0MB in the beginning and 99.2MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.60ms. Allocated memory is still 187.7MB. Free memory was 99.2MB in the beginning and 97.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 917.16ms. Allocated memory was 187.7MB in the beginning and 240.1MB in the end (delta: 52.4MB). Free memory was 97.1MB in the beginning and 174.9MB in the end (delta: -77.8MB). Peak memory consumption was 40.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5091.99ms. Allocated memory was 240.1MB in the beginning and 554.7MB in the end (delta: 314.6MB). Free memory was 174.4MB in the beginning and 365.7MB in the end (delta: -191.3MB). Peak memory consumption was 123.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 210 locations, 55 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: 5.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 365 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 365 mSDsluCounter, 159 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 711 IncrementalHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 120 mSDtfsCounter, 711 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2419occurred in iteration=11, InterpolantAutomatonStates: 52, 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, 1.6s InterpolantComputationTime, 889 NumberOfCodeBlocks, 889 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 877 ConstructedInterpolants, 0 QuantifiedInterpolants, 3542 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 32 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:09:32,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...