/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:45:18,911 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:45:18,961 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,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:45:18,977 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:45:18,977 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:45:18,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:45:18,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:45:18,978 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:45:18,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:45:18,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:45:18,979 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:45:18,979 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:45:18,979 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:45:18,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:45:18,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:45:18,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:45:18,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:45:18,980 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:45:18,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:45:18,981 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:45:18,981 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:45:18,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:45:18,981 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:45:18,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:45:18,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:45:18,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:45:18,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:45:18,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:45:18,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:45:18,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:45:18,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:45:18,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:45:18,994 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,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:45:19,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:45:19,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:45:19,183 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:45:19,184 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:45:19,184 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i [2023-11-30 04:45:20,183 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:45:20,352 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:45:20,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i [2023-11-30 04:45:20,363 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c14def192/16837d1301c64406a6e5617ebc84f038/FLAG40de4b4f8 [2023-11-30 04:45:20,374 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c14def192/16837d1301c64406a6e5617ebc84f038 [2023-11-30 04:45:20,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:45:20,377 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:45:20,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:45:20,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:45:20,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:45:20,381 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,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d83940e 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,382 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,418 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:45:20,708 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:45:20,719 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:45:20,766 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:45:20,795 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:45:20,795 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:45:20,800 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:45:20,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:20 WrapperNode [2023-11-30 04:45:20,802 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:45:20,803 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:45:20,803 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:45:20,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:45:20,807 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:20" (1/1) ... [2023-11-30 04:45:20,835 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:20" (1/1) ... [2023-11-30 04:45:20,862 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 148 [2023-11-30 04:45:20,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:45:20,863 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:45:20,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:45:20,864 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:45:20,870 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:20" (1/1) ... [2023-11-30 04:45:20,870 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:20" (1/1) ... [2023-11-30 04:45:20,881 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:20" (1/1) ... [2023-11-30 04:45:20,881 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:20" (1/1) ... [2023-11-30 04:45:20,892 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:20" (1/1) ... [2023-11-30 04:45:20,893 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:20" (1/1) ... [2023-11-30 04:45:20,894 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:20" (1/1) ... [2023-11-30 04:45:20,895 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:20" (1/1) ... [2023-11-30 04:45:20,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:45:20,898 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:45:20,898 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:45:20,898 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:45:20,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:20" (1/1) ... [2023-11-30 04:45:20,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:45:20,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:45:20,932 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:20,953 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:20,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:45:20,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:45:20,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:45:20,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:45:20,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:45:20,959 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-30 04:45:20,959 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-30 04:45:20,959 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-30 04:45:20,959 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-30 04:45:20,959 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-30 04:45:20,960 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-30 04:45:20,960 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-30 04:45:20,960 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-30 04:45:20,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:45:20,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:45:20,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:45:20,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:45:20,962 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,062 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:45:21,064 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:45:21,331 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:45:21,415 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:45:21,416 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:45:21,417 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,417 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:45:21,418 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:45:21,418 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:45:21,420 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:45:21,421 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,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2779f8c9 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,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:20" (2/3) ... [2023-11-30 04:45:21,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2779f8c9 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,421 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,422 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_power.oepc_pso.oepc_rmo.oepc.i [2023-11-30 04:45:21,434 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:45:21,434 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-30 04:45:21,434 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:45:21,471 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:45:21,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 143 transitions, 302 flow [2023-11-30 04:45:21,551 INFO L124 PetriNetUnfolderBase]: 3/139 cut-off events. [2023-11-30 04:45:21,551 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:45:21,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 3/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-11-30 04:45:21,557 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 143 transitions, 302 flow [2023-11-30 04:45:21,560 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 90 transitions, 189 flow [2023-11-30 04:45:21,566 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:45:21,570 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;@4280b3fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:45:21,570 INFO L363 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-11-30 04:45:21,577 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:45:21,577 INFO L124 PetriNetUnfolderBase]: 0/41 cut-off events. [2023-11-30 04:45:21,577 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:45:21,577 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:21,577 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:21,578 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,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:21,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1424306856, now seen corresponding path program 1 times [2023-11-30 04:45:21,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:21,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174822096] [2023-11-30 04:45:21,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:21,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:21,832 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:21,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:21,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174822096] [2023-11-30 04:45:21,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174822096] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:21,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:21,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:21,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761219052] [2023-11-30 04:45:21,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:21,842 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:21,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:21,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:21,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:21,863 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 143 [2023-11-30 04:45:21,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 90 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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:21,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:21,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 143 [2023-11-30 04:45:21,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:21,999 INFO L124 PetriNetUnfolderBase]: 85/347 cut-off events. [2023-11-30 04:45:21,999 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 04:45:22,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 347 events. 85/347 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1604 event pairs, 85 based on Foata normal form. 0/336 useless extension candidates. Maximal degree in co-relation 478. Up to 160 conditions per place. [2023-11-30 04:45:22,005 INFO L140 encePairwiseOnDemand]: 141/143 looper letters, 21 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2023-11-30 04:45:22,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 89 transitions, 231 flow [2023-11-30 04:45:22,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:22,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:22,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2023-11-30 04:45:22,019 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7878787878787878 [2023-11-30 04:45:22,020 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 338 transitions. [2023-11-30 04:45:22,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 338 transitions. [2023-11-30 04:45:22,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:22,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 338 transitions. [2023-11-30 04:45:22,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,033 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,037 INFO L307 CegarLoopForPetriNet]: 100 programPoint places, 1 predicate places. [2023-11-30 04:45:22,037 INFO L500 AbstractCegarLoop]: Abstraction has has 101 places, 89 transitions, 231 flow [2023-11-30 04:45:22,038 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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,038 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:22,038 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:22,039 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:45:22,039 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,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:22,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1424306857, now seen corresponding path program 1 times [2023-11-30 04:45:22,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:22,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053276653] [2023-11-30 04:45:22,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:22,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:22,150 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,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:22,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053276653] [2023-11-30 04:45:22,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053276653] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:22,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:22,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:22,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350311047] [2023-11-30 04:45:22,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:22,152 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:22,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:22,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:22,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:22,154 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 143 [2023-11-30 04:45:22,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 89 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:22,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 143 [2023-11-30 04:45:22,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:22,246 INFO L124 PetriNetUnfolderBase]: 114/381 cut-off events. [2023-11-30 04:45:22,246 INFO L125 PetriNetUnfolderBase]: For 95/97 co-relation queries the response was YES. [2023-11-30 04:45:22,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 790 conditions, 381 events. 114/381 cut-off events. For 95/97 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1804 event pairs, 114 based on Foata normal form. 0/378 useless extension candidates. Maximal degree in co-relation 727. Up to 188 conditions per place. [2023-11-30 04:45:22,249 INFO L140 encePairwiseOnDemand]: 141/143 looper letters, 19 selfloop transitions, 1 changer transitions 0/88 dead transitions. [2023-11-30 04:45:22,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 88 transitions, 267 flow [2023-11-30 04:45:22,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:22,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-11-30 04:45:22,251 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8111888111888111 [2023-11-30 04:45:22,251 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-11-30 04:45:22,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-11-30 04:45:22,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:22,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-11-30 04:45:22,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,253 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,254 INFO L307 CegarLoopForPetriNet]: 100 programPoint places, 2 predicate places. [2023-11-30 04:45:22,254 INFO L500 AbstractCegarLoop]: Abstraction has has 102 places, 88 transitions, 267 flow [2023-11-30 04:45:22,254 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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,254 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:22,254 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:22,254 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:45:22,255 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,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:22,255 INFO L85 PathProgramCache]: Analyzing trace with hash -692847503, now seen corresponding path program 1 times [2023-11-30 04:45:22,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:22,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423056566] [2023-11-30 04:45:22,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:22,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:22,310 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,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:22,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423056566] [2023-11-30 04:45:22,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423056566] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:22,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:22,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:22,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011877482] [2023-11-30 04:45:22,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:22,312 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:22,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:22,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:22,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:22,313 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 143 [2023-11-30 04:45:22,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 88 transitions, 267 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,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:22,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 143 [2023-11-30 04:45:22,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:22,374 INFO L124 PetriNetUnfolderBase]: 112/364 cut-off events. [2023-11-30 04:45:22,374 INFO L125 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2023-11-30 04:45:22,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 364 events. 112/364 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1671 event pairs, 54 based on Foata normal form. 3/367 useless extension candidates. Maximal degree in co-relation 886. Up to 186 conditions per place. [2023-11-30 04:45:22,377 INFO L140 encePairwiseOnDemand]: 141/143 looper letters, 21 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2023-11-30 04:45:22,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 89 transitions, 319 flow [2023-11-30 04:45:22,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:22,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:22,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2023-11-30 04:45:22,378 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8158508158508159 [2023-11-30 04:45:22,378 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2023-11-30 04:45:22,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2023-11-30 04:45:22,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:22,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2023-11-30 04:45:22,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,380 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,381 INFO L307 CegarLoopForPetriNet]: 100 programPoint places, 3 predicate places. [2023-11-30 04:45:22,381 INFO L500 AbstractCegarLoop]: Abstraction has has 103 places, 89 transitions, 319 flow [2023-11-30 04:45:22,381 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,381 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:22,381 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:22,381 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:45:22,381 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,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:22,382 INFO L85 PathProgramCache]: Analyzing trace with hash -692847504, now seen corresponding path program 1 times [2023-11-30 04:45:22,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:22,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366226333] [2023-11-30 04:45:22,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:22,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:22,414 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,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:22,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366226333] [2023-11-30 04:45:22,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366226333] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:22,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:22,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:22,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358302650] [2023-11-30 04:45:22,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:22,415 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:22,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:22,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:22,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:22,416 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 143 [2023-11-30 04:45:22,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 89 transitions, 319 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,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:22,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 143 [2023-11-30 04:45:22,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:22,475 INFO L124 PetriNetUnfolderBase]: 110/359 cut-off events. [2023-11-30 04:45:22,475 INFO L125 PetriNetUnfolderBase]: For 411/411 co-relation queries the response was YES. [2023-11-30 04:45:22,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 359 events. 110/359 cut-off events. For 411/411 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1638 event pairs, 54 based on Foata normal form. 3/362 useless extension candidates. Maximal degree in co-relation 1047. Up to 181 conditions per place. [2023-11-30 04:45:22,479 INFO L140 encePairwiseOnDemand]: 141/143 looper letters, 21 selfloop transitions, 1 changer transitions 0/88 dead transitions. [2023-11-30 04:45:22,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 88 transitions, 357 flow [2023-11-30 04:45:22,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:22,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:22,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2023-11-30 04:45:22,480 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7878787878787878 [2023-11-30 04:45:22,480 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 338 transitions. [2023-11-30 04:45:22,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 338 transitions. [2023-11-30 04:45:22,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:22,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 338 transitions. [2023-11-30 04:45:22,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,483 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,484 INFO L307 CegarLoopForPetriNet]: 100 programPoint places, 4 predicate places. [2023-11-30 04:45:22,485 INFO L500 AbstractCegarLoop]: Abstraction has has 104 places, 88 transitions, 357 flow [2023-11-30 04:45:22,485 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,485 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:22,485 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:22,486 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:45:22,486 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,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:22,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1799111403, now seen corresponding path program 1 times [2023-11-30 04:45:22,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:22,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154513685] [2023-11-30 04:45:22,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:22,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:22,563 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,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:22,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154513685] [2023-11-30 04:45:22,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154513685] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:22,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:22,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:22,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170536723] [2023-11-30 04:45:22,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:22,565 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:22,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:22,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:22,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:22,568 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 143 [2023-11-30 04:45:22,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 88 transitions, 357 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,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:22,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 143 [2023-11-30 04:45:22,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:22,665 INFO L124 PetriNetUnfolderBase]: 103/346 cut-off events. [2023-11-30 04:45:22,665 INFO L125 PetriNetUnfolderBase]: For 625/625 co-relation queries the response was YES. [2023-11-30 04:45:22,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 346 events. 103/346 cut-off events. For 625/625 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1556 event pairs, 18 based on Foata normal form. 6/352 useless extension candidates. Maximal degree in co-relation 1165. Up to 174 conditions per place. [2023-11-30 04:45:22,667 INFO L140 encePairwiseOnDemand]: 141/143 looper letters, 24 selfloop transitions, 1 changer transitions 0/90 dead transitions. [2023-11-30 04:45:22,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 90 transitions, 431 flow [2023-11-30 04:45:22,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:22,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:22,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2023-11-30 04:45:22,669 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7902097902097902 [2023-11-30 04:45:22,669 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2023-11-30 04:45:22,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2023-11-30 04:45:22,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:22,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2023-11-30 04:45:22,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,671 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,673 INFO L307 CegarLoopForPetriNet]: 100 programPoint places, 5 predicate places. [2023-11-30 04:45:22,673 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 90 transitions, 431 flow [2023-11-30 04:45:22,673 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,673 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:22,674 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:22,674 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:45:22,675 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:22,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:22,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1799111404, now seen corresponding path program 1 times [2023-11-30 04:45:22,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:22,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333220488] [2023-11-30 04:45:22,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:22,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:22,769 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,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:22,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333220488] [2023-11-30 04:45:22,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333220488] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:22,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:22,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:22,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646430067] [2023-11-30 04:45:22,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:22,773 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:22,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:22,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:22,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:22,774 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 143 [2023-11-30 04:45:22,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 90 transitions, 431 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,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:22,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 143 [2023-11-30 04:45:22,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:22,841 INFO L124 PetriNetUnfolderBase]: 96/333 cut-off events. [2023-11-30 04:45:22,841 INFO L125 PetriNetUnfolderBase]: For 858/858 co-relation queries the response was YES. [2023-11-30 04:45:22,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1350 conditions, 333 events. 96/333 cut-off events. For 858/858 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1437 event pairs, 18 based on Foata normal form. 6/339 useless extension candidates. Maximal degree in co-relation 1257. Up to 161 conditions per place. [2023-11-30 04:45:22,844 INFO L140 encePairwiseOnDemand]: 141/143 looper letters, 22 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2023-11-30 04:45:22,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 89 transitions, 469 flow [2023-11-30 04:45:22,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:22,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:22,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2023-11-30 04:45:22,845 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8135198135198135 [2023-11-30 04:45:22,845 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2023-11-30 04:45:22,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2023-11-30 04:45:22,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:22,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2023-11-30 04:45:22,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,847 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,849 INFO L307 CegarLoopForPetriNet]: 100 programPoint places, 6 predicate places. [2023-11-30 04:45:22,849 INFO L500 AbstractCegarLoop]: Abstraction has has 106 places, 89 transitions, 469 flow [2023-11-30 04:45:22,849 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,849 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:22,849 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:22,849 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:45:22,849 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:45:22,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:22,850 INFO L85 PathProgramCache]: Analyzing trace with hash -474218203, now seen corresponding path program 1 times [2023-11-30 04:45:22,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:22,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017239519] [2023-11-30 04:45:22,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:22,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:22,893 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,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:22,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017239519] [2023-11-30 04:45:22,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017239519] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:22,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:22,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:22,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511184535] [2023-11-30 04:45:22,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:22,896 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:22,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:22,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:22,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:22,898 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 143 [2023-11-30 04:45:22,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 89 transitions, 469 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:22,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:22,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 143 [2023-11-30 04:45:22,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:22,961 INFO L124 PetriNetUnfolderBase]: 76/301 cut-off events. [2023-11-30 04:45:22,961 INFO L125 PetriNetUnfolderBase]: For 978/978 co-relation queries the response was YES. [2023-11-30 04:45:22,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1308 conditions, 301 events. 76/301 cut-off events. For 978/978 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1256 event pairs, 0 based on Foata normal form. 12/313 useless extension candidates. Maximal degree in co-relation 1207. Up to 141 conditions per place. [2023-11-30 04:45:22,963 INFO L140 encePairwiseOnDemand]: 141/143 looper letters, 27 selfloop transitions, 1 changer transitions 0/92 dead transitions. [2023-11-30 04:45:22,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 92 transitions, 573 flow [2023-11-30 04:45:22,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:22,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:22,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2023-11-30 04:45:22,965 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7902097902097902 [2023-11-30 04:45:22,965 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2023-11-30 04:45:22,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2023-11-30 04:45:22,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:22,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2023-11-30 04:45:22,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,967 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:22,968 INFO L307 CegarLoopForPetriNet]: 100 programPoint places, 7 predicate places. [2023-11-30 04:45:22,968 INFO L500 AbstractCegarLoop]: Abstraction has has 107 places, 92 transitions, 573 flow [2023-11-30 04:45:22,968 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:22,968 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:22,969 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:22,969 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:45:22,969 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:45:22,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:22,969 INFO L85 PathProgramCache]: Analyzing trace with hash -474218202, now seen corresponding path program 1 times [2023-11-30 04:45:22,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:22,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477859738] [2023-11-30 04:45:22,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:22,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:23,041 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,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:23,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477859738] [2023-11-30 04:45:23,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477859738] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:23,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:23,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:23,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879886151] [2023-11-30 04:45:23,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:23,043 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:23,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:23,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:23,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:23,044 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 143 [2023-11-30 04:45:23,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 92 transitions, 573 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,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:23,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 143 [2023-11-30 04:45:23,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:23,098 INFO L124 PetriNetUnfolderBase]: 56/269 cut-off events. [2023-11-30 04:45:23,098 INFO L125 PetriNetUnfolderBase]: For 1072/1072 co-relation queries the response was YES. [2023-11-30 04:45:23,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1201 conditions, 269 events. 56/269 cut-off events. For 1072/1072 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1067 event pairs, 0 based on Foata normal form. 12/281 useless extension candidates. Maximal degree in co-relation 1093. Up to 109 conditions per place. [2023-11-30 04:45:23,100 INFO L140 encePairwiseOnDemand]: 141/143 looper letters, 0 selfloop transitions, 0 changer transitions 91/91 dead transitions. [2023-11-30 04:45:23,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 91 transitions, 615 flow [2023-11-30 04:45:23,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:23,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:23,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2023-11-30 04:45:23,102 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8135198135198135 [2023-11-30 04:45:23,103 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2023-11-30 04:45:23,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2023-11-30 04:45:23,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:23,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2023-11-30 04:45:23,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:23,106 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:23,107 INFO L307 CegarLoopForPetriNet]: 100 programPoint places, 8 predicate places. [2023-11-30 04:45:23,107 INFO L500 AbstractCegarLoop]: Abstraction has has 108 places, 91 transitions, 615 flow [2023-11-30 04:45:23,108 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,118 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mix030_power.oepc_pso.oepc_rmo.oepc.i_BEv2_AllErrorsAtOnce [2023-11-30 04:45:23,150 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 12 remaining) [2023-11-30 04:45:23,151 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2023-11-30 04:45:23,153 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-11-30 04:45:23,153 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-11-30 04:45:23,153 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-11-30 04:45:23,153 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-11-30 04:45:23,156 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-11-30 04:45:23,156 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-11-30 04:45:23,156 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-11-30 04:45:23,156 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-11-30 04:45:23,156 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-11-30 04:45:23,156 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 12 remaining) [2023-11-30 04:45:23,157 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:45:23,157 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:23,160 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:45:23,160 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:45:23,166 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,166 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:45:23,166 INFO L158 Benchmark]: Toolchain (without parser) took 2789.24ms. Allocated memory is still 507.5MB. Free memory was 459.8MB in the beginning and 291.8MB in the end (delta: 168.0MB). Peak memory consumption was 169.4MB. Max. memory is 16.0GB. [2023-11-30 04:45:23,166 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 337.6MB. Free memory is still 281.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:45:23,166 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.36ms. Allocated memory is still 507.5MB. Free memory was 459.5MB in the beginning and 435.3MB in the end (delta: 24.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-11-30 04:45:23,166 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.27ms. Allocated memory is still 507.5MB. Free memory was 435.3MB in the beginning and 432.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 04:45:23,167 INFO L158 Benchmark]: Boogie Preprocessor took 34.14ms. Allocated memory is still 507.5MB. Free memory was 432.6MB in the beginning and 430.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:45:23,167 INFO L158 Benchmark]: RCFGBuilder took 519.11ms. Allocated memory is still 507.5MB. Free memory was 430.5MB in the beginning and 453.3MB in the end (delta: -22.8MB). Peak memory consumption was 34.2MB. Max. memory is 16.0GB. [2023-11-30 04:45:23,167 INFO L158 Benchmark]: TraceAbstraction took 1747.34ms. Allocated memory is still 507.5MB. Free memory was 452.3MB in the beginning and 291.8MB in the end (delta: 160.4MB). Peak memory consumption was 160.4MB. Max. memory is 16.0GB. [2023-11-30 04:45:23,168 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 337.6MB. Free memory is still 281.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 424.36ms. Allocated memory is still 507.5MB. Free memory was 459.5MB in the beginning and 435.3MB in the end (delta: 24.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 60.27ms. Allocated memory is still 507.5MB. Free memory was 435.3MB in the beginning and 432.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 34.14ms. Allocated memory is still 507.5MB. Free memory was 432.6MB in the beginning and 430.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 519.11ms. Allocated memory is still 507.5MB. Free memory was 430.5MB in the beginning and 453.3MB in the end (delta: -22.8MB). Peak memory consumption was 34.2MB. Max. memory is 16.0GB. * TraceAbstraction took 1747.34ms. Allocated memory is still 507.5MB. Free memory was 452.3MB in the beginning and 291.8MB in the end (delta: 160.4MB). Peak memory consumption was 160.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 178 locations, 12 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.7s, 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, 196 IncrementalHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 60 mSDtfsCounter, 196 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=615occurred 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.5s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 404 ConstructedInterpolants, 0 QuantifiedInterpolants, 548 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 04:45:23,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...