/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/mix023_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:44:48,278 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:44:48,363 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:44:48,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:44:48,395 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:44:48,396 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:44:48,396 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:44:48,397 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:44:48,397 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:44:48,400 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:44:48,401 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:44:48,401 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:44:48,401 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:44:48,402 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:44:48,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:44:48,402 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:44:48,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:44:48,403 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:44:48,403 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:44:48,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:44:48,403 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:44:48,404 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:44:48,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:44:48,404 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:44:48,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:44:48,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:44:48,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:44:48,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:44:48,406 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:44:48,407 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:44:48,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:44:48,408 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:44:48,408 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:44:48,408 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:44:48,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:44:48,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:44:48,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:44:48,653 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:44:48,653 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:44:48,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.i [2023-11-30 04:44:49,790 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:44:50,035 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:44:50,035 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_tso.i [2023-11-30 04:44:50,068 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3521c8a2e/b9b322adc83b453bbbbed7ad2bce1563/FLAGd8cd0c261 [2023-11-30 04:44:50,082 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3521c8a2e/b9b322adc83b453bbbbed7ad2bce1563 [2023-11-30 04:44:50,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:44:50,086 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:44:50,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:44:50,088 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:44:50,091 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:44:50,092 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:44:50" (1/1) ... [2023-11-30 04:44:50,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72c1624f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:44:50, skipping insertion in model container [2023-11-30 04:44:50,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:44:50" (1/1) ... [2023-11-30 04:44:50,140 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:44:50,523 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:44:50,534 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:44:50,619 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:44:50,651 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:44:50,651 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:44:50,658 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:44:50,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:44:50 WrapperNode [2023-11-30 04:44:50,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:44:50,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:44:50,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:44:50,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:44:50,666 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:44:50" (1/1) ... [2023-11-30 04:44:50,697 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:44:50" (1/1) ... [2023-11-30 04:44:50,749 INFO L138 Inliner]: procedures = 177, calls = 73, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 290 [2023-11-30 04:44:50,750 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:44:50,750 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:44:50,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:44:50,751 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:44:50,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:44:50" (1/1) ... [2023-11-30 04:44:50,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:44:50" (1/1) ... [2023-11-30 04:44:50,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:44:50" (1/1) ... [2023-11-30 04:44:50,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:44:50" (1/1) ... [2023-11-30 04:44:50,799 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:44:50" (1/1) ... [2023-11-30 04:44:50,800 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:44:50" (1/1) ... [2023-11-30 04:44:50,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:44:50" (1/1) ... [2023-11-30 04:44:50,816 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:44:50" (1/1) ... [2023-11-30 04:44:50,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:44:50,821 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:44:50,821 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:44:50,821 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:44:50,822 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:44:50" (1/1) ... [2023-11-30 04:44:50,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:44:50,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:44:50,859 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:44:50,880 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:44:50,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:44:50,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:44:50,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:44:50,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:44:50,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:44:50,892 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-30 04:44:50,893 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-30 04:44:50,893 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-30 04:44:50,893 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-30 04:44:50,893 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-30 04:44:50,893 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-30 04:44:50,893 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-30 04:44:50,894 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-30 04:44:50,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:44:50,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:44:50,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:44:50,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:44:50,895 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:44:51,015 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:44:51,016 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:44:51,487 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:44:51,656 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:44:51,656 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:44:51,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:44:51 BoogieIcfgContainer [2023-11-30 04:44:51,658 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:44:51,660 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:44:51,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:44:51,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:44:51,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:44:50" (1/3) ... [2023-11-30 04:44:51,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a7cbd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:44:51, skipping insertion in model container [2023-11-30 04:44:51,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:44:50" (2/3) ... [2023-11-30 04:44:51,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a7cbd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:44:51, skipping insertion in model container [2023-11-30 04:44:51,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:44:51" (3/3) ... [2023-11-30 04:44:51,665 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_tso.i [2023-11-30 04:44:51,682 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:44:51,683 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-30 04:44:51,683 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:44:51,745 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:44:51,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 164 transitions, 344 flow [2023-11-30 04:44:51,869 INFO L124 PetriNetUnfolderBase]: 3/160 cut-off events. [2023-11-30 04:44:51,871 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:44:51,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 160 events. 3/160 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/149 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2023-11-30 04:44:51,878 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 164 transitions, 344 flow [2023-11-30 04:44:51,884 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 111 transitions, 231 flow [2023-11-30 04:44:51,895 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:44:51,900 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;@3ffd47f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:44:51,900 INFO L363 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-11-30 04:44:51,910 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:44:51,910 INFO L124 PetriNetUnfolderBase]: 0/61 cut-off events. [2023-11-30 04:44:51,910 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:44:51,911 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:44:51,911 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] [2023-11-30 04:44:51,912 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:44:51,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:44:51,916 INFO L85 PathProgramCache]: Analyzing trace with hash 683640064, now seen corresponding path program 1 times [2023-11-30 04:44:51,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:44:51,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634719743] [2023-11-30 04:44:51,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:44:51,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:44:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:44:52,250 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:44:52,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:44:52,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634719743] [2023-11-30 04:44:52,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634719743] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:44:52,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:44:52,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:44:52,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692184472] [2023-11-30 04:44:52,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:44:52,263 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:44:52,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:44:52,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:44:52,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:44:52,300 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 164 [2023-11-30 04:44:52,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:52,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:44:52,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 164 [2023-11-30 04:44:52,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:44:52,484 INFO L124 PetriNetUnfolderBase]: 113/433 cut-off events. [2023-11-30 04:44:52,485 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-30 04:44:52,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 433 events. 113/433 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2167 event pairs, 113 based on Foata normal form. 0/417 useless extension candidates. Maximal degree in co-relation 590. Up to 204 conditions per place. [2023-11-30 04:44:52,493 INFO L140 encePairwiseOnDemand]: 162/164 looper letters, 22 selfloop transitions, 1 changer transitions 0/110 dead transitions. [2023-11-30 04:44:52,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 110 transitions, 275 flow [2023-11-30 04:44:52,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:44:52,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:44:52,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2023-11-30 04:44:52,511 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7987804878048781 [2023-11-30 04:44:52,511 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 393 transitions. [2023-11-30 04:44:52,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions. [2023-11-30 04:44:52,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:44:52,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions. [2023-11-30 04:44:52,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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:44:52,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:52,527 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:52,531 INFO L307 CegarLoopForPetriNet]: 121 programPoint places, 1 predicate places. [2023-11-30 04:44:52,532 INFO L500 AbstractCegarLoop]: Abstraction has has 122 places, 110 transitions, 275 flow [2023-11-30 04:44:52,532 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:52,533 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:44:52,533 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] [2023-11-30 04:44:52,534 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:44:52,534 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:44:52,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:44:52,535 INFO L85 PathProgramCache]: Analyzing trace with hash 683640065, now seen corresponding path program 1 times [2023-11-30 04:44:52,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:44:52,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575998996] [2023-11-30 04:44:52,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:44:52,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:44:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:44:52,705 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:44:52,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:44:52,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575998996] [2023-11-30 04:44:52,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575998996] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:44:52,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:44:52,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:44:52,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411056249] [2023-11-30 04:44:52,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:44:52,707 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:44:52,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:44:52,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:44:52,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:44:52,709 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 164 [2023-11-30 04:44:52,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 110 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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:44:52,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:44:52,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 164 [2023-11-30 04:44:52,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:44:52,845 INFO L124 PetriNetUnfolderBase]: 152/485 cut-off events. [2023-11-30 04:44:52,845 INFO L125 PetriNetUnfolderBase]: For 115/125 co-relation queries the response was YES. [2023-11-30 04:44:52,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1004 conditions, 485 events. 152/485 cut-off events. For 115/125 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2543 event pairs, 152 based on Foata normal form. 0/476 useless extension candidates. Maximal degree in co-relation 921. Up to 242 conditions per place. [2023-11-30 04:44:52,850 INFO L140 encePairwiseOnDemand]: 162/164 looper letters, 20 selfloop transitions, 1 changer transitions 0/109 dead transitions. [2023-11-30 04:44:52,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 109 transitions, 313 flow [2023-11-30 04:44:52,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:44:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:44:52,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2023-11-30 04:44:52,852 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8191056910569106 [2023-11-30 04:44:52,852 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 403 transitions. [2023-11-30 04:44:52,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 403 transitions. [2023-11-30 04:44:52,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:44:52,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 403 transitions. [2023-11-30 04:44:52,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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:44:52,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:52,856 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:52,856 INFO L307 CegarLoopForPetriNet]: 121 programPoint places, 2 predicate places. [2023-11-30 04:44:52,856 INFO L500 AbstractCegarLoop]: Abstraction has has 123 places, 109 transitions, 313 flow [2023-11-30 04:44:52,857 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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:44:52,857 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:44:52,857 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:44:52,857 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:44:52,858 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:44:52,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:44:52,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1809247770, now seen corresponding path program 1 times [2023-11-30 04:44:52,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:44:52,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14394991] [2023-11-30 04:44:52,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:44:52,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:44:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:44:52,996 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:44:52,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:44:52,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14394991] [2023-11-30 04:44:52,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14394991] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:44:52,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:44:52,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:44:52,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258237985] [2023-11-30 04:44:52,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:44:52,998 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:44:52,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:44:52,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:44:52,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:44:52,999 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 164 [2023-11-30 04:44:53,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 109 transitions, 313 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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:44:53,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:44:53,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 164 [2023-11-30 04:44:53,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:44:53,142 INFO L124 PetriNetUnfolderBase]: 151/482 cut-off events. [2023-11-30 04:44:53,142 INFO L125 PetriNetUnfolderBase]: For 290/314 co-relation queries the response was YES. [2023-11-30 04:44:53,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1243 conditions, 482 events. 151/482 cut-off events. For 290/314 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2504 event pairs, 96 based on Foata normal form. 2/476 useless extension candidates. Maximal degree in co-relation 1152. Up to 241 conditions per place. [2023-11-30 04:44:53,148 INFO L140 encePairwiseOnDemand]: 162/164 looper letters, 22 selfloop transitions, 1 changer transitions 0/109 dead transitions. [2023-11-30 04:44:53,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 109 transitions, 361 flow [2023-11-30 04:44:53,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:44:53,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:44:53,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2023-11-30 04:44:53,151 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7987804878048781 [2023-11-30 04:44:53,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 393 transitions. [2023-11-30 04:44:53,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions. [2023-11-30 04:44:53,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:44:53,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions. [2023-11-30 04:44:53,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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:44:53,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:53,155 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:53,156 INFO L307 CegarLoopForPetriNet]: 121 programPoint places, 3 predicate places. [2023-11-30 04:44:53,156 INFO L500 AbstractCegarLoop]: Abstraction has has 124 places, 109 transitions, 361 flow [2023-11-30 04:44:53,156 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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:44:53,156 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:44:53,157 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:44:53,157 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:44:53,157 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:44:53,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:44:53,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1809247769, now seen corresponding path program 1 times [2023-11-30 04:44:53,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:44:53,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382507391] [2023-11-30 04:44:53,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:44:53,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:44:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:44:53,293 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:44:53,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:44:53,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382507391] [2023-11-30 04:44:53,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382507391] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:44:53,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:44:53,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:44:53,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641433653] [2023-11-30 04:44:53,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:44:53,296 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:44:53,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:44:53,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:44:53,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:44:53,303 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 164 [2023-11-30 04:44:53,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 109 transitions, 361 flow. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 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:44:53,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:44:53,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 164 [2023-11-30 04:44:53,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:44:53,444 INFO L124 PetriNetUnfolderBase]: 150/483 cut-off events. [2023-11-30 04:44:53,445 INFO L125 PetriNetUnfolderBase]: For 500/538 co-relation queries the response was YES. [2023-11-30 04:44:53,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1479 conditions, 483 events. 150/483 cut-off events. For 500/538 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2525 event pairs, 149 based on Foata normal form. 4/479 useless extension candidates. Maximal degree in co-relation 1381. Up to 238 conditions per place. [2023-11-30 04:44:53,450 INFO L140 encePairwiseOnDemand]: 162/164 looper letters, 20 selfloop transitions, 1 changer transitions 0/108 dead transitions. [2023-11-30 04:44:53,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 108 transitions, 397 flow [2023-11-30 04:44:53,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:44:53,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:44:53,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2023-11-30 04:44:53,452 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8191056910569106 [2023-11-30 04:44:53,452 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 403 transitions. [2023-11-30 04:44:53,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 403 transitions. [2023-11-30 04:44:53,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:44:53,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 403 transitions. [2023-11-30 04:44:53,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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:44:53,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:53,456 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:53,457 INFO L307 CegarLoopForPetriNet]: 121 programPoint places, 4 predicate places. [2023-11-30 04:44:53,457 INFO L500 AbstractCegarLoop]: Abstraction has has 125 places, 108 transitions, 397 flow [2023-11-30 04:44:53,457 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 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:44:53,458 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:44:53,458 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:44:53,458 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:44:53,458 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:44:53,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:44:53,459 INFO L85 PathProgramCache]: Analyzing trace with hash 2106586465, now seen corresponding path program 1 times [2023-11-30 04:44:53,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:44:53,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364260338] [2023-11-30 04:44:53,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:44:53,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:44:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:44:53,598 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:44:53,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:44:53,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364260338] [2023-11-30 04:44:53,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364260338] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:44:53,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:44:53,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:44:53,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071057285] [2023-11-30 04:44:53,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:44:53,599 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:44:53,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:44:53,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:44:53,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:44:53,601 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 164 [2023-11-30 04:44:53,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 108 transitions, 397 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 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:44:53,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:44:53,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 164 [2023-11-30 04:44:53,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:44:53,744 INFO L124 PetriNetUnfolderBase]: 140/445 cut-off events. [2023-11-30 04:44:53,744 INFO L125 PetriNetUnfolderBase]: For 795/817 co-relation queries the response was YES. [2023-11-30 04:44:53,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1617 conditions, 445 events. 140/445 cut-off events. For 795/817 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2112 event pairs, 29 based on Foata normal form. 8/451 useless extension candidates. Maximal degree in co-relation 1512. Up to 228 conditions per place. [2023-11-30 04:44:53,748 INFO L140 encePairwiseOnDemand]: 162/164 looper letters, 24 selfloop transitions, 1 changer transitions 0/111 dead transitions. [2023-11-30 04:44:53,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 111 transitions, 481 flow [2023-11-30 04:44:53,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:44:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:44:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-11-30 04:44:53,750 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8252032520325203 [2023-11-30 04:44:53,750 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-11-30 04:44:53,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-11-30 04:44:53,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:44:53,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-11-30 04:44:53,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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:44:53,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:53,753 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:53,753 INFO L307 CegarLoopForPetriNet]: 121 programPoint places, 5 predicate places. [2023-11-30 04:44:53,753 INFO L500 AbstractCegarLoop]: Abstraction has has 126 places, 111 transitions, 481 flow [2023-11-30 04:44:53,754 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 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:44:53,754 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:44:53,754 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:44:53,754 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:44:53,754 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:44:53,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:44:53,755 INFO L85 PathProgramCache]: Analyzing trace with hash 2106586464, now seen corresponding path program 1 times [2023-11-30 04:44:53,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:44:53,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805487815] [2023-11-30 04:44:53,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:44:53,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:44:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:44:53,804 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:44:53,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:44:53,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805487815] [2023-11-30 04:44:53,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805487815] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:44:53,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:44:53,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:44:53,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763814363] [2023-11-30 04:44:53,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:44:53,805 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:44:53,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:44:53,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:44:53,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:44:53,806 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 164 [2023-11-30 04:44:53,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 111 transitions, 481 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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:44:53,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:44:53,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 164 [2023-11-30 04:44:53,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:44:53,906 INFO L124 PetriNetUnfolderBase]: 130/423 cut-off events. [2023-11-30 04:44:53,906 INFO L125 PetriNetUnfolderBase]: For 1097/1127 co-relation queries the response was YES. [2023-11-30 04:44:53,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1736 conditions, 423 events. 130/423 cut-off events. For 1097/1127 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1976 event pairs, 24 based on Foata normal form. 8/429 useless extension candidates. Maximal degree in co-relation 1623. Up to 210 conditions per place. [2023-11-30 04:44:53,910 INFO L140 encePairwiseOnDemand]: 162/164 looper letters, 24 selfloop transitions, 1 changer transitions 0/110 dead transitions. [2023-11-30 04:44:53,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 110 transitions, 523 flow [2023-11-30 04:44:53,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:44:53,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:44:53,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-11-30 04:44:53,912 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8008130081300813 [2023-11-30 04:44:53,912 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-11-30 04:44:53,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-11-30 04:44:53,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:44:53,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-11-30 04:44:53,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 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:44:53,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:53,915 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:53,915 INFO L307 CegarLoopForPetriNet]: 121 programPoint places, 6 predicate places. [2023-11-30 04:44:53,915 INFO L500 AbstractCegarLoop]: Abstraction has has 127 places, 110 transitions, 523 flow [2023-11-30 04:44:53,916 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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:44:53,916 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:44:53,916 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:44:53,916 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:44:53,916 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:44:53,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:44:53,917 INFO L85 PathProgramCache]: Analyzing trace with hash -597499992, now seen corresponding path program 1 times [2023-11-30 04:44:53,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:44:53,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182036256] [2023-11-30 04:44:53,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:44:53,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:44:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:44:54,000 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:44:54,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:44:54,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182036256] [2023-11-30 04:44:54,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182036256] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:44:54,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:44:54,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:44:54,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195305651] [2023-11-30 04:44:54,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:44:54,001 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:44:54,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:44:54,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:44:54,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:44:54,003 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 164 [2023-11-30 04:44:54,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 110 transitions, 523 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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:44:54,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:44:54,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 164 [2023-11-30 04:44:54,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:44:54,098 INFO L124 PetriNetUnfolderBase]: 102/379 cut-off events. [2023-11-30 04:44:54,099 INFO L125 PetriNetUnfolderBase]: For 1227/1265 co-relation queries the response was YES. [2023-11-30 04:44:54,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1662 conditions, 379 events. 102/379 cut-off events. For 1227/1265 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1696 event pairs, 0 based on Foata normal form. 16/393 useless extension candidates. Maximal degree in co-relation 1542. Up to 182 conditions per place. [2023-11-30 04:44:54,103 INFO L140 encePairwiseOnDemand]: 162/164 looper letters, 28 selfloop transitions, 1 changer transitions 0/114 dead transitions. [2023-11-30 04:44:54,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 114 transitions, 643 flow [2023-11-30 04:44:54,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:44:54,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:44:54,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-11-30 04:44:54,105 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8252032520325203 [2023-11-30 04:44:54,105 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-11-30 04:44:54,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-11-30 04:44:54,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:44:54,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-11-30 04:44:54,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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:44:54,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:54,107 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:54,108 INFO L307 CegarLoopForPetriNet]: 121 programPoint places, 7 predicate places. [2023-11-30 04:44:54,108 INFO L500 AbstractCegarLoop]: Abstraction has has 128 places, 114 transitions, 643 flow [2023-11-30 04:44:54,108 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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:44:54,108 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:44:54,109 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:44:54,109 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:44:54,109 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:44:54,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:44:54,109 INFO L85 PathProgramCache]: Analyzing trace with hash -597499993, now seen corresponding path program 1 times [2023-11-30 04:44:54,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:44:54,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983445666] [2023-11-30 04:44:54,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:44:54,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:44:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:44:54,164 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:44:54,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:44:54,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983445666] [2023-11-30 04:44:54,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983445666] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:44:54,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:44:54,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:44:54,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021316766] [2023-11-30 04:44:54,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:44:54,165 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:44:54,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:44:54,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:44:54,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:44:54,166 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 164 [2023-11-30 04:44:54,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 114 transitions, 643 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:54,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:44:54,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 164 [2023-11-30 04:44:54,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:44:54,247 INFO L124 PetriNetUnfolderBase]: 74/335 cut-off events. [2023-11-30 04:44:54,248 INFO L125 PetriNetUnfolderBase]: For 1320/1366 co-relation queries the response was YES. [2023-11-30 04:44:54,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1501 conditions, 335 events. 74/335 cut-off events. For 1320/1366 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1449 event pairs, 0 based on Foata normal form. 16/349 useless extension candidates. Maximal degree in co-relation 1373. Up to 138 conditions per place. [2023-11-30 04:44:54,249 INFO L140 encePairwiseOnDemand]: 162/164 looper letters, 0 selfloop transitions, 0 changer transitions 113/113 dead transitions. [2023-11-30 04:44:54,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 113 transitions, 691 flow [2023-11-30 04:44:54,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:44:54,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:44:54,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-11-30 04:44:54,251 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8008130081300813 [2023-11-30 04:44:54,251 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-11-30 04:44:54,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-11-30 04:44:54,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:44:54,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-11-30 04:44:54,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 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:44:54,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:54,254 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:54,254 INFO L307 CegarLoopForPetriNet]: 121 programPoint places, 8 predicate places. [2023-11-30 04:44:54,254 INFO L500 AbstractCegarLoop]: Abstraction has has 129 places, 113 transitions, 691 flow [2023-11-30 04:44:54,255 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:54,262 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mix023_tso.i_BEv2_AllErrorsAtOnce [2023-11-30 04:44:54,285 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 12 remaining) [2023-11-30 04:44:54,285 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2023-11-30 04:44:54,286 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-11-30 04:44:54,286 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-11-30 04:44:54,286 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-11-30 04:44:54,286 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-11-30 04:44:54,286 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-11-30 04:44:54,286 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-11-30 04:44:54,287 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-11-30 04:44:54,287 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-11-30 04:44:54,287 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-11-30 04:44:54,287 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 12 remaining) [2023-11-30 04:44:54,287 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:44:54,288 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:44:54,290 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:44:54,290 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:44:54,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:44:54 BasicIcfg [2023-11-30 04:44:54,296 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:44:54,296 INFO L158 Benchmark]: Toolchain (without parser) took 4210.51ms. Allocated memory is still 488.6MB. Free memory was 436.9MB in the beginning and 222.4MB in the end (delta: 214.4MB). Peak memory consumption was 214.8MB. Max. memory is 16.0GB. [2023-11-30 04:44:54,296 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 352.3MB. Free memory is still 304.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:44:54,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 570.89ms. Allocated memory is still 488.6MB. Free memory was 436.5MB in the beginning and 407.1MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-11-30 04:44:54,297 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.39ms. Allocated memory is still 488.6MB. Free memory was 407.1MB in the beginning and 403.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 04:44:54,297 INFO L158 Benchmark]: Boogie Preprocessor took 70.14ms. Allocated memory is still 488.6MB. Free memory was 403.0MB in the beginning and 400.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:44:54,298 INFO L158 Benchmark]: RCFGBuilder took 836.54ms. Allocated memory is still 488.6MB. Free memory was 400.2MB in the beginning and 381.2MB in the end (delta: 19.0MB). Peak memory consumption was 20.4MB. Max. memory is 16.0GB. [2023-11-30 04:44:54,298 INFO L158 Benchmark]: TraceAbstraction took 2636.11ms. Allocated memory is still 488.6MB. Free memory was 380.1MB in the beginning and 222.4MB in the end (delta: 157.7MB). Peak memory consumption was 156.6MB. Max. memory is 16.0GB. [2023-11-30 04:44:54,299 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.12ms. Allocated memory is still 352.3MB. Free memory is still 304.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 570.89ms. Allocated memory is still 488.6MB. Free memory was 436.5MB in the beginning and 407.1MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 90.39ms. Allocated memory is still 488.6MB. Free memory was 407.1MB in the beginning and 403.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 70.14ms. Allocated memory is still 488.6MB. Free memory was 403.0MB in the beginning and 400.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 836.54ms. Allocated memory is still 488.6MB. Free memory was 400.2MB in the beginning and 381.2MB in the end (delta: 19.0MB). Peak memory consumption was 20.4MB. Max. memory is 16.0GB. * TraceAbstraction took 2636.11ms. Allocated memory is still 488.6MB. Free memory was 380.1MB in the beginning and 222.4MB in the end (delta: 157.7MB). Peak memory consumption was 156.6MB. 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, 200 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: 2.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 80 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 207 IncrementalHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 60 mSDtfsCounter, 207 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=691occurred 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, 572 NumberOfCodeBlocks, 572 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 564 ConstructedInterpolants, 0 QuantifiedInterpolants, 708 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:44:54,322 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...