/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/mix013.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:06:49,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:06:49,688 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:06:49,712 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:06:49,713 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:06:49,713 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:06:49,714 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:06:49,714 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:06:49,714 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:06:49,717 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:06:49,717 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:06:49,717 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:06:49,717 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:06:49,718 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:06:49,718 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:06:49,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:06:49,719 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:06:49,719 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:06:49,719 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:06:49,719 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:06:49,719 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:06:49,720 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:06:49,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:06:49,720 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:06:49,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:06:49,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:06:49,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:06:49,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:06:49,722 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:06:49,722 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:06:49,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:06:49,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:06:49,723 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:06:49,723 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:06:49,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:06:49,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:06:49,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:06:49,921 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:06:49,922 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:06:49,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix013.opt.i [2023-12-05 21:06:50,830 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:06:51,058 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:06:51,059 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix013.opt.i [2023-12-05 21:06:51,074 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/410e6b37e/e45d034bed45471c9fa020dcaf2fbba6/FLAG0df90a230 [2023-12-05 21:06:51,087 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/410e6b37e/e45d034bed45471c9fa020dcaf2fbba6 [2023-12-05 21:06:51,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:06:51,090 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:06:51,092 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:06:51,092 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:06:51,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:06:51,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:06:51" (1/1) ... [2023-12-05 21:06:51,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c83ff90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:51, skipping insertion in model container [2023-12-05 21:06:51,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:06:51" (1/1) ... [2023-12-05 21:06:51,136 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:06:51,447 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:06:51,460 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:06:51,497 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:06:51,520 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:06:51,520 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:06:51,525 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:06:51,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:51 WrapperNode [2023-12-05 21:06:51,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:06:51,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:06:51,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:06:51,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:06:51,531 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:06:51" (1/1) ... [2023-12-05 21:06:51,541 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:06:51" (1/1) ... [2023-12-05 21:06:51,568 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 172 [2023-12-05 21:06:51,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:06:51,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:06:51,568 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:06:51,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:06:51,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:51" (1/1) ... [2023-12-05 21:06:51,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:51" (1/1) ... [2023-12-05 21:06:51,579 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:51" (1/1) ... [2023-12-05 21:06:51,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:51" (1/1) ... [2023-12-05 21:06:51,585 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:51" (1/1) ... [2023-12-05 21:06:51,587 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:51" (1/1) ... [2023-12-05 21:06:51,588 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:51" (1/1) ... [2023-12-05 21:06:51,589 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:51" (1/1) ... [2023-12-05 21:06:51,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:06:51,592 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:06:51,592 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:06:51,592 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:06:51,593 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:51" (1/1) ... [2023-12-05 21:06:51,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:06:51,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:06:51,625 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:06:51,631 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:06:51,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:06:51,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:06:51,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:06:51,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:06:51,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:06:51,648 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-05 21:06:51,648 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-05 21:06:51,648 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-05 21:06:51,648 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-05 21:06:51,648 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-05 21:06:51,649 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-05 21:06:51,649 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-12-05 21:06:51,649 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-12-05 21:06:51,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:06:51,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:06:51,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:06:51,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:06:51,650 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:06:51,748 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:06:51,750 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:06:52,088 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:06:52,182 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:06:52,182 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:06:52,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:06:52 BoogieIcfgContainer [2023-12-05 21:06:52,183 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:06:52,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:06:52,185 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:06:52,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:06:52,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:06:51" (1/3) ... [2023-12-05 21:06:52,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436acb73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:06:52, skipping insertion in model container [2023-12-05 21:06:52,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:51" (2/3) ... [2023-12-05 21:06:52,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436acb73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:06:52, skipping insertion in model container [2023-12-05 21:06:52,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:06:52" (3/3) ... [2023-12-05 21:06:52,189 INFO L112 eAbstractionObserver]: Analyzing ICFG mix013.opt.i [2023-12-05 21:06:52,200 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:06:52,200 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-12-05 21:06:52,200 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:06:52,268 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:06:52,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 148 transitions, 312 flow [2023-12-05 21:06:52,346 INFO L124 PetriNetUnfolderBase]: 3/144 cut-off events. [2023-12-05 21:06:52,347 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:06:52,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 144 events. 3/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 116 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2023-12-05 21:06:52,354 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 148 transitions, 312 flow [2023-12-05 21:06:52,360 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 95 transitions, 199 flow [2023-12-05 21:06:52,368 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:06:52,372 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;@342f827a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:06:52,372 INFO L363 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-12-05 21:06:52,378 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:06:52,378 INFO L124 PetriNetUnfolderBase]: 0/45 cut-off events. [2023-12-05 21:06:52,379 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:06:52,379 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:52,379 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] [2023-12-05 21:06:52,380 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:06:52,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:52,383 INFO L85 PathProgramCache]: Analyzing trace with hash 469612232, now seen corresponding path program 1 times [2023-12-05 21:06:52,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:52,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280935888] [2023-12-05 21:06:52,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:52,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:52,662 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:06:52,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:52,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280935888] [2023-12-05 21:06:52,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280935888] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:52,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:52,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:52,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449732955] [2023-12-05 21:06:52,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:52,669 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:52,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:52,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:52,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:52,697 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 148 [2023-12-05 21:06:52,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 95 transitions, 199 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:06:52,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:52,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 148 [2023-12-05 21:06:52,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:52,756 INFO L124 PetriNetUnfolderBase]: 2/106 cut-off events. [2023-12-05 21:06:52,757 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:06:52,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 87 event pairs, 2 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 78. Up to 19 conditions per place. [2023-12-05 21:06:52,760 INFO L140 encePairwiseOnDemand]: 146/148 looper letters, 18 selfloop transitions, 1 changer transitions 0/94 dead transitions. [2023-12-05 21:06:52,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 94 transitions, 235 flow [2023-12-05 21:06:52,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:52,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:52,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-12-05 21:06:52,776 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8018018018018018 [2023-12-05 21:06:52,776 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-12-05 21:06:52,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-12-05 21:06:52,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:52,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-12-05 21:06:52,786 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:06:52,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:06:52,790 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:06:52,794 INFO L308 CegarLoopForPetriNet]: 105 programPoint places, 1 predicate places. [2023-12-05 21:06:52,795 INFO L500 AbstractCegarLoop]: Abstraction has has 106 places, 94 transitions, 235 flow [2023-12-05 21:06:52,795 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:06:52,795 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:52,796 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] [2023-12-05 21:06:52,796 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:06:52,797 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:06:52,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:52,797 INFO L85 PathProgramCache]: Analyzing trace with hash 469612233, now seen corresponding path program 1 times [2023-12-05 21:06:52,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:52,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893324439] [2023-12-05 21:06:52,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:52,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:52,920 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:06:52,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:52,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893324439] [2023-12-05 21:06:52,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893324439] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:52,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:52,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:52,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665769574] [2023-12-05 21:06:52,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:52,922 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:52,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:52,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:52,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:52,924 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 148 [2023-12-05 21:06:52,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 94 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 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:06:52,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:52,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 148 [2023-12-05 21:06:52,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:52,976 INFO L124 PetriNetUnfolderBase]: 3/111 cut-off events. [2023-12-05 21:06:52,976 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-12-05 21:06:52,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 111 events. 3/111 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 107 event pairs, 3 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 101. Up to 19 conditions per place. [2023-12-05 21:06:52,977 INFO L140 encePairwiseOnDemand]: 146/148 looper letters, 16 selfloop transitions, 1 changer transitions 0/93 dead transitions. [2023-12-05 21:06:52,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 93 transitions, 265 flow [2023-12-05 21:06:52,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:52,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:52,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-12-05 21:06:52,980 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8243243243243243 [2023-12-05 21:06:52,980 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-12-05 21:06:52,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-12-05 21:06:52,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:52,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-12-05 21:06:52,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 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:06:52,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:06:52,984 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:06:52,984 INFO L308 CegarLoopForPetriNet]: 105 programPoint places, 2 predicate places. [2023-12-05 21:06:52,985 INFO L500 AbstractCegarLoop]: Abstraction has has 107 places, 93 transitions, 265 flow [2023-12-05 21:06:52,985 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 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:06:52,985 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:52,985 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] [2023-12-05 21:06:52,986 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:06:52,986 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:06:52,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:52,987 INFO L85 PathProgramCache]: Analyzing trace with hash -300607684, now seen corresponding path program 1 times [2023-12-05 21:06:52,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:52,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162571156] [2023-12-05 21:06:52,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:52,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:53,081 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:06:53,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:53,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162571156] [2023-12-05 21:06:53,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162571156] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:53,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:53,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:53,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849097121] [2023-12-05 21:06:53,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:53,083 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:53,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:53,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:53,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:53,084 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 148 [2023-12-05 21:06:53,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 93 transitions, 265 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 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:06:53,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:53,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 148 [2023-12-05 21:06:53,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:53,134 INFO L124 PetriNetUnfolderBase]: 3/110 cut-off events. [2023-12-05 21:06:53,135 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-12-05 21:06:53,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 110 events. 3/110 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 102 event pairs, 3 based on Foata normal form. 1/111 useless extension candidates. Maximal degree in co-relation 115. Up to 19 conditions per place. [2023-12-05 21:06:53,136 INFO L140 encePairwiseOnDemand]: 146/148 looper letters, 17 selfloop transitions, 1 changer transitions 0/92 dead transitions. [2023-12-05 21:06:53,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 92 transitions, 297 flow [2023-12-05 21:06:53,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:53,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:53,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-12-05 21:06:53,139 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7995495495495496 [2023-12-05 21:06:53,139 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-12-05 21:06:53,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-12-05 21:06:53,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:53,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-12-05 21:06:53,140 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:06:53,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:06:53,142 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:06:53,142 INFO L308 CegarLoopForPetriNet]: 105 programPoint places, 3 predicate places. [2023-12-05 21:06:53,143 INFO L500 AbstractCegarLoop]: Abstraction has has 108 places, 92 transitions, 297 flow [2023-12-05 21:06:53,143 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 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:06:53,143 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:53,143 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] [2023-12-05 21:06:53,143 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:06:53,144 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:06:53,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:53,144 INFO L85 PathProgramCache]: Analyzing trace with hash -300607683, now seen corresponding path program 1 times [2023-12-05 21:06:53,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:53,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455386510] [2023-12-05 21:06:53,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:53,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:53,239 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:06:53,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:53,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455386510] [2023-12-05 21:06:53,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455386510] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:53,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:53,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:53,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564304942] [2023-12-05 21:06:53,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:53,240 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:53,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:53,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:53,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:53,241 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 148 [2023-12-05 21:06:53,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 92 transitions, 297 flow. Second operand has 3 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:06:53,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:53,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 148 [2023-12-05 21:06:53,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:53,283 INFO L124 PetriNetUnfolderBase]: 3/109 cut-off events. [2023-12-05 21:06:53,283 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2023-12-05 21:06:53,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 109 events. 3/109 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 99 event pairs, 3 based on Foata normal form. 1/110 useless extension candidates. Maximal degree in co-relation 127. Up to 18 conditions per place. [2023-12-05 21:06:53,284 INFO L140 encePairwiseOnDemand]: 146/148 looper letters, 15 selfloop transitions, 1 changer transitions 0/91 dead transitions. [2023-12-05 21:06:53,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 91 transitions, 323 flow [2023-12-05 21:06:53,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:53,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:53,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-12-05 21:06:53,285 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8220720720720721 [2023-12-05 21:06:53,286 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-12-05 21:06:53,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-12-05 21:06:53,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:53,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-12-05 21:06:53,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 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:06:53,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:06:53,289 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:06:53,290 INFO L308 CegarLoopForPetriNet]: 105 programPoint places, 4 predicate places. [2023-12-05 21:06:53,291 INFO L500 AbstractCegarLoop]: Abstraction has has 109 places, 91 transitions, 323 flow [2023-12-05 21:06:53,291 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:06:53,291 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:53,291 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:53,291 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:06:53,292 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:06:53,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:53,292 INFO L85 PathProgramCache]: Analyzing trace with hash -82063409, now seen corresponding path program 1 times [2023-12-05 21:06:53,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:53,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283003896] [2023-12-05 21:06:53,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:53,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:53,381 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:06:53,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:53,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283003896] [2023-12-05 21:06:53,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283003896] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:53,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:53,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:53,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831755761] [2023-12-05 21:06:53,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:53,382 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:53,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:53,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:53,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:53,384 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 148 [2023-12-05 21:06:53,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 91 transitions, 323 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 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:06:53,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:53,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 148 [2023-12-05 21:06:53,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:53,415 INFO L124 PetriNetUnfolderBase]: 3/108 cut-off events. [2023-12-05 21:06:53,415 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2023-12-05 21:06:53,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 108 events. 3/108 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 96 event pairs, 3 based on Foata normal form. 1/109 useless extension candidates. Maximal degree in co-relation 139. Up to 18 conditions per place. [2023-12-05 21:06:53,416 INFO L140 encePairwiseOnDemand]: 146/148 looper letters, 16 selfloop transitions, 1 changer transitions 0/90 dead transitions. [2023-12-05 21:06:53,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 90 transitions, 351 flow [2023-12-05 21:06:53,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:53,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:53,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-12-05 21:06:53,418 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7972972972972973 [2023-12-05 21:06:53,418 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-12-05 21:06:53,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-12-05 21:06:53,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:53,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-12-05 21:06:53,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 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:06:53,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:06:53,420 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:06:53,422 INFO L308 CegarLoopForPetriNet]: 105 programPoint places, 5 predicate places. [2023-12-05 21:06:53,422 INFO L500 AbstractCegarLoop]: Abstraction has has 110 places, 90 transitions, 351 flow [2023-12-05 21:06:53,423 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 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:06:53,423 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:53,423 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:53,424 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:06:53,424 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:06:53,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:53,427 INFO L85 PathProgramCache]: Analyzing trace with hash -82063408, now seen corresponding path program 1 times [2023-12-05 21:06:53,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:53,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071300872] [2023-12-05 21:06:53,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:53,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:53,513 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:06:53,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:53,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071300872] [2023-12-05 21:06:53,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071300872] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:53,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:53,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:53,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990266554] [2023-12-05 21:06:53,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:53,518 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:53,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:53,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:53,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:53,519 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 148 [2023-12-05 21:06:53,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 90 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 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:06:53,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:53,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 148 [2023-12-05 21:06:53,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:53,562 INFO L124 PetriNetUnfolderBase]: 3/107 cut-off events. [2023-12-05 21:06:53,563 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2023-12-05 21:06:53,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 107 events. 3/107 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 92 event pairs, 3 based on Foata normal form. 1/108 useless extension candidates. Maximal degree in co-relation 149. Up to 17 conditions per place. [2023-12-05 21:06:53,563 INFO L140 encePairwiseOnDemand]: 146/148 looper letters, 14 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2023-12-05 21:06:53,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 89 transitions, 373 flow [2023-12-05 21:06:53,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:53,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:53,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-12-05 21:06:53,565 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8198198198198198 [2023-12-05 21:06:53,565 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-12-05 21:06:53,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-12-05 21:06:53,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:53,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-12-05 21:06:53,566 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:06:53,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:06:53,567 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:06:53,568 INFO L308 CegarLoopForPetriNet]: 105 programPoint places, 6 predicate places. [2023-12-05 21:06:53,569 INFO L500 AbstractCegarLoop]: Abstraction has has 111 places, 89 transitions, 373 flow [2023-12-05 21:06:53,569 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 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:06:53,569 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:53,569 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] [2023-12-05 21:06:53,570 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:06:53,570 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:06:53,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:53,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1354214896, now seen corresponding path program 1 times [2023-12-05 21:06:53,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:53,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71949033] [2023-12-05 21:06:53,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:53,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:53,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:06:53,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:53,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71949033] [2023-12-05 21:06:53,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71949033] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:53,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:53,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:53,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327186003] [2023-12-05 21:06:53,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:53,649 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:53,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:53,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:53,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:53,650 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 148 [2023-12-05 21:06:53,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 89 transitions, 373 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 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:06:53,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:53,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 148 [2023-12-05 21:06:53,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:53,686 INFO L124 PetriNetUnfolderBase]: 2/94 cut-off events. [2023-12-05 21:06:53,687 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2023-12-05 21:06:53,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 94 events. 2/94 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 2/96 useless extension candidates. Maximal degree in co-relation 137. Up to 16 conditions per place. [2023-12-05 21:06:53,689 INFO L140 encePairwiseOnDemand]: 146/148 looper letters, 16 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2023-12-05 21:06:53,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 89 transitions, 413 flow [2023-12-05 21:06:53,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:53,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:53,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-12-05 21:06:53,691 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7972972972972973 [2023-12-05 21:06:53,691 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-12-05 21:06:53,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-12-05 21:06:53,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:53,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-12-05 21:06:53,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 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:06:53,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:06:53,693 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:06:53,693 INFO L308 CegarLoopForPetriNet]: 105 programPoint places, 7 predicate places. [2023-12-05 21:06:53,693 INFO L500 AbstractCegarLoop]: Abstraction has has 112 places, 89 transitions, 413 flow [2023-12-05 21:06:53,694 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 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:06:53,694 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:53,694 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] [2023-12-05 21:06:53,694 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:06:53,694 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:06:53,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:53,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1354214897, now seen corresponding path program 1 times [2023-12-05 21:06:53,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:53,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864433515] [2023-12-05 21:06:53,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:53,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:53,776 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:06:53,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:53,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864433515] [2023-12-05 21:06:53,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864433515] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:53,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:53,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:53,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132547806] [2023-12-05 21:06:53,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:53,777 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:53,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:53,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:53,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:53,778 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 148 [2023-12-05 21:06:53,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 89 transitions, 413 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 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:06:53,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:53,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 148 [2023-12-05 21:06:53,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:53,806 INFO L124 PetriNetUnfolderBase]: 1/91 cut-off events. [2023-12-05 21:06:53,806 INFO L125 PetriNetUnfolderBase]: For 300/300 co-relation queries the response was YES. [2023-12-05 21:06:53,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 91 events. 1/91 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 2/93 useless extension candidates. Maximal degree in co-relation 129. Up to 15 conditions per place. [2023-12-05 21:06:53,807 INFO L140 encePairwiseOnDemand]: 146/148 looper letters, 0 selfloop transitions, 0 changer transitions 88/88 dead transitions. [2023-12-05 21:06:53,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 88 transitions, 433 flow [2023-12-05 21:06:53,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:53,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:53,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-12-05 21:06:53,809 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8198198198198198 [2023-12-05 21:06:53,810 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-12-05 21:06:53,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-12-05 21:06:53,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:53,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-12-05 21:06:53,812 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:06:53,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:06:53,813 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:06:53,814 INFO L308 CegarLoopForPetriNet]: 105 programPoint places, 8 predicate places. [2023-12-05 21:06:53,815 INFO L500 AbstractCegarLoop]: Abstraction has has 113 places, 88 transitions, 433 flow [2023-12-05 21:06:53,815 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 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:06:53,823 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mix013.opt.i_BEv2_AllErrorsAtOnce [2023-12-05 21:06:53,850 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 12 remaining) [2023-12-05 21:06:53,850 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2023-12-05 21:06:53,852 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-12-05 21:06:53,853 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-12-05 21:06:53,853 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-12-05 21:06:53,853 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-12-05 21:06:53,854 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-12-05 21:06:53,855 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-12-05 21:06:53,855 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-12-05 21:06:53,855 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-12-05 21:06:53,855 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-12-05 21:06:53,855 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 12 remaining) [2023-12-05 21:06:53,855 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:06:53,856 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:53,858 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:06:53,858 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:06:53,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:06:53 BasicIcfg [2023-12-05 21:06:53,863 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:06:53,863 INFO L158 Benchmark]: Toolchain (without parser) took 2773.79ms. Allocated memory is still 333.4MB. Free memory was 286.3MB in the beginning and 167.0MB in the end (delta: 119.4MB). Peak memory consumption was 120.9MB. Max. memory is 8.0GB. [2023-12-05 21:06:53,864 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 182.5MB. Free memory is still 130.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:06:53,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.16ms. Allocated memory is still 333.4MB. Free memory was 286.3MB in the beginning and 261.7MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-12-05 21:06:53,864 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.72ms. Allocated memory is still 333.4MB. Free memory was 261.7MB in the beginning and 259.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:06:53,864 INFO L158 Benchmark]: Boogie Preprocessor took 23.18ms. Allocated memory is still 333.4MB. Free memory was 259.1MB in the beginning and 257.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:06:53,864 INFO L158 Benchmark]: RCFGBuilder took 591.33ms. Allocated memory is still 333.4MB. Free memory was 257.0MB in the beginning and 215.0MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2023-12-05 21:06:53,864 INFO L158 Benchmark]: TraceAbstraction took 1678.40ms. Allocated memory is still 333.4MB. Free memory was 214.0MB in the beginning and 167.0MB in the end (delta: 47.0MB). Peak memory consumption was 48.6MB. Max. memory is 8.0GB. [2023-12-05 21:06:53,865 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 182.5MB. Free memory is still 130.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 434.16ms. Allocated memory is still 333.4MB. Free memory was 286.3MB in the beginning and 261.7MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.72ms. Allocated memory is still 333.4MB. Free memory was 261.7MB in the beginning and 259.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.18ms. Allocated memory is still 333.4MB. Free memory was 259.1MB in the beginning and 257.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 591.33ms. Allocated memory is still 333.4MB. Free memory was 257.0MB in the beginning and 215.0MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * TraceAbstraction took 1678.40ms. Allocated memory is still 333.4MB. Free memory was 214.0MB in the beginning and 167.0MB in the end (delta: 47.0MB). Peak memory consumption was 48.6MB. 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 184 locations, 12 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: 1.6s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 140 IncrementalHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 60 mSDtfsCounter, 140 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=433occurred in iteration=8, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 444 NumberOfCodeBlocks, 444 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 436 ConstructedInterpolants, 0 QuantifiedInterpolants, 580 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:06:53,881 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...