/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:45:23,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:45:23,859 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 04:45:23,893 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:45:23,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:45:23,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:45:23,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:45:23,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:45:23,895 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:45:23,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:45:23,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:45:23,896 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:45:23,897 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:45:23,897 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:45:23,898 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:45:23,898 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:45:23,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:45:23,899 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:45:23,899 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:45:23,899 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:45:23,900 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:45:23,903 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:45:23,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:45:23,904 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:45:23,906 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:45:23,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:45:23,907 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:45:23,907 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:45:23,907 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:45:23,907 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:45:23,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:45:23,908 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:45:23,908 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:45:23,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-11-30 04:45:24,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:45:24,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:45:24,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:45:24,090 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:45:24,091 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:45:24,092 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.i [2023-11-30 04:45:25,388 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:45:25,660 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:45:25,661 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_tso.i [2023-11-30 04:45:25,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d17ec5a0/c1d3a0d20f284ac282d6a982e40cec0c/FLAGd1ee8425e [2023-11-30 04:45:25,702 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d17ec5a0/c1d3a0d20f284ac282d6a982e40cec0c [2023-11-30 04:45:25,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:45:25,707 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:45:25,711 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:45:25,711 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:45:25,715 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:45:25,716 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:45:25" (1/1) ... [2023-11-30 04:45:25,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b63df82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:25, skipping insertion in model container [2023-11-30 04:45:25,718 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:45:25" (1/1) ... [2023-11-30 04:45:25,779 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:45:26,179 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:45:26,193 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:45:26,272 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:45:26,296 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:45:26,296 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:45:26,302 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:45:26,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:26 WrapperNode [2023-11-30 04:45:26,302 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:45:26,317 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:45:26,317 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:45:26,318 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:45:26,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:26" (1/1) ... [2023-11-30 04:45:26,341 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:26" (1/1) ... [2023-11-30 04:45:26,373 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 185 [2023-11-30 04:45:26,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:45:26,374 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:45:26,374 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:45:26,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:45:26,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:26" (1/1) ... [2023-11-30 04:45:26,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:26" (1/1) ... [2023-11-30 04:45:26,387 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:26" (1/1) ... [2023-11-30 04:45:26,387 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:26" (1/1) ... [2023-11-30 04:45:26,395 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:26" (1/1) ... [2023-11-30 04:45:26,397 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:26" (1/1) ... [2023-11-30 04:45:26,399 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:26" (1/1) ... [2023-11-30 04:45:26,401 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:26" (1/1) ... [2023-11-30 04:45:26,412 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:45:26,413 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:45:26,413 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:45:26,413 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:45:26,414 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:26" (1/1) ... [2023-11-30 04:45:26,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:45:26,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:45:26,451 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 04:45:26,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 04:45:26,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:45:26,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:45:26,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:45:26,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:45:26,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:45:26,482 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-30 04:45:26,482 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-30 04:45:26,482 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-30 04:45:26,483 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-30 04:45:26,483 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-30 04:45:26,483 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-30 04:45:26,483 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-30 04:45:26,483 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-30 04:45:26,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:45:26,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:45:26,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:45:26,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:45:26,485 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 04:45:26,605 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:45:26,609 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:45:26,975 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:45:27,075 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:45:27,075 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:45:27,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:45:27 BoogieIcfgContainer [2023-11-30 04:45:27,077 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:45:27,079 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:45:27,079 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:45:27,082 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:45:27,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:45:25" (1/3) ... [2023-11-30 04:45:27,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3c04ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:45:27, skipping insertion in model container [2023-11-30 04:45:27,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:26" (2/3) ... [2023-11-30 04:45:27,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3c04ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:45:27, skipping insertion in model container [2023-11-30 04:45:27,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:45:27" (3/3) ... [2023-11-30 04:45:27,084 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_tso.i [2023-11-30 04:45:27,100 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:45:27,100 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-30 04:45:27,100 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:45:27,150 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:45:27,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 143 transitions, 302 flow [2023-11-30 04:45:27,234 INFO L124 PetriNetUnfolderBase]: 3/139 cut-off events. [2023-11-30 04:45:27,234 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:45:27,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 3/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-11-30 04:45:27,243 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 143 transitions, 302 flow [2023-11-30 04:45:27,246 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 90 transitions, 189 flow [2023-11-30 04:45:27,256 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:45:27,265 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;@2f94810f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:45:27,265 INFO L363 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-11-30 04:45:27,280 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:45:27,280 INFO L124 PetriNetUnfolderBase]: 0/41 cut-off events. [2023-11-30 04:45:27,280 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:45:27,280 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:27,281 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:27,282 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-11-30 04:45:27,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:27,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1701422502, now seen corresponding path program 1 times [2023-11-30 04:45:27,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:27,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095630090] [2023-11-30 04:45:27,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:27,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:27,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:45:27,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:27,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095630090] [2023-11-30 04:45:27,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095630090] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:27,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:27,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:27,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444981274] [2023-11-30 04:45:27,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:27,642 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:27,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:27,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:27,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:27,681 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 143 [2023-11-30 04:45:27,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 90 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:27,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:27,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 143 [2023-11-30 04:45:27,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:27,750 INFO L124 PetriNetUnfolderBase]: 2/96 cut-off events. [2023-11-30 04:45:27,750 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:45:27,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 2 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 72. Up to 19 conditions per place. [2023-11-30 04:45:27,752 INFO L140 encePairwiseOnDemand]: 141/143 looper letters, 18 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2023-11-30 04:45:27,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 89 transitions, 225 flow [2023-11-30 04:45:27,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:27,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2023-11-30 04:45:27,763 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7878787878787878 [2023-11-30 04:45:27,764 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 338 transitions. [2023-11-30 04:45:27,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 338 transitions. [2023-11-30 04:45:27,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:27,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 338 transitions. [2023-11-30 04:45:27,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:27,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:27,775 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:27,778 INFO L307 CegarLoopForPetriNet]: 100 programPoint places, 1 predicate places. [2023-11-30 04:45:27,779 INFO L500 AbstractCegarLoop]: Abstraction has has 101 places, 89 transitions, 225 flow [2023-11-30 04:45:27,779 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:27,779 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:27,779 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:27,780 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:45:27,780 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-11-30 04:45:27,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:27,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1701422501, now seen corresponding path program 1 times [2023-11-30 04:45:27,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:27,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600570143] [2023-11-30 04:45:27,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:27,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:27,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:45:27,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:27,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600570143] [2023-11-30 04:45:27,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600570143] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:27,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:27,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:27,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527541211] [2023-11-30 04:45:27,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:27,917 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:27,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:27,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:27,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:27,920 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 143 [2023-11-30 04:45:27,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 89 transitions, 225 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:27,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:27,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 143 [2023-11-30 04:45:27,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:27,981 INFO L124 PetriNetUnfolderBase]: 3/96 cut-off events. [2023-11-30 04:45:27,982 INFO L125 PetriNetUnfolderBase]: For 13/15 co-relation queries the response was YES. [2023-11-30 04:45:27,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 96 events. 3/96 cut-off events. For 13/15 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 3 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 90. Up to 19 conditions per place. [2023-11-30 04:45:27,984 INFO L140 encePairwiseOnDemand]: 141/143 looper letters, 16 selfloop transitions, 1 changer transitions 0/88 dead transitions. [2023-11-30 04:45:27,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 88 transitions, 255 flow [2023-11-30 04:45:27,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:27,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:27,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-11-30 04:45:27,989 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8111888111888111 [2023-11-30 04:45:27,989 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-11-30 04:45:27,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-11-30 04:45:27,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:27,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-11-30 04:45:27,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-11-30 04:45:27,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:27,993 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:27,994 INFO L307 CegarLoopForPetriNet]: 100 programPoint places, 2 predicate places. [2023-11-30 04:45:27,994 INFO L500 AbstractCegarLoop]: Abstraction has has 102 places, 88 transitions, 255 flow [2023-11-30 04:45:27,994 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:27,994 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:27,994 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:27,995 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:45:27,995 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:45:27,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:27,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1014503907, now seen corresponding path program 1 times [2023-11-30 04:45:27,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:27,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808914389] [2023-11-30 04:45:27,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:27,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:28,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:45:28,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:28,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808914389] [2023-11-30 04:45:28,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808914389] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:28,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:28,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:28,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118890888] [2023-11-30 04:45:28,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:28,156 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:28,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:28,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:28,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:28,158 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 143 [2023-11-30 04:45:28,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 88 transitions, 255 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:28,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:28,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 143 [2023-11-30 04:45:28,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:28,214 INFO L124 PetriNetUnfolderBase]: 3/95 cut-off events. [2023-11-30 04:45:28,214 INFO L125 PetriNetUnfolderBase]: For 42/46 co-relation queries the response was YES. [2023-11-30 04:45:28,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 95 events. 3/95 cut-off events. For 42/46 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 3 based on Foata normal form. 1/95 useless extension candidates. Maximal degree in co-relation 104. Up to 19 conditions per place. [2023-11-30 04:45:28,216 INFO L140 encePairwiseOnDemand]: 141/143 looper letters, 16 selfloop transitions, 1 changer transitions 0/87 dead transitions. [2023-11-30 04:45:28,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 87 transitions, 285 flow [2023-11-30 04:45:28,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:28,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:28,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-11-30 04:45:28,218 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8111888111888111 [2023-11-30 04:45:28,219 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-11-30 04:45:28,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-11-30 04:45:28,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:28,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-11-30 04:45:28,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-11-30 04:45:28,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:28,224 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:28,225 INFO L307 CegarLoopForPetriNet]: 100 programPoint places, 3 predicate places. [2023-11-30 04:45:28,225 INFO L500 AbstractCegarLoop]: Abstraction has has 103 places, 87 transitions, 285 flow [2023-11-30 04:45:28,225 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:28,226 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:28,226 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:28,226 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:45:28,227 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:45:28,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:28,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1014503908, now seen corresponding path program 1 times [2023-11-30 04:45:28,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:28,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993066255] [2023-11-30 04:45:28,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:28,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:28,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:45:28,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:28,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993066255] [2023-11-30 04:45:28,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993066255] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:28,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:28,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:28,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821465713] [2023-11-30 04:45:28,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:28,338 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:28,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:28,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:28,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:28,339 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 143 [2023-11-30 04:45:28,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 87 transitions, 285 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:28,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:28,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 143 [2023-11-30 04:45:28,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:28,387 INFO L124 PetriNetUnfolderBase]: 3/94 cut-off events. [2023-11-30 04:45:28,387 INFO L125 PetriNetUnfolderBase]: For 81/87 co-relation queries the response was YES. [2023-11-30 04:45:28,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 94 events. 3/94 cut-off events. For 81/87 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 3 based on Foata normal form. 1/94 useless extension candidates. Maximal degree in co-relation 116. Up to 18 conditions per place. [2023-11-30 04:45:28,389 INFO L140 encePairwiseOnDemand]: 141/143 looper letters, 16 selfloop transitions, 1 changer transitions 0/86 dead transitions. [2023-11-30 04:45:28,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 86 transitions, 313 flow [2023-11-30 04:45:28,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:28,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:28,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-11-30 04:45:28,390 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7832167832167832 [2023-11-30 04:45:28,390 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-11-30 04:45:28,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-11-30 04:45:28,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:28,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-11-30 04:45:28,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:28,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:28,394 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:28,395 INFO L307 CegarLoopForPetriNet]: 100 programPoint places, 4 predicate places. [2023-11-30 04:45:28,395 INFO L500 AbstractCegarLoop]: Abstraction has has 104 places, 86 transitions, 313 flow [2023-11-30 04:45:28,396 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:28,396 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:28,396 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:28,396 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:45:28,396 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-11-30 04:45:28,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:28,397 INFO L85 PathProgramCache]: Analyzing trace with hash -553041790, now seen corresponding path program 1 times [2023-11-30 04:45:28,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:28,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358397765] [2023-11-30 04:45:28,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:28,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:28,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:45:28,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:28,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358397765] [2023-11-30 04:45:28,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358397765] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:28,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:28,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:28,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561271931] [2023-11-30 04:45:28,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:28,475 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:28,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:28,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:28,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:28,477 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 143 [2023-11-30 04:45:28,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 86 transitions, 313 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:28,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:28,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 143 [2023-11-30 04:45:28,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:28,531 INFO L124 PetriNetUnfolderBase]: 3/93 cut-off events. [2023-11-30 04:45:28,531 INFO L125 PetriNetUnfolderBase]: For 133/141 co-relation queries the response was YES. [2023-11-30 04:45:28,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 93 events. 3/93 cut-off events. For 133/141 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 3 based on Foata normal form. 1/93 useless extension candidates. Maximal degree in co-relation 128. Up to 18 conditions per place. [2023-11-30 04:45:28,533 INFO L140 encePairwiseOnDemand]: 141/143 looper letters, 16 selfloop transitions, 1 changer transitions 0/85 dead transitions. [2023-11-30 04:45:28,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 85 transitions, 341 flow [2023-11-30 04:45:28,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:28,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:28,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-11-30 04:45:28,535 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7832167832167832 [2023-11-30 04:45:28,535 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-11-30 04:45:28,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-11-30 04:45:28,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:28,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-11-30 04:45:28,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:28,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:28,538 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:28,540 INFO L307 CegarLoopForPetriNet]: 100 programPoint places, 5 predicate places. [2023-11-30 04:45:28,541 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 85 transitions, 341 flow [2023-11-30 04:45:28,541 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:28,541 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:28,542 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:28,542 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:45:28,543 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-11-30 04:45:28,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:28,546 INFO L85 PathProgramCache]: Analyzing trace with hash -553041789, now seen corresponding path program 1 times [2023-11-30 04:45:28,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:28,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132572605] [2023-11-30 04:45:28,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:28,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:28,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:45:28,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:28,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132572605] [2023-11-30 04:45:28,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132572605] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:28,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:28,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:28,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288390467] [2023-11-30 04:45:28,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:28,664 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:28,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:28,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:28,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:28,667 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 143 [2023-11-30 04:45:28,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 85 transitions, 341 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:28,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:28,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 143 [2023-11-30 04:45:28,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:28,723 INFO L124 PetriNetUnfolderBase]: 3/92 cut-off events. [2023-11-30 04:45:28,724 INFO L125 PetriNetUnfolderBase]: For 195/205 co-relation queries the response was YES. [2023-11-30 04:45:28,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 92 events. 3/92 cut-off events. For 195/205 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 3 based on Foata normal form. 1/92 useless extension candidates. Maximal degree in co-relation 138. Up to 17 conditions per place. [2023-11-30 04:45:28,724 INFO L140 encePairwiseOnDemand]: 141/143 looper letters, 14 selfloop transitions, 1 changer transitions 0/84 dead transitions. [2023-11-30 04:45:28,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 84 transitions, 363 flow [2023-11-30 04:45:28,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:28,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:28,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-11-30 04:45:28,730 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8065268065268065 [2023-11-30 04:45:28,730 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-11-30 04:45:28,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-11-30 04:45:28,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:28,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-11-30 04:45:28,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:28,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:28,733 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:28,735 INFO L307 CegarLoopForPetriNet]: 100 programPoint places, 6 predicate places. [2023-11-30 04:45:28,736 INFO L500 AbstractCegarLoop]: Abstraction has has 106 places, 84 transitions, 363 flow [2023-11-30 04:45:28,736 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:28,736 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:28,736 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:28,737 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:45:28,738 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-11-30 04:45:28,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:28,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1101632940, now seen corresponding path program 1 times [2023-11-30 04:45:28,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:28,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582642487] [2023-11-30 04:45:28,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:28,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:28,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:45:28,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:28,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582642487] [2023-11-30 04:45:28,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582642487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:28,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:28,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:28,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010053600] [2023-11-30 04:45:28,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:28,804 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:28,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:28,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:28,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:28,806 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 143 [2023-11-30 04:45:28,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 84 transitions, 363 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:28,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:28,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 143 [2023-11-30 04:45:28,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:28,852 INFO L124 PetriNetUnfolderBase]: 2/93 cut-off events. [2023-11-30 04:45:28,853 INFO L125 PetriNetUnfolderBase]: For 249/261 co-relation queries the response was YES. [2023-11-30 04:45:28,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 93 events. 2/93 cut-off events. For 249/261 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 1 based on Foata normal form. 2/95 useless extension candidates. Maximal degree in co-relation 140. Up to 16 conditions per place. [2023-11-30 04:45:28,854 INFO L140 encePairwiseOnDemand]: 141/143 looper letters, 16 selfloop transitions, 1 changer transitions 0/84 dead transitions. [2023-11-30 04:45:28,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 84 transitions, 403 flow [2023-11-30 04:45:28,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:28,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:28,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-11-30 04:45:28,856 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7832167832167832 [2023-11-30 04:45:28,856 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-11-30 04:45:28,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-11-30 04:45:28,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:28,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-11-30 04:45:28,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:28,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:28,859 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:28,860 INFO L307 CegarLoopForPetriNet]: 100 programPoint places, 7 predicate places. [2023-11-30 04:45:28,860 INFO L500 AbstractCegarLoop]: Abstraction has has 107 places, 84 transitions, 403 flow [2023-11-30 04:45:28,861 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:28,861 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:28,861 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:28,861 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:45:28,861 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-11-30 04:45:28,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:28,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1101632939, now seen corresponding path program 1 times [2023-11-30 04:45:28,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:28,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411979873] [2023-11-30 04:45:28,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:28,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:28,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:45:28,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:28,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411979873] [2023-11-30 04:45:28,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411979873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:28,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:28,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:28,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435442897] [2023-11-30 04:45:28,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:28,963 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:28,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:28,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:28,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:28,964 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 143 [2023-11-30 04:45:28,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 84 transitions, 403 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:28,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:28,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 143 [2023-11-30 04:45:28,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:28,996 INFO L124 PetriNetUnfolderBase]: 1/87 cut-off events. [2023-11-30 04:45:28,996 INFO L125 PetriNetUnfolderBase]: For 318/332 co-relation queries the response was YES. [2023-11-30 04:45:28,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 87 events. 1/87 cut-off events. For 318/332 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 4/91 useless extension candidates. Maximal degree in co-relation 129. Up to 15 conditions per place. [2023-11-30 04:45:28,997 INFO L140 encePairwiseOnDemand]: 141/143 looper letters, 0 selfloop transitions, 0 changer transitions 83/83 dead transitions. [2023-11-30 04:45:28,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 83 transitions, 423 flow [2023-11-30 04:45:28,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:28,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:28,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-11-30 04:45:28,998 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8065268065268065 [2023-11-30 04:45:28,999 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-11-30 04:45:28,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-11-30 04:45:28,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:28,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-11-30 04:45:29,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:29,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:29,001 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:29,002 INFO L307 CegarLoopForPetriNet]: 100 programPoint places, 8 predicate places. [2023-11-30 04:45:29,004 INFO L500 AbstractCegarLoop]: Abstraction has has 108 places, 83 transitions, 423 flow [2023-11-30 04:45:29,004 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:29,015 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mix030_tso.i_BEv2_AllErrorsAtOnce [2023-11-30 04:45:29,072 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 12 remaining) [2023-11-30 04:45:29,073 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2023-11-30 04:45:29,076 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-11-30 04:45:29,076 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-11-30 04:45:29,076 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-11-30 04:45:29,076 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-11-30 04:45:29,079 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-11-30 04:45:29,080 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-11-30 04:45:29,080 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-11-30 04:45:29,080 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-11-30 04:45:29,080 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-11-30 04:45:29,080 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 12 remaining) [2023-11-30 04:45:29,080 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:45:29,081 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:29,091 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:45:29,091 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:45:29,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:45:29 BasicIcfg [2023-11-30 04:45:29,099 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:45:29,100 INFO L158 Benchmark]: Toolchain (without parser) took 3392.52ms. Allocated memory was 341.8MB in the beginning and 511.7MB in the end (delta: 169.9MB). Free memory was 283.1MB in the beginning and 469.7MB in the end (delta: -186.7MB). Peak memory consumption was 282.7MB. Max. memory is 16.0GB. [2023-11-30 04:45:29,100 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 341.8MB. Free memory is still 289.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:45:29,100 INFO L158 Benchmark]: CACSL2BoogieTranslator took 591.42ms. Allocated memory is still 341.8MB. Free memory was 282.8MB in the beginning and 258.2MB in the end (delta: 24.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-11-30 04:45:29,100 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.29ms. Allocated memory is still 511.7MB. Free memory was 482.0MB in the beginning and 477.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 04:45:29,100 INFO L158 Benchmark]: Boogie Preprocessor took 37.94ms. Allocated memory is still 511.7MB. Free memory was 477.8MB in the beginning and 475.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:45:29,101 INFO L158 Benchmark]: RCFGBuilder took 664.47ms. Allocated memory is still 511.7MB. Free memory was 475.7MB in the beginning and 429.5MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.0GB. [2023-11-30 04:45:29,101 INFO L158 Benchmark]: TraceAbstraction took 2019.89ms. Allocated memory is still 511.7MB. Free memory was 428.5MB in the beginning and 469.7MB in the end (delta: -41.2MB). Peak memory consumption was 257.9MB. Max. memory is 16.0GB. [2023-11-30 04:45:29,102 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.13ms. Allocated memory is still 341.8MB. Free memory is still 289.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 591.42ms. Allocated memory is still 341.8MB. Free memory was 282.8MB in the beginning and 258.2MB in the end (delta: 24.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 56.29ms. Allocated memory is still 511.7MB. Free memory was 482.0MB in the beginning and 477.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 37.94ms. Allocated memory is still 511.7MB. Free memory was 477.8MB in the beginning and 475.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 664.47ms. Allocated memory is still 511.7MB. Free memory was 475.7MB in the beginning and 429.5MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.0GB. * TraceAbstraction took 2019.89ms. Allocated memory is still 511.7MB. Free memory was 428.5MB in the beginning and 469.7MB in the end (delta: -41.2MB). Peak memory consumption was 257.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 178 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.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, 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, 138 IncrementalHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 60 mSDtfsCounter, 138 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=423occurred 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.8s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 404 ConstructedInterpolants, 0 QuantifiedInterpolants, 548 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-11-30 04:45:29,123 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...