/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/mix005.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:42:43,463 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:42:43,540 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:42:43,579 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:42:43,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:42:43,580 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:42:43,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:42:43,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:42:43,581 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:42:43,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:42:43,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:42:43,584 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:42:43,584 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:42:43,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:42:43,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:42:43,585 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:42:43,586 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:42:43,586 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:42:43,586 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:42:43,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:42:43,586 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:42:43,587 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:42:43,587 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:42:43,587 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:42:43,587 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:42:43,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:42:43,587 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:42:43,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:42:43,588 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:42:43,588 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:42:43,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:42:43,589 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:42:43,589 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:42:43,589 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:42:43,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:42:43,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:42:43,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:42:43,869 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:42:43,869 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:42:43,870 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005.opt.i [2023-11-30 04:42:44,922 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:42:45,082 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:42:45,083 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005.opt.i [2023-11-30 04:42:45,099 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc2967cc9/ad1b9ca272bc4be9a326175299eee1b4/FLAG24bbc24bb [2023-11-30 04:42:45,111 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc2967cc9/ad1b9ca272bc4be9a326175299eee1b4 [2023-11-30 04:42:45,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:42:45,114 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:42:45,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:42:45,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:42:45,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:42:45,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:42:45" (1/1) ... [2023-11-30 04:42:45,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39361ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:42:45, skipping insertion in model container [2023-11-30 04:42:45,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:42:45" (1/1) ... [2023-11-30 04:42:45,167 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:42:45,454 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:42:45,468 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:42:45,536 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:42:45,564 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:42:45,564 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:42:45,569 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:42:45,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:42:45 WrapperNode [2023-11-30 04:42:45,570 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:42:45,571 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:42:45,571 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:42:45,571 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:42:45,576 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:42:45" (1/1) ... [2023-11-30 04:42:45,607 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:42:45" (1/1) ... [2023-11-30 04:42:45,635 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 171 [2023-11-30 04:42:45,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:42:45,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:42:45,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:42:45,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:42:45,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:42:45" (1/1) ... [2023-11-30 04:42:45,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:42:45" (1/1) ... [2023-11-30 04:42:45,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:42:45" (1/1) ... [2023-11-30 04:42:45,655 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:42:45" (1/1) ... [2023-11-30 04:42:45,666 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:42:45" (1/1) ... [2023-11-30 04:42:45,668 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:42:45" (1/1) ... [2023-11-30 04:42:45,669 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:42:45" (1/1) ... [2023-11-30 04:42:45,670 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:42:45" (1/1) ... [2023-11-30 04:42:45,673 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:42:45,673 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:42:45,673 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:42:45,674 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:42:45,674 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:42:45" (1/1) ... [2023-11-30 04:42:45,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:42:45,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:42:45,712 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:42:45,715 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:42:45,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:42:45,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:42:45,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:42:45,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:42:45,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:42:45,734 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-30 04:42:45,734 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-30 04:42:45,734 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-30 04:42:45,734 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-30 04:42:45,734 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-30 04:42:45,734 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-30 04:42:45,734 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-30 04:42:45,734 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-30 04:42:45,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:42:45,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:42:45,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:42:45,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:42:45,736 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:42:45,849 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:42:45,852 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:42:46,199 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:42:46,287 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:42:46,287 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:42:46,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:42:46 BoogieIcfgContainer [2023-11-30 04:42:46,289 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:42:46,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:42:46,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:42:46,292 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:42:46,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:42:45" (1/3) ... [2023-11-30 04:42:46,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@599ef395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:42:46, skipping insertion in model container [2023-11-30 04:42:46,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:42:45" (2/3) ... [2023-11-30 04:42:46,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@599ef395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:42:46, skipping insertion in model container [2023-11-30 04:42:46,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:42:46" (3/3) ... [2023-11-30 04:42:46,295 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005.opt.i [2023-11-30 04:42:46,306 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:42:46,306 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-30 04:42:46,306 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:42:46,346 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:42:46,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 147 transitions, 310 flow [2023-11-30 04:42:46,405 INFO L124 PetriNetUnfolderBase]: 3/143 cut-off events. [2023-11-30 04:42:46,406 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:42:46,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 143 events. 3/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 117 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2023-11-30 04:42:46,411 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 147 transitions, 310 flow [2023-11-30 04:42:46,414 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 94 transitions, 197 flow [2023-11-30 04:42:46,425 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:42:46,430 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;@364c8f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:42:46,431 INFO L363 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-11-30 04:42:46,440 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:42:46,440 INFO L124 PetriNetUnfolderBase]: 0/44 cut-off events. [2023-11-30 04:42:46,440 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:42:46,440 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:42:46,441 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] [2023-11-30 04:42:46,441 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:42:46,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:42:46,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1100406145, now seen corresponding path program 1 times [2023-11-30 04:42:46,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:42:46,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129664429] [2023-11-30 04:42:46,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:42:46,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:42:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:42:46,707 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:42:46,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:42:46,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129664429] [2023-11-30 04:42:46,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129664429] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:42:46,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:42:46,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:42:46,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134893936] [2023-11-30 04:42:46,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:42:46,715 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:42:46,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:42:46,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:42:46,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:42:46,735 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 147 [2023-11-30 04:42:46,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 94 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:42:46,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:42:46,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 147 [2023-11-30 04:42:46,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:42:46,803 INFO L124 PetriNetUnfolderBase]: 2/100 cut-off events. [2023-11-30 04:42:46,804 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:42:46,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 100 events. 2/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 2 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 73. Up to 19 conditions per place. [2023-11-30 04:42:46,806 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 18 selfloop transitions, 1 changer transitions 0/93 dead transitions. [2023-11-30 04:42:46,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 93 transitions, 233 flow [2023-11-30 04:42:46,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:42:46,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:42:46,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-11-30 04:42:46,820 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.800453514739229 [2023-11-30 04:42:46,821 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-11-30 04:42:46,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-11-30 04:42:46,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:42:46,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-11-30 04:42:46,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:42:46,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 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:42:46,829 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 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:42:46,832 INFO L307 CegarLoopForPetriNet]: 104 programPoint places, 1 predicate places. [2023-11-30 04:42:46,832 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 93 transitions, 233 flow [2023-11-30 04:42:46,832 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:42:46,832 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:42:46,832 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] [2023-11-30 04:42:46,833 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:42:46,833 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:42:46,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:42:46,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1100406146, now seen corresponding path program 1 times [2023-11-30 04:42:46,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:42:46,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938515327] [2023-11-30 04:42:46,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:42:46,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:42:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:42:46,972 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:42:46,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:42:46,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938515327] [2023-11-30 04:42:46,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938515327] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:42:46,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:42:46,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:42:46,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638213485] [2023-11-30 04:42:46,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:42:46,974 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:42:46,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:42:46,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:42:46,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:42:46,975 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 147 [2023-11-30 04:42:46,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 93 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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:42:46,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:42:46,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 147 [2023-11-30 04:42:46,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:42:47,008 INFO L124 PetriNetUnfolderBase]: 3/100 cut-off events. [2023-11-30 04:42:47,009 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-30 04:42:47,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 100 events. 3/100 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 3 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 91. Up to 19 conditions per place. [2023-11-30 04:42:47,009 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 16 selfloop transitions, 1 changer transitions 0/92 dead transitions. [2023-11-30 04:42:47,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 92 transitions, 263 flow [2023-11-30 04:42:47,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:42:47,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:42:47,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-11-30 04:42:47,011 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8231292517006803 [2023-11-30 04:42:47,011 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-11-30 04:42:47,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-11-30 04:42:47,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:42:47,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-11-30 04:42:47,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:42:47,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 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:42:47,014 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 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:42:47,015 INFO L307 CegarLoopForPetriNet]: 104 programPoint places, 2 predicate places. [2023-11-30 04:42:47,015 INFO L500 AbstractCegarLoop]: Abstraction has has 106 places, 92 transitions, 263 flow [2023-11-30 04:42:47,015 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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:42:47,015 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:42:47,015 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:42:47,015 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:42:47,016 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:42:47,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:42:47,016 INFO L85 PathProgramCache]: Analyzing trace with hash 455621363, now seen corresponding path program 1 times [2023-11-30 04:42:47,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:42:47,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803450357] [2023-11-30 04:42:47,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:42:47,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:42:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:42:47,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:42:47,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:42:47,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803450357] [2023-11-30 04:42:47,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803450357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:42:47,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:42:47,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:42:47,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962074787] [2023-11-30 04:42:47,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:42:47,166 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:42:47,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:42:47,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:42:47,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:42:47,167 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 147 [2023-11-30 04:42:47,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 92 transitions, 263 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:42:47,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:42:47,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 147 [2023-11-30 04:42:47,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:42:47,199 INFO L124 PetriNetUnfolderBase]: 3/99 cut-off events. [2023-11-30 04:42:47,200 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2023-11-30 04:42:47,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 99 events. 3/99 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 3 based on Foata normal form. 1/100 useless extension candidates. Maximal degree in co-relation 105. Up to 19 conditions per place. [2023-11-30 04:42:47,201 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 16 selfloop transitions, 1 changer transitions 0/91 dead transitions. [2023-11-30 04:42:47,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 91 transitions, 293 flow [2023-11-30 04:42:47,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:42:47,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:42:47,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-11-30 04:42:47,202 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8231292517006803 [2023-11-30 04:42:47,203 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-11-30 04:42:47,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-11-30 04:42:47,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:42:47,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-11-30 04:42:47,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:42:47,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 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:42:47,206 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 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:42:47,207 INFO L307 CegarLoopForPetriNet]: 104 programPoint places, 3 predicate places. [2023-11-30 04:42:47,207 INFO L500 AbstractCegarLoop]: Abstraction has has 107 places, 91 transitions, 293 flow [2023-11-30 04:42:47,207 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:42:47,208 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:42:47,208 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:42:47,208 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:42:47,208 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:42:47,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:42:47,208 INFO L85 PathProgramCache]: Analyzing trace with hash 455621362, now seen corresponding path program 1 times [2023-11-30 04:42:47,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:42:47,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914482580] [2023-11-30 04:42:47,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:42:47,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:42:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:42:47,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:42:47,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:42:47,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914482580] [2023-11-30 04:42:47,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914482580] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:42:47,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:42:47,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:42:47,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204302568] [2023-11-30 04:42:47,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:42:47,251 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:42:47,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:42:47,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:42:47,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:42:47,252 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 147 [2023-11-30 04:42:47,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 91 transitions, 293 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:42:47,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:42:47,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 147 [2023-11-30 04:42:47,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:42:47,278 INFO L124 PetriNetUnfolderBase]: 3/98 cut-off events. [2023-11-30 04:42:47,278 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2023-11-30 04:42:47,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 98 events. 3/98 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 3 based on Foata normal form. 1/99 useless extension candidates. Maximal degree in co-relation 117. Up to 18 conditions per place. [2023-11-30 04:42:47,279 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 16 selfloop transitions, 1 changer transitions 0/90 dead transitions. [2023-11-30 04:42:47,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 90 transitions, 321 flow [2023-11-30 04:42:47,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:42:47,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:42:47,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2023-11-30 04:42:47,280 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7959183673469388 [2023-11-30 04:42:47,280 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2023-11-30 04:42:47,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2023-11-30 04:42:47,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:42:47,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2023-11-30 04:42:47,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:42:47,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 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:42:47,283 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 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:42:47,285 INFO L307 CegarLoopForPetriNet]: 104 programPoint places, 4 predicate places. [2023-11-30 04:42:47,285 INFO L500 AbstractCegarLoop]: Abstraction has has 108 places, 90 transitions, 321 flow [2023-11-30 04:42:47,285 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:42:47,285 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:42:47,285 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] [2023-11-30 04:42:47,285 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:42:47,286 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:42:47,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:42:47,286 INFO L85 PathProgramCache]: Analyzing trace with hash -2083469258, now seen corresponding path program 1 times [2023-11-30 04:42:47,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:42:47,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413539423] [2023-11-30 04:42:47,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:42:47,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:42:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:42:47,341 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:42:47,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:42:47,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413539423] [2023-11-30 04:42:47,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413539423] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:42:47,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:42:47,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:42:47,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910535947] [2023-11-30 04:42:47,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:42:47,342 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:42:47,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:42:47,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:42:47,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:42:47,344 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 147 [2023-11-30 04:42:47,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 90 transitions, 321 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:42:47,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:42:47,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 147 [2023-11-30 04:42:47,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:42:47,393 INFO L124 PetriNetUnfolderBase]: 3/97 cut-off events. [2023-11-30 04:42:47,393 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2023-11-30 04:42:47,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 97 events. 3/97 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 3 based on Foata normal form. 1/98 useless extension candidates. Maximal degree in co-relation 129. Up to 18 conditions per place. [2023-11-30 04:42:47,394 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 16 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2023-11-30 04:42:47,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 89 transitions, 349 flow [2023-11-30 04:42:47,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:42:47,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:42:47,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2023-11-30 04:42:47,396 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7959183673469388 [2023-11-30 04:42:47,396 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2023-11-30 04:42:47,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2023-11-30 04:42:47,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:42:47,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2023-11-30 04:42:47,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:42:47,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 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:42:47,398 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 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:42:47,400 INFO L307 CegarLoopForPetriNet]: 104 programPoint places, 5 predicate places. [2023-11-30 04:42:47,401 INFO L500 AbstractCegarLoop]: Abstraction has has 109 places, 89 transitions, 349 flow [2023-11-30 04:42:47,401 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:42:47,401 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:42:47,401 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] [2023-11-30 04:42:47,402 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:42:47,402 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:42:47,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:42:47,405 INFO L85 PathProgramCache]: Analyzing trace with hash -2083469257, now seen corresponding path program 1 times [2023-11-30 04:42:47,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:42:47,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158247700] [2023-11-30 04:42:47,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:42:47,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:42:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:42:47,500 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:42:47,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:42:47,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158247700] [2023-11-30 04:42:47,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158247700] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:42:47,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:42:47,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:42:47,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040720371] [2023-11-30 04:42:47,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:42:47,501 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:42:47,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:42:47,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:42:47,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:42:47,502 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 147 [2023-11-30 04:42:47,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 89 transitions, 349 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:42:47,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:42:47,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 147 [2023-11-30 04:42:47,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:42:47,540 INFO L124 PetriNetUnfolderBase]: 3/96 cut-off events. [2023-11-30 04:42:47,540 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-30 04:42:47,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 96 events. 3/96 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 3 based on Foata normal form. 1/97 useless extension candidates. Maximal degree in co-relation 139. Up to 17 conditions per place. [2023-11-30 04:42:47,541 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 14 selfloop transitions, 1 changer transitions 0/88 dead transitions. [2023-11-30 04:42:47,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 88 transitions, 371 flow [2023-11-30 04:42:47,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:42:47,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:42:47,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-11-30 04:42:47,542 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.81859410430839 [2023-11-30 04:42:47,542 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-11-30 04:42:47,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-11-30 04:42:47,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:42:47,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-11-30 04:42:47,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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:42:47,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 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:42:47,544 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 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:42:47,546 INFO L307 CegarLoopForPetriNet]: 104 programPoint places, 6 predicate places. [2023-11-30 04:42:47,546 INFO L500 AbstractCegarLoop]: Abstraction has has 110 places, 88 transitions, 371 flow [2023-11-30 04:42:47,547 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:42:47,547 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:42:47,547 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] [2023-11-30 04:42:47,547 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:42:47,548 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:42:47,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:42:47,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1961895729, now seen corresponding path program 1 times [2023-11-30 04:42:47,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:42:47,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008434686] [2023-11-30 04:42:47,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:42:47,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:42:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:42:47,625 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:42:47,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:42:47,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008434686] [2023-11-30 04:42:47,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008434686] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:42:47,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:42:47,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:42:47,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294087865] [2023-11-30 04:42:47,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:42:47,629 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:42:47,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:42:47,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:42:47,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:42:47,630 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 147 [2023-11-30 04:42:47,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 88 transitions, 371 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:42:47,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:42:47,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 147 [2023-11-30 04:42:47,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:42:47,662 INFO L124 PetriNetUnfolderBase]: 2/93 cut-off events. [2023-11-30 04:42:47,662 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2023-11-30 04:42:47,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 93 events. 2/93 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 2/95 useless extension candidates. Maximal degree in co-relation 137. Up to 16 conditions per place. [2023-11-30 04:42:47,662 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 15 selfloop transitions, 1 changer transitions 0/88 dead transitions. [2023-11-30 04:42:47,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 88 transitions, 409 flow [2023-11-30 04:42:47,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:42:47,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:42:47,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-11-30 04:42:47,664 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8208616780045351 [2023-11-30 04:42:47,664 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-11-30 04:42:47,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-11-30 04:42:47,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:42:47,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-11-30 04:42:47,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:42:47,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 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:42:47,666 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 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:42:47,667 INFO L307 CegarLoopForPetriNet]: 104 programPoint places, 7 predicate places. [2023-11-30 04:42:47,667 INFO L500 AbstractCegarLoop]: Abstraction has has 111 places, 88 transitions, 409 flow [2023-11-30 04:42:47,667 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:42:47,667 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:42:47,667 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] [2023-11-30 04:42:47,668 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:42:47,668 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:42:47,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:42:47,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1961895730, now seen corresponding path program 1 times [2023-11-30 04:42:47,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:42:47,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067523863] [2023-11-30 04:42:47,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:42:47,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:42:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:42:47,717 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:42:47,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:42:47,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067523863] [2023-11-30 04:42:47,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067523863] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:42:47,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:42:47,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:42:47,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023530289] [2023-11-30 04:42:47,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:42:47,719 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:42:47,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:42:47,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:42:47,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:42:47,721 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 147 [2023-11-30 04:42:47,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 88 transitions, 409 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:42:47,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:42:47,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 147 [2023-11-30 04:42:47,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:42:47,756 INFO L124 PetriNetUnfolderBase]: 1/90 cut-off events. [2023-11-30 04:42:47,757 INFO L125 PetriNetUnfolderBase]: For 300/300 co-relation queries the response was YES. [2023-11-30 04:42:47,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 90 events. 1/90 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 2/92 useless extension candidates. Maximal degree in co-relation 129. Up to 15 conditions per place. [2023-11-30 04:42:47,757 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 0 selfloop transitions, 0 changer transitions 87/87 dead transitions. [2023-11-30 04:42:47,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 87 transitions, 431 flow [2023-11-30 04:42:47,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:42:47,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:42:47,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2023-11-30 04:42:47,760 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7936507936507936 [2023-11-30 04:42:47,764 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2023-11-30 04:42:47,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2023-11-30 04:42:47,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:42:47,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2023-11-30 04:42:47,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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:42:47,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 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:42:47,766 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 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:42:47,766 INFO L307 CegarLoopForPetriNet]: 104 programPoint places, 8 predicate places. [2023-11-30 04:42:47,766 INFO L500 AbstractCegarLoop]: Abstraction has has 112 places, 87 transitions, 431 flow [2023-11-30 04:42:47,767 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:42:47,774 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mix005.opt.i_BEv2_AllErrorsAtOnce [2023-11-30 04:42:47,815 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 12 remaining) [2023-11-30 04:42:47,816 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2023-11-30 04:42:47,816 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-11-30 04:42:47,816 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-11-30 04:42:47,816 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-11-30 04:42:47,816 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-11-30 04:42:47,816 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-11-30 04:42:47,816 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-11-30 04:42:47,817 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-11-30 04:42:47,817 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-11-30 04:42:47,817 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-11-30 04:42:47,817 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 12 remaining) [2023-11-30 04:42:47,817 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:42:47,817 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:42:47,819 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:42:47,819 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:42:47,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:42:47 BasicIcfg [2023-11-30 04:42:47,832 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:42:47,832 INFO L158 Benchmark]: Toolchain (without parser) took 2718.50ms. Allocated memory is still 608.2MB. Free memory was 552.9MB in the beginning and 562.6MB in the end (delta: -9.7MB). Peak memory consumption was 149.5MB. Max. memory is 16.0GB. [2023-11-30 04:42:47,833 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 377.5MB. Free memory is still 325.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:42:47,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.31ms. Allocated memory is still 608.2MB. Free memory was 552.9MB in the beginning and 527.4MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-11-30 04:42:47,835 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.75ms. Allocated memory is still 608.2MB. Free memory was 527.4MB in the beginning and 524.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 04:42:47,835 INFO L158 Benchmark]: Boogie Preprocessor took 36.90ms. Allocated memory is still 608.2MB. Free memory was 524.7MB in the beginning and 522.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:42:47,835 INFO L158 Benchmark]: RCFGBuilder took 615.29ms. Allocated memory is still 608.2MB. Free memory was 522.2MB in the beginning and 551.8MB in the end (delta: -29.5MB). Peak memory consumption was 29.9MB. Max. memory is 16.0GB. [2023-11-30 04:42:47,835 INFO L158 Benchmark]: TraceAbstraction took 1542.18ms. Allocated memory is still 608.2MB. Free memory was 550.7MB in the beginning and 562.6MB in the end (delta: -11.9MB). Peak memory consumption was 144.7MB. Max. memory is 16.0GB. [2023-11-30 04:42:47,838 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 377.5MB. Free memory is still 325.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 455.31ms. Allocated memory is still 608.2MB. Free memory was 552.9MB in the beginning and 527.4MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 64.75ms. Allocated memory is still 608.2MB. Free memory was 527.4MB in the beginning and 524.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 36.90ms. Allocated memory is still 608.2MB. Free memory was 524.7MB in the beginning and 522.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 615.29ms. Allocated memory is still 608.2MB. Free memory was 522.2MB in the beginning and 551.8MB in the end (delta: -29.5MB). Peak memory consumption was 29.9MB. Max. memory is 16.0GB. * TraceAbstraction took 1542.18ms. Allocated memory is still 608.2MB. Free memory was 550.7MB in the beginning and 562.6MB in the end (delta: -11.9MB). Peak memory consumption was 144.7MB. 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, 183 locations, 12 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 140 IncrementalHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 60 mSDtfsCounter, 140 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=431occurred in iteration=8, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 436 NumberOfCodeBlocks, 436 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 428 ConstructedInterpolants, 0 QuantifiedInterpolants, 572 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:42:47,853 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...