/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/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:45:18,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:45:18,899 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 04:45:18,922 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:45:18,923 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:45:18,924 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:45:18,924 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:45:18,924 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:45:18,925 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:45:18,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:45:18,928 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:45:18,928 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:45:18,928 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:45:18,929 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:45:18,929 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:45:18,929 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:45:18,929 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:45:18,929 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:45:18,929 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:45:18,929 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:45:18,930 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:45:18,930 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:45:18,930 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:45:18,930 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:45:18,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:45:18,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:45:18,931 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:45:18,931 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:45:18,931 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:45:18,931 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:45:18,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:45:18,932 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:45:18,932 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:45:18,932 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-11-30 04:45:19,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:45:19,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:45:19,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:45:19,123 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:45:19,125 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:45:19,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-30 04:45:20,297 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:45:20,562 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:45:20,562 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-30 04:45:20,592 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09de7b473/589fc100bdc248db9dc111cd8b458b99/FLAG49bb3ed08 [2023-11-30 04:45:20,605 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09de7b473/589fc100bdc248db9dc111cd8b458b99 [2023-11-30 04:45:20,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:45:20,607 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:45:20,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:45:20,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:45:20,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:45:20,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:45:20" (1/1) ... [2023-11-30 04:45:20,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f1ea16f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:20, skipping insertion in model container [2023-11-30 04:45:20,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:45:20" (1/1) ... [2023-11-30 04:45:20,693 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:45:20,905 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:45:20,919 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:45:20,996 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:45:21,038 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:45:21,039 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:45:21,044 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:45:21,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:21 WrapperNode [2023-11-30 04:45:21,045 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:45:21,046 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:45:21,046 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:45:21,046 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:45:21,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:21" (1/1) ... [2023-11-30 04:45:21,078 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:21" (1/1) ... [2023-11-30 04:45:21,104 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2023-11-30 04:45:21,105 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:45:21,105 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:45:21,105 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:45:21,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:45:21,121 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:21" (1/1) ... [2023-11-30 04:45:21,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:21" (1/1) ... [2023-11-30 04:45:21,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:21" (1/1) ... [2023-11-30 04:45:21,130 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:21" (1/1) ... [2023-11-30 04:45:21,135 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:21" (1/1) ... [2023-11-30 04:45:21,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:21" (1/1) ... [2023-11-30 04:45:21,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:21" (1/1) ... [2023-11-30 04:45:21,138 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:21" (1/1) ... [2023-11-30 04:45:21,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:45:21,154 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:45:21,154 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:45:21,154 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:45:21,155 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:21" (1/1) ... [2023-11-30 04:45:21,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:45:21,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:45:21,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 04:45:21,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 04:45:21,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:45:21,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:45:21,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:45:21,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:45:21,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:45:21,240 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-30 04:45:21,240 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-30 04:45:21,241 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-30 04:45:21,241 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-30 04:45:21,241 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-30 04:45:21,241 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-30 04:45:21,241 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-30 04:45:21,241 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-30 04:45:21,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:45:21,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:45:21,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:45:21,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:45:21,242 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 04:45:21,336 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:45:21,338 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:45:21,623 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:45:21,716 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:45:21,716 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:45:21,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:45:21 BoogieIcfgContainer [2023-11-30 04:45:21,717 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:45:21,718 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:45:21,718 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:45:21,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:45:21,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:45:20" (1/3) ... [2023-11-30 04:45:21,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350d657e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:45:21, skipping insertion in model container [2023-11-30 04:45:21,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:21" (2/3) ... [2023-11-30 04:45:21,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350d657e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:45:21, skipping insertion in model container [2023-11-30 04:45:21,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:45:21" (3/3) ... [2023-11-30 04:45:21,722 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-30 04:45:21,734 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:45:21,734 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-30 04:45:21,735 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:45:21,791 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:45:21,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 144 transitions, 304 flow [2023-11-30 04:45:21,884 INFO L124 PetriNetUnfolderBase]: 3/140 cut-off events. [2023-11-30 04:45:21,884 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:45:21,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 3/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 114 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-11-30 04:45:21,890 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 144 transitions, 304 flow [2023-11-30 04:45:21,897 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 91 transitions, 191 flow [2023-11-30 04:45:21,903 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:45:21,907 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;@32e90e87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:45:21,907 INFO L363 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-11-30 04:45:21,914 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:45:21,914 INFO L124 PetriNetUnfolderBase]: 0/42 cut-off events. [2023-11-30 04:45:21,914 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:45:21,914 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:21,915 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] [2023-11-30 04:45:21,915 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:45:21,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:21,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1514050210, now seen corresponding path program 1 times [2023-11-30 04:45:21,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:21,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986433149] [2023-11-30 04:45:21,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:21,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:22,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:45:22,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:22,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986433149] [2023-11-30 04:45:22,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986433149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:22,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:22,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:22,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548163744] [2023-11-30 04:45:22,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:22,235 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:22,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:22,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:22,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:22,263 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 144 [2023-11-30 04:45:22,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 91 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:22,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 144 [2023-11-30 04:45:22,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:22,392 INFO L124 PetriNetUnfolderBase]: 85/348 cut-off events. [2023-11-30 04:45:22,393 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 04:45:22,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 348 events. 85/348 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1606 event pairs, 85 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 478. Up to 160 conditions per place. [2023-11-30 04:45:22,398 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 21 selfloop transitions, 1 changer transitions 0/90 dead transitions. [2023-11-30 04:45:22,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 90 transitions, 233 flow [2023-11-30 04:45:22,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:22,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:22,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2023-11-30 04:45:22,412 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7893518518518519 [2023-11-30 04:45:22,412 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2023-11-30 04:45:22,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2023-11-30 04:45:22,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:22,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2023-11-30 04:45:22,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,424 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,427 INFO L307 CegarLoopForPetriNet]: 101 programPoint places, 1 predicate places. [2023-11-30 04:45:22,427 INFO L500 AbstractCegarLoop]: Abstraction has has 102 places, 90 transitions, 233 flow [2023-11-30 04:45:22,428 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,428 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:22,429 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] [2023-11-30 04:45:22,429 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:45:22,429 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:45:22,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:22,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1514050209, now seen corresponding path program 1 times [2023-11-30 04:45:22,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:22,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87840143] [2023-11-30 04:45:22,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:22,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:45:22,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:22,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87840143] [2023-11-30 04:45:22,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87840143] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:22,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:22,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:22,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624007034] [2023-11-30 04:45:22,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:22,551 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:22,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:22,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:22,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:22,552 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 144 [2023-11-30 04:45:22,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 90 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:22,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 144 [2023-11-30 04:45:22,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:22,628 INFO L124 PetriNetUnfolderBase]: 114/382 cut-off events. [2023-11-30 04:45:22,628 INFO L125 PetriNetUnfolderBase]: For 105/127 co-relation queries the response was YES. [2023-11-30 04:45:22,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 382 events. 114/382 cut-off events. For 105/127 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1811 event pairs, 114 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 727. Up to 188 conditions per place. [2023-11-30 04:45:22,632 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 19 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2023-11-30 04:45:22,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 89 transitions, 269 flow [2023-11-30 04:45:22,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:22,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:22,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2023-11-30 04:45:22,634 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8125 [2023-11-30 04:45:22,634 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2023-11-30 04:45:22,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2023-11-30 04:45:22,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:22,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2023-11-30 04:45:22,635 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:45:22,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,638 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,638 INFO L307 CegarLoopForPetriNet]: 101 programPoint places, 2 predicate places. [2023-11-30 04:45:22,639 INFO L500 AbstractCegarLoop]: Abstraction has has 103 places, 89 transitions, 269 flow [2023-11-30 04:45:22,639 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,639 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:22,640 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] [2023-11-30 04:45:22,640 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:45:22,640 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:45:22,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:22,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1531515743, now seen corresponding path program 1 times [2023-11-30 04:45:22,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:22,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193398737] [2023-11-30 04:45:22,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:22,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:22,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:45:22,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:22,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193398737] [2023-11-30 04:45:22,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193398737] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:22,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:22,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:22,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004288612] [2023-11-30 04:45:22,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:22,754 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:22,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:22,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:22,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:22,755 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 144 [2023-11-30 04:45:22,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 89 transitions, 269 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:22,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 144 [2023-11-30 04:45:22,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:22,830 INFO L124 PetriNetUnfolderBase]: 112/365 cut-off events. [2023-11-30 04:45:22,830 INFO L125 PetriNetUnfolderBase]: For 266/306 co-relation queries the response was YES. [2023-11-30 04:45:22,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 365 events. 112/365 cut-off events. For 266/306 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1695 event pairs, 54 based on Foata normal form. 3/358 useless extension candidates. Maximal degree in co-relation 886. Up to 186 conditions per place. [2023-11-30 04:45:22,834 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 21 selfloop transitions, 1 changer transitions 0/90 dead transitions. [2023-11-30 04:45:22,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 90 transitions, 321 flow [2023-11-30 04:45:22,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:22,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:22,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-11-30 04:45:22,836 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8171296296296297 [2023-11-30 04:45:22,836 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-11-30 04:45:22,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-11-30 04:45:22,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:22,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-11-30 04:45:22,837 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:45:22,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,838 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,839 INFO L307 CegarLoopForPetriNet]: 101 programPoint places, 3 predicate places. [2023-11-30 04:45:22,839 INFO L500 AbstractCegarLoop]: Abstraction has has 104 places, 90 transitions, 321 flow [2023-11-30 04:45:22,840 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,840 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:22,840 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] [2023-11-30 04:45:22,840 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:45:22,840 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:45:22,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:22,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1531515742, now seen corresponding path program 1 times [2023-11-30 04:45:22,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:22,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398565522] [2023-11-30 04:45:22,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:22,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:22,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:45:22,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:22,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398565522] [2023-11-30 04:45:22,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398565522] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:22,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:22,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:22,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332705652] [2023-11-30 04:45:22,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:22,900 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:22,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:22,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:22,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:22,905 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 144 [2023-11-30 04:45:22,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 90 transitions, 321 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:22,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 144 [2023-11-30 04:45:22,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:22,986 INFO L124 PetriNetUnfolderBase]: 110/360 cut-off events. [2023-11-30 04:45:22,986 INFO L125 PetriNetUnfolderBase]: For 471/531 co-relation queries the response was YES. [2023-11-30 04:45:22,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1126 conditions, 360 events. 110/360 cut-off events. For 471/531 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1643 event pairs, 54 based on Foata normal form. 3/353 useless extension candidates. Maximal degree in co-relation 1047. Up to 181 conditions per place. [2023-11-30 04:45:22,988 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 21 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2023-11-30 04:45:22,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 89 transitions, 359 flow [2023-11-30 04:45:22,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:22,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:22,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2023-11-30 04:45:22,990 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7893518518518519 [2023-11-30 04:45:22,990 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2023-11-30 04:45:22,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2023-11-30 04:45:22,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:22,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2023-11-30 04:45:22,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,993 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,994 INFO L307 CegarLoopForPetriNet]: 101 programPoint places, 4 predicate places. [2023-11-30 04:45:22,994 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 89 transitions, 359 flow [2023-11-30 04:45:22,995 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,995 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:22,995 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] [2023-11-30 04:45:22,995 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:45:22,995 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:45:22,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:22,996 INFO L85 PathProgramCache]: Analyzing trace with hash -533656083, now seen corresponding path program 1 times [2023-11-30 04:45:22,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:22,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011709551] [2023-11-30 04:45:22,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:22,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:23,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:45:23,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:23,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011709551] [2023-11-30 04:45:23,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011709551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:23,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:23,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:23,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210299454] [2023-11-30 04:45:23,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:23,054 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:23,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:23,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:23,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:23,055 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 144 [2023-11-30 04:45:23,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 89 transitions, 359 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:23,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:23,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 144 [2023-11-30 04:45:23,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:23,137 INFO L124 PetriNetUnfolderBase]: 103/368 cut-off events. [2023-11-30 04:45:23,137 INFO L125 PetriNetUnfolderBase]: For 674/754 co-relation queries the response was YES. [2023-11-30 04:45:23,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1273 conditions, 368 events. 103/368 cut-off events. For 674/754 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1712 event pairs, 48 based on Foata normal form. 6/367 useless extension candidates. Maximal degree in co-relation 1186. Up to 174 conditions per place. [2023-11-30 04:45:23,140 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 24 selfloop transitions, 1 changer transitions 0/91 dead transitions. [2023-11-30 04:45:23,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 91 transitions, 433 flow [2023-11-30 04:45:23,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:23,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:23,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2023-11-30 04:45:23,142 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7916666666666666 [2023-11-30 04:45:23,142 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 342 transitions. [2023-11-30 04:45:23,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions. [2023-11-30 04:45:23,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:23,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions. [2023-11-30 04:45:23,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:45:23,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:23,144 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:23,146 INFO L307 CegarLoopForPetriNet]: 101 programPoint places, 5 predicate places. [2023-11-30 04:45:23,146 INFO L500 AbstractCegarLoop]: Abstraction has has 106 places, 91 transitions, 433 flow [2023-11-30 04:45:23,147 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:23,147 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:23,147 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] [2023-11-30 04:45:23,147 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:45:23,148 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:45:23,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:23,151 INFO L85 PathProgramCache]: Analyzing trace with hash -533656082, now seen corresponding path program 1 times [2023-11-30 04:45:23,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:23,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070717834] [2023-11-30 04:45:23,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:23,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:23,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:45:23,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:23,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070717834] [2023-11-30 04:45:23,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070717834] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:23,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:23,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:23,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817398560] [2023-11-30 04:45:23,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:23,266 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:23,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:23,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:23,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:23,267 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 144 [2023-11-30 04:45:23,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 91 transitions, 433 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:23,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:23,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 144 [2023-11-30 04:45:23,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:23,341 INFO L124 PetriNetUnfolderBase]: 96/346 cut-off events. [2023-11-30 04:45:23,341 INFO L125 PetriNetUnfolderBase]: For 948/1048 co-relation queries the response was YES. [2023-11-30 04:45:23,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1363 conditions, 346 events. 96/346 cut-off events. For 948/1048 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1560 event pairs, 45 based on Foata normal form. 12/351 useless extension candidates. Maximal degree in co-relation 1269. Up to 161 conditions per place. [2023-11-30 04:45:23,344 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 22 selfloop transitions, 1 changer transitions 0/90 dead transitions. [2023-11-30 04:45:23,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 90 transitions, 471 flow [2023-11-30 04:45:23,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:23,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:23,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2023-11-30 04:45:23,345 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8148148148148148 [2023-11-30 04:45:23,345 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2023-11-30 04:45:23,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2023-11-30 04:45:23,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:23,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2023-11-30 04:45:23,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:23,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:23,347 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:23,349 INFO L307 CegarLoopForPetriNet]: 101 programPoint places, 6 predicate places. [2023-11-30 04:45:23,349 INFO L500 AbstractCegarLoop]: Abstraction has has 107 places, 90 transitions, 471 flow [2023-11-30 04:45:23,350 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:23,350 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:23,350 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] [2023-11-30 04:45:23,350 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:45:23,350 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:45:23,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:23,350 INFO L85 PathProgramCache]: Analyzing trace with hash -931538266, now seen corresponding path program 1 times [2023-11-30 04:45:23,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:23,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355728588] [2023-11-30 04:45:23,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:23,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:23,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:45:23,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:23,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355728588] [2023-11-30 04:45:23,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355728588] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:23,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:23,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:23,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636776564] [2023-11-30 04:45:23,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:23,438 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:23,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:23,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:23,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:23,438 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 144 [2023-11-30 04:45:23,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 90 transitions, 471 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:23,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:23,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 144 [2023-11-30 04:45:23,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:23,496 INFO L124 PetriNetUnfolderBase]: 76/326 cut-off events. [2023-11-30 04:45:23,496 INFO L125 PetriNetUnfolderBase]: For 1074/1188 co-relation queries the response was YES. [2023-11-30 04:45:23,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1332 conditions, 326 events. 76/326 cut-off events. For 1074/1188 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1362 event pairs, 6 based on Foata normal form. 12/337 useless extension candidates. Maximal degree in co-relation 1231. Up to 141 conditions per place. [2023-11-30 04:45:23,498 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 26 selfloop transitions, 1 changer transitions 0/93 dead transitions. [2023-11-30 04:45:23,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 93 transitions, 573 flow [2023-11-30 04:45:23,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:23,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:23,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-11-30 04:45:23,499 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8171296296296297 [2023-11-30 04:45:23,499 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-11-30 04:45:23,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-11-30 04:45:23,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:23,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-11-30 04:45:23,500 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:45:23,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:23,501 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:23,502 INFO L307 CegarLoopForPetriNet]: 101 programPoint places, 7 predicate places. [2023-11-30 04:45:23,502 INFO L500 AbstractCegarLoop]: Abstraction has has 108 places, 93 transitions, 573 flow [2023-11-30 04:45:23,502 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:23,502 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:23,502 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] [2023-11-30 04:45:23,502 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:45:23,502 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:45:23,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:23,503 INFO L85 PathProgramCache]: Analyzing trace with hash -931538267, now seen corresponding path program 1 times [2023-11-30 04:45:23,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:23,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299500820] [2023-11-30 04:45:23,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:23,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:23,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:45:23,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:23,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299500820] [2023-11-30 04:45:23,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299500820] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:23,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:23,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:23,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457834647] [2023-11-30 04:45:23,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:23,546 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:23,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:23,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:23,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:23,547 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 144 [2023-11-30 04:45:23,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 93 transitions, 573 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:23,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:23,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 144 [2023-11-30 04:45:23,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:23,599 INFO L124 PetriNetUnfolderBase]: 56/270 cut-off events. [2023-11-30 04:45:23,599 INFO L125 PetriNetUnfolderBase]: For 1358/1498 co-relation queries the response was YES. [2023-11-30 04:45:23,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1202 conditions, 270 events. 56/270 cut-off events. For 1358/1498 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1070 event pairs, 0 based on Foata normal form. 24/293 useless extension candidates. Maximal degree in co-relation 1093. Up to 109 conditions per place. [2023-11-30 04:45:23,600 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 0 selfloop transitions, 0 changer transitions 92/92 dead transitions. [2023-11-30 04:45:23,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 92 transitions, 617 flow [2023-11-30 04:45:23,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:23,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:23,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2023-11-30 04:45:23,602 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7893518518518519 [2023-11-30 04:45:23,603 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2023-11-30 04:45:23,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2023-11-30 04:45:23,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:23,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2023-11-30 04:45:23,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:23,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:23,606 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:23,607 INFO L307 CegarLoopForPetriNet]: 101 programPoint places, 8 predicate places. [2023-11-30 04:45:23,608 INFO L500 AbstractCegarLoop]: Abstraction has has 109 places, 92 transitions, 617 flow [2023-11-30 04:45:23,608 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:23,614 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i_BEv2_AllErrorsAtOnce [2023-11-30 04:45:23,639 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 12 remaining) [2023-11-30 04:45:23,639 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2023-11-30 04:45:23,641 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-11-30 04:45:23,641 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-11-30 04:45:23,641 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-11-30 04:45:23,641 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-11-30 04:45:23,641 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-11-30 04:45:23,642 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-11-30 04:45:23,642 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-11-30 04:45:23,642 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-11-30 04:45:23,642 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-11-30 04:45:23,642 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 12 remaining) [2023-11-30 04:45:23,642 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:45:23,642 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:23,644 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:45:23,645 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:45:23,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:45:23 BasicIcfg [2023-11-30 04:45:23,649 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:45:23,649 INFO L158 Benchmark]: Toolchain (without parser) took 3042.26ms. Allocated memory was 318.8MB in the beginning and 425.7MB in the end (delta: 107.0MB). Free memory was 256.4MB in the beginning and 250.9MB in the end (delta: 5.5MB). Peak memory consumption was 114.4MB. Max. memory is 16.0GB. [2023-11-30 04:45:23,649 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 318.8MB. Free memory was 270.1MB in the beginning and 270.0MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:45:23,650 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.28ms. Allocated memory was 318.8MB in the beginning and 425.7MB in the end (delta: 107.0MB). Free memory was 256.4MB in the beginning and 390.2MB in the end (delta: -133.8MB). Peak memory consumption was 31.9MB. Max. memory is 16.0GB. [2023-11-30 04:45:23,650 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.81ms. Allocated memory is still 425.7MB. Free memory was 390.2MB in the beginning and 387.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:45:23,650 INFO L158 Benchmark]: Boogie Preprocessor took 48.47ms. Allocated memory is still 425.7MB. Free memory was 387.9MB in the beginning and 385.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:45:23,650 INFO L158 Benchmark]: RCFGBuilder took 563.02ms. Allocated memory is still 425.7MB. Free memory was 385.8MB in the beginning and 344.6MB in the end (delta: 41.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. [2023-11-30 04:45:23,650 INFO L158 Benchmark]: TraceAbstraction took 1930.65ms. Allocated memory is still 425.7MB. Free memory was 343.9MB in the beginning and 250.9MB in the end (delta: 93.0MB). Peak memory consumption was 93.0MB. Max. memory is 16.0GB. [2023-11-30 04:45:23,651 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 318.8MB. Free memory was 270.1MB in the beginning and 270.0MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 437.28ms. Allocated memory was 318.8MB in the beginning and 425.7MB in the end (delta: 107.0MB). Free memory was 256.4MB in the beginning and 390.2MB in the end (delta: -133.8MB). Peak memory consumption was 31.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 58.81ms. Allocated memory is still 425.7MB. Free memory was 390.2MB in the beginning and 387.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 48.47ms. Allocated memory is still 425.7MB. Free memory was 387.9MB in the beginning and 385.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 563.02ms. Allocated memory is still 425.7MB. Free memory was 385.8MB in the beginning and 344.6MB in the end (delta: 41.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. * TraceAbstraction took 1930.65ms. Allocated memory is still 425.7MB. Free memory was 343.9MB in the beginning and 250.9MB in the end (delta: 93.0MB). Peak memory consumption was 93.0MB. 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, 179 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.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 193 IncrementalHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 60 mSDtfsCounter, 193 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=617occurred 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, 420 NumberOfCodeBlocks, 420 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 412 ConstructedInterpolants, 0 QuantifiedInterpolants, 556 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 04:45:23,666 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...