/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -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/goblint-regression/09-regions_19-nested_nr.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:12:26,882 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:12:26,948 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-12-05 21:12:26,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:12:26,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:12:26,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:12:26,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:12:26,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:12:26,976 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:12:26,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:12:26,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:12:26,979 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:12:26,979 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:12:26,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:12:26,980 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:12:26,981 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:12:26,981 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:12:26,981 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:12:26,981 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:12:26,981 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:12:26,981 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:12:26,982 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:12:26,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:12:26,982 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:12:26,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:12:26,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:12:26,984 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:12:26,984 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:12:26,984 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:12:26,984 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:12:26,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:12:26,985 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:12:26,985 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:12:26,985 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-12-05 21:12:27,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:12:27,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:12:27,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:12:27,188 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:12:27,188 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:12:27,189 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_19-nested_nr.i [2023-12-05 21:12:28,317 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:12:28,579 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:12:28,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_19-nested_nr.i [2023-12-05 21:12:28,597 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26e970e5d/fdd853e2b7de48faa15b76158502bb84/FLAGc9b8783a3 [2023-12-05 21:12:28,610 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26e970e5d/fdd853e2b7de48faa15b76158502bb84 [2023-12-05 21:12:28,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:12:28,613 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:12:28,614 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:12:28,614 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:12:28,617 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:12:28,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:12:28" (1/1) ... [2023-12-05 21:12:28,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@586905ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:28, skipping insertion in model container [2023-12-05 21:12:28,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:12:28" (1/1) ... [2023-12-05 21:12:28,661 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:12:29,043 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:12:29,053 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:12:29,094 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:12:29,163 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:12:29,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:29 WrapperNode [2023-12-05 21:12:29,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:12:29,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:12:29,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:12:29,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:12:29,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:29" (1/1) ... [2023-12-05 21:12:29,191 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:29" (1/1) ... [2023-12-05 21:12:29,211 INFO L138 Inliner]: procedures = 371, calls = 31, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 131 [2023-12-05 21:12:29,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:12:29,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:12:29,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:12:29,212 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:12:29,218 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:29" (1/1) ... [2023-12-05 21:12:29,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:29" (1/1) ... [2023-12-05 21:12:29,221 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:29" (1/1) ... [2023-12-05 21:12:29,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:29" (1/1) ... [2023-12-05 21:12:29,230 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:29" (1/1) ... [2023-12-05 21:12:29,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:29" (1/1) ... [2023-12-05 21:12:29,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:29" (1/1) ... [2023-12-05 21:12:29,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:29" (1/1) ... [2023-12-05 21:12:29,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:12:29,245 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:12:29,245 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:12:29,245 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:12:29,246 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:29" (1/1) ... [2023-12-05 21:12:29,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:12:29,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:12:29,286 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-12-05 21:12:29,295 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-12-05 21:12:29,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:12:29,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-05 21:12:29,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:12:29,313 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:12:29,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:12:29,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:12:29,313 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:12:29,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-05 21:12:29,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:12:29,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-05 21:12:29,313 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-05 21:12:29,314 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-05 21:12:29,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:12:29,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:12:29,315 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:12:29,418 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:12:29,420 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:12:29,712 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:12:29,734 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:12:29,734 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-05 21:12:29,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:12:29 BoogieIcfgContainer [2023-12-05 21:12:29,736 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:12:29,738 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:12:29,738 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:12:29,741 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:12:29,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:12:28" (1/3) ... [2023-12-05 21:12:29,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533396cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:12:29, skipping insertion in model container [2023-12-05 21:12:29,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:29" (2/3) ... [2023-12-05 21:12:29,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533396cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:12:29, skipping insertion in model container [2023-12-05 21:12:29,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:12:29" (3/3) ... [2023-12-05 21:12:29,744 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_19-nested_nr.i [2023-12-05 21:12:29,757 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:12:29,757 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2023-12-05 21:12:29,757 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:12:29,816 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:12:29,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 188 places, 190 transitions, 384 flow [2023-12-05 21:12:29,901 INFO L124 PetriNetUnfolderBase]: 6/189 cut-off events. [2023-12-05 21:12:29,901 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:12:29,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 189 events. 6/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 401 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2023-12-05 21:12:29,907 INFO L82 GeneralOperation]: Start removeDead. Operand has 188 places, 190 transitions, 384 flow [2023-12-05 21:12:29,915 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 189 transitions, 381 flow [2023-12-05 21:12:29,930 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:12:29,937 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;@5e00dc24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:12:29,938 INFO L363 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2023-12-05 21:12:29,953 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:12:29,953 INFO L124 PetriNetUnfolderBase]: 4/43 cut-off events. [2023-12-05 21:12:29,953 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:12:29,953 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:29,954 INFO L233 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] [2023-12-05 21:12:29,954 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:12:29,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:29,958 INFO L85 PathProgramCache]: Analyzing trace with hash 982717388, now seen corresponding path program 1 times [2023-12-05 21:12:29,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:29,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347379790] [2023-12-05 21:12:29,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:29,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:30,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:30,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347379790] [2023-12-05 21:12:30,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347379790] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:30,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:30,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:12:30,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241169781] [2023-12-05 21:12:30,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:30,177 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:12:30,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:30,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:12:30,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:12:30,205 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 190 [2023-12-05 21:12:30,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 189 transitions, 381 flow. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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-12-05 21:12:30,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:30,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 190 [2023-12-05 21:12:30,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:30,295 INFO L124 PetriNetUnfolderBase]: 8/243 cut-off events. [2023-12-05 21:12:30,296 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-05 21:12:30,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 243 events. 8/243 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 696 event pairs, 6 based on Foata normal form. 5/190 useless extension candidates. Maximal degree in co-relation 154. Up to 27 conditions per place. [2023-12-05 21:12:30,299 INFO L140 encePairwiseOnDemand]: 183/190 looper letters, 16 selfloop transitions, 2 changer transitions 1/189 dead transitions. [2023-12-05 21:12:30,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 189 transitions, 417 flow [2023-12-05 21:12:30,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:12:30,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:12:30,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 540 transitions. [2023-12-05 21:12:30,314 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9473684210526315 [2023-12-05 21:12:30,314 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 540 transitions. [2023-12-05 21:12:30,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 540 transitions. [2023-12-05 21:12:30,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:30,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 540 transitions. [2023-12-05 21:12:30,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 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-12-05 21:12:30,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 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-12-05 21:12:30,329 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 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-12-05 21:12:30,333 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, 2 predicate places. [2023-12-05 21:12:30,334 INFO L500 AbstractCegarLoop]: Abstraction has has 189 places, 189 transitions, 417 flow [2023-12-05 21:12:30,334 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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-12-05 21:12:30,334 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:30,334 INFO L233 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] [2023-12-05 21:12:30,334 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:12:30,335 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:12:30,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:30,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1454181979, now seen corresponding path program 1 times [2023-12-05 21:12:30,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:30,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821939990] [2023-12-05 21:12:30,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:30,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:30,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:30,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:30,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821939990] [2023-12-05 21:12:30,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821939990] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:12:30,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645425327] [2023-12-05 21:12:30,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:30,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:30,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:12:30,510 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:12:30,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-05 21:12:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:30,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-05 21:12:30,621 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:12:30,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-05 21:12:30,640 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-05 21:12:30,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645425327] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:30,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-05 21:12:30,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-05 21:12:30,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153389413] [2023-12-05 21:12:30,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:30,641 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:12:30,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:30,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:12:30,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:12:30,643 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 190 [2023-12-05 21:12:30,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 189 transitions, 417 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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-12-05 21:12:30,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:30,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 190 [2023-12-05 21:12:30,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:30,727 INFO L124 PetriNetUnfolderBase]: 8/306 cut-off events. [2023-12-05 21:12:30,728 INFO L125 PetriNetUnfolderBase]: For 17/31 co-relation queries the response was YES. [2023-12-05 21:12:30,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 306 events. 8/306 cut-off events. For 17/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 755 event pairs, 6 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 198. Up to 30 conditions per place. [2023-12-05 21:12:30,730 INFO L140 encePairwiseOnDemand]: 187/190 looper letters, 22 selfloop transitions, 2 changer transitions 1/196 dead transitions. [2023-12-05 21:12:30,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 196 transitions, 479 flow [2023-12-05 21:12:30,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:12:30,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:12:30,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 532 transitions. [2023-12-05 21:12:30,732 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2023-12-05 21:12:30,732 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 532 transitions. [2023-12-05 21:12:30,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 532 transitions. [2023-12-05 21:12:30,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:30,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 532 transitions. [2023-12-05 21:12:30,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 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-12-05 21:12:30,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 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-12-05 21:12:30,736 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 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-12-05 21:12:30,736 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, 4 predicate places. [2023-12-05 21:12:30,736 INFO L500 AbstractCegarLoop]: Abstraction has has 191 places, 196 transitions, 479 flow [2023-12-05 21:12:30,737 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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-12-05 21:12:30,737 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:30,737 INFO L233 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] [2023-12-05 21:12:30,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-05 21:12:30,942 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:30,943 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:12:30,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:30,943 INFO L85 PathProgramCache]: Analyzing trace with hash 767541414, now seen corresponding path program 1 times [2023-12-05 21:12:30,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:30,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977945296] [2023-12-05 21:12:30,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:30,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:31,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:31,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:31,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977945296] [2023-12-05 21:12:31,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977945296] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:12:31,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246434644] [2023-12-05 21:12:31,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:31,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:31,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:12:31,070 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:12:31,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-05 21:12:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:31,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-05 21:12:31,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:12:31,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:31,227 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:12:31,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:31,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246434644] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:12:31,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:12:31,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-05 21:12:31,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778352515] [2023-12-05 21:12:31,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:12:31,263 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-05 21:12:31,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:31,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-05 21:12:31,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-05 21:12:31,266 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 190 [2023-12-05 21:12:31,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 196 transitions, 479 flow. Second operand has 10 states, 10 states have (on average 173.1) internal successors, (1731), 10 states have internal predecessors, (1731), 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-12-05 21:12:31,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:31,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 190 [2023-12-05 21:12:31,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:31,384 INFO L124 PetriNetUnfolderBase]: 8/313 cut-off events. [2023-12-05 21:12:31,384 INFO L125 PetriNetUnfolderBase]: For 48/76 co-relation queries the response was YES. [2023-12-05 21:12:31,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 313 events. 8/313 cut-off events. For 48/76 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 743 event pairs, 6 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 230. Up to 32 conditions per place. [2023-12-05 21:12:31,385 INFO L140 encePairwiseOnDemand]: 184/190 looper letters, 17 selfloop transitions, 9 changer transitions 1/203 dead transitions. [2023-12-05 21:12:31,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 203 transitions, 555 flow [2023-12-05 21:12:31,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 21:12:31,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 21:12:31,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1567 transitions. [2023-12-05 21:12:31,389 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.916374269005848 [2023-12-05 21:12:31,389 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1567 transitions. [2023-12-05 21:12:31,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1567 transitions. [2023-12-05 21:12:31,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:31,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1567 transitions. [2023-12-05 21:12:31,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 174.11111111111111) internal successors, (1567), 9 states have internal predecessors, (1567), 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-12-05 21:12:31,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 190.0) internal successors, (1900), 10 states have internal predecessors, (1900), 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-12-05 21:12:31,395 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 190.0) internal successors, (1900), 10 states have internal predecessors, (1900), 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-12-05 21:12:31,396 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, 12 predicate places. [2023-12-05 21:12:31,396 INFO L500 AbstractCegarLoop]: Abstraction has has 199 places, 203 transitions, 555 flow [2023-12-05 21:12:31,397 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 173.1) internal successors, (1731), 10 states have internal predecessors, (1731), 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-12-05 21:12:31,398 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:31,398 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-05 21:12:31,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-05 21:12:31,602 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-12-05 21:12:31,603 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:12:31,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:31,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1892495334, now seen corresponding path program 2 times [2023-12-05 21:12:31,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:31,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972105903] [2023-12-05 21:12:31,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:31,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:31,712 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-05 21:12:31,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:31,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972105903] [2023-12-05 21:12:31,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972105903] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:31,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:31,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:12:31,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33172059] [2023-12-05 21:12:31,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:31,713 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:12:31,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:31,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:12:31,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:12:31,715 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 190 [2023-12-05 21:12:31,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 203 transitions, 555 flow. Second operand has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 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-12-05 21:12:31,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:31,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 190 [2023-12-05 21:12:31,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:31,872 INFO L124 PetriNetUnfolderBase]: 139/774 cut-off events. [2023-12-05 21:12:31,872 INFO L125 PetriNetUnfolderBase]: For 327/349 co-relation queries the response was YES. [2023-12-05 21:12:31,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1382 conditions, 774 events. 139/774 cut-off events. For 327/349 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4218 event pairs, 137 based on Foata normal form. 0/634 useless extension candidates. Maximal degree in co-relation 1082. Up to 331 conditions per place. [2023-12-05 21:12:31,876 INFO L140 encePairwiseOnDemand]: 178/190 looper letters, 54 selfloop transitions, 8 changer transitions 1/199 dead transitions. [2023-12-05 21:12:31,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 199 transitions, 671 flow [2023-12-05 21:12:31,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-05 21:12:31,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-05 21:12:31,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 674 transitions. [2023-12-05 21:12:31,878 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7094736842105264 [2023-12-05 21:12:31,878 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 674 transitions. [2023-12-05 21:12:31,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 674 transitions. [2023-12-05 21:12:31,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:31,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 674 transitions. [2023-12-05 21:12:31,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 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-12-05 21:12:31,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 190.0) internal successors, (1140), 6 states have internal predecessors, (1140), 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-12-05 21:12:31,881 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 190.0) internal successors, (1140), 6 states have internal predecessors, (1140), 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-12-05 21:12:31,881 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, 12 predicate places. [2023-12-05 21:12:31,882 INFO L500 AbstractCegarLoop]: Abstraction has has 199 places, 199 transitions, 671 flow [2023-12-05 21:12:31,882 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 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-12-05 21:12:31,882 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:31,882 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-05 21:12:31,882 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:12:31,882 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:12:31,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:31,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1892495335, now seen corresponding path program 1 times [2023-12-05 21:12:31,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:31,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830949645] [2023-12-05 21:12:31,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:31,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:32,006 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:32,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:32,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830949645] [2023-12-05 21:12:32,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830949645] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:12:32,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807707656] [2023-12-05 21:12:32,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:32,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:32,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:12:32,008 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:12:32,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-05 21:12:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:32,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-05 21:12:32,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:12:32,142 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:32,142 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:12:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:32,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807707656] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:12:32,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:12:32,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-12-05 21:12:32,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540364341] [2023-12-05 21:12:32,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:12:32,218 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-05 21:12:32,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:32,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-05 21:12:32,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-12-05 21:12:32,222 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 190 [2023-12-05 21:12:32,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 199 transitions, 671 flow. Second operand has 18 states, 18 states have (on average 173.27777777777777) internal successors, (3119), 18 states have internal predecessors, (3119), 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-12-05 21:12:32,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:32,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 190 [2023-12-05 21:12:32,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:32,465 INFO L124 PetriNetUnfolderBase]: 139/794 cut-off events. [2023-12-05 21:12:32,465 INFO L125 PetriNetUnfolderBase]: For 541/571 co-relation queries the response was YES. [2023-12-05 21:12:32,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1540 conditions, 794 events. 139/794 cut-off events. For 541/571 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4214 event pairs, 137 based on Foata normal form. 0/654 useless extension candidates. Maximal degree in co-relation 1142. Up to 331 conditions per place. [2023-12-05 21:12:32,471 INFO L140 encePairwiseOnDemand]: 184/190 looper letters, 25 selfloop transitions, 21 changer transitions 1/219 dead transitions. [2023-12-05 21:12:32,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 219 transitions, 875 flow [2023-12-05 21:12:32,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-05 21:12:32,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-12-05 21:12:32,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3641 transitions. [2023-12-05 21:12:32,477 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.912531328320802 [2023-12-05 21:12:32,477 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3641 transitions. [2023-12-05 21:12:32,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3641 transitions. [2023-12-05 21:12:32,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:32,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3641 transitions. [2023-12-05 21:12:32,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 173.38095238095238) internal successors, (3641), 21 states have internal predecessors, (3641), 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-12-05 21:12:32,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 190.0) internal successors, (4180), 22 states have internal predecessors, (4180), 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-12-05 21:12:32,490 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 190.0) internal successors, (4180), 22 states have internal predecessors, (4180), 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-12-05 21:12:32,491 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, 32 predicate places. [2023-12-05 21:12:32,491 INFO L500 AbstractCegarLoop]: Abstraction has has 219 places, 219 transitions, 875 flow [2023-12-05 21:12:32,493 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 173.27777777777777) internal successors, (3119), 18 states have internal predecessors, (3119), 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-12-05 21:12:32,493 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:32,493 INFO L233 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-05 21:12:32,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-05 21:12:32,698 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:32,698 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:12:32,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:32,699 INFO L85 PathProgramCache]: Analyzing trace with hash 495312487, now seen corresponding path program 2 times [2023-12-05 21:12:32,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:32,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669675153] [2023-12-05 21:12:32,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:32,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:32,931 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:32,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:32,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669675153] [2023-12-05 21:12:32,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669675153] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:12:32,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614055928] [2023-12-05 21:12:32,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-05 21:12:32,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:32,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:12:32,933 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:12:32,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-05 21:12:33,010 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-05 21:12:33,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-05 21:12:33,011 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-05 21:12:33,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:12:33,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-05 21:12:33,064 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-05 21:12:33,065 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-05 21:12:33,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614055928] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:33,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-05 21:12:33,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [17] total 19 [2023-12-05 21:12:33,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267250648] [2023-12-05 21:12:33,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:33,066 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:12:33,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:33,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:12:33,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2023-12-05 21:12:33,067 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 190 [2023-12-05 21:12:33,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 219 transitions, 875 flow. Second operand has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 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-12-05 21:12:33,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:33,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 190 [2023-12-05 21:12:33,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:33,286 INFO L124 PetriNetUnfolderBase]: 214/986 cut-off events. [2023-12-05 21:12:33,286 INFO L125 PetriNetUnfolderBase]: For 1141/1228 co-relation queries the response was YES. [2023-12-05 21:12:33,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2281 conditions, 986 events. 214/986 cut-off events. For 1141/1228 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 5934 event pairs, 212 based on Foata normal form. 0/961 useless extension candidates. Maximal degree in co-relation 1841. Up to 404 conditions per place. [2023-12-05 21:12:33,291 INFO L140 encePairwiseOnDemand]: 178/190 looper letters, 50 selfloop transitions, 8 changer transitions 1/215 dead transitions. [2023-12-05 21:12:33,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 215 transitions, 975 flow [2023-12-05 21:12:33,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-05 21:12:33,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-05 21:12:33,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 678 transitions. [2023-12-05 21:12:33,292 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7136842105263158 [2023-12-05 21:12:33,292 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 678 transitions. [2023-12-05 21:12:33,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 678 transitions. [2023-12-05 21:12:33,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:33,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 678 transitions. [2023-12-05 21:12:33,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 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-12-05 21:12:33,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 190.0) internal successors, (1140), 6 states have internal predecessors, (1140), 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-12-05 21:12:33,295 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 190.0) internal successors, (1140), 6 states have internal predecessors, (1140), 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-12-05 21:12:33,296 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, 32 predicate places. [2023-12-05 21:12:33,296 INFO L500 AbstractCegarLoop]: Abstraction has has 219 places, 215 transitions, 975 flow [2023-12-05 21:12:33,296 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 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-12-05 21:12:33,296 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:33,296 INFO L233 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-05 21:12:33,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-05 21:12:33,502 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:33,502 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:12:33,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:33,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1363595646, now seen corresponding path program 1 times [2023-12-05 21:12:33,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:33,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547362997] [2023-12-05 21:12:33,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:33,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:33,751 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:33,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:33,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547362997] [2023-12-05 21:12:33,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547362997] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:12:33,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281287641] [2023-12-05 21:12:33,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:33,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:33,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:12:33,768 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:12:33,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-05 21:12:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:33,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-05 21:12:33,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:12:33,932 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:33,932 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:12:34,100 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:34,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281287641] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:12:34,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:12:34,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-12-05 21:12:34,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108651529] [2023-12-05 21:12:34,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:12:34,102 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-05 21:12:34,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:34,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-05 21:12:34,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-12-05 21:12:34,108 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 190 [2023-12-05 21:12:34,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 215 transitions, 975 flow. Second operand has 23 states, 23 states have (on average 173.43478260869566) internal successors, (3989), 23 states have internal predecessors, (3989), 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-12-05 21:12:34,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:34,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 190 [2023-12-05 21:12:34,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:34,563 INFO L124 PetriNetUnfolderBase]: 214/1001 cut-off events. [2023-12-05 21:12:34,564 INFO L125 PetriNetUnfolderBase]: For 1571/1666 co-relation queries the response was YES. [2023-12-05 21:12:34,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2474 conditions, 1001 events. 214/1001 cut-off events. For 1571/1666 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 5931 event pairs, 212 based on Foata normal form. 0/976 useless extension candidates. Maximal degree in co-relation 1920. Up to 404 conditions per place. [2023-12-05 21:12:34,568 INFO L140 encePairwiseOnDemand]: 184/190 looper letters, 31 selfloop transitions, 30 changer transitions 1/230 dead transitions. [2023-12-05 21:12:34,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 230 transitions, 1211 flow [2023-12-05 21:12:34,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-05 21:12:34,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-12-05 21:12:34,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5194 transitions. [2023-12-05 21:12:34,574 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9112280701754386 [2023-12-05 21:12:34,574 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 5194 transitions. [2023-12-05 21:12:34,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 5194 transitions. [2023-12-05 21:12:34,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:34,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 5194 transitions. [2023-12-05 21:12:34,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 173.13333333333333) internal successors, (5194), 30 states have internal predecessors, (5194), 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-12-05 21:12:34,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 190.0) internal successors, (5890), 31 states have internal predecessors, (5890), 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-12-05 21:12:34,591 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 190.0) internal successors, (5890), 31 states have internal predecessors, (5890), 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-12-05 21:12:34,591 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, 61 predicate places. [2023-12-05 21:12:34,591 INFO L500 AbstractCegarLoop]: Abstraction has has 248 places, 230 transitions, 1211 flow [2023-12-05 21:12:34,592 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 173.43478260869566) internal successors, (3989), 23 states have internal predecessors, (3989), 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-12-05 21:12:34,592 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:34,593 INFO L233 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-05 21:12:34,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-05 21:12:34,798 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:34,798 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:12:34,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:34,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1252761999, now seen corresponding path program 1 times [2023-12-05 21:12:34,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:34,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739215654] [2023-12-05 21:12:34,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:34,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:35,135 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-12-05 21:12:35,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:35,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739215654] [2023-12-05 21:12:35,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739215654] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:35,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:35,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-05 21:12:35,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188300378] [2023-12-05 21:12:35,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:35,137 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-05 21:12:35,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:35,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-05 21:12:35,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-05 21:12:35,141 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 190 [2023-12-05 21:12:35,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 230 transitions, 1211 flow. Second operand has 9 states, 9 states have (on average 115.0) internal successors, (1035), 9 states have internal predecessors, (1035), 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-12-05 21:12:35,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:35,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 190 [2023-12-05 21:12:35,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:35,467 INFO L124 PetriNetUnfolderBase]: 237/1053 cut-off events. [2023-12-05 21:12:35,468 INFO L125 PetriNetUnfolderBase]: For 2376/2543 co-relation queries the response was YES. [2023-12-05 21:12:35,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3113 conditions, 1053 events. 237/1053 cut-off events. For 2376/2543 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 6351 event pairs, 235 based on Foata normal form. 2/1029 useless extension candidates. Maximal degree in co-relation 2485. Up to 458 conditions per place. [2023-12-05 21:12:35,472 INFO L140 encePairwiseOnDemand]: 181/190 looper letters, 98 selfloop transitions, 7 changer transitions 1/250 dead transitions. [2023-12-05 21:12:35,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 250 transitions, 1531 flow [2023-12-05 21:12:35,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:12:35,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:12:35,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1002 transitions. [2023-12-05 21:12:35,475 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6592105263157895 [2023-12-05 21:12:35,475 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1002 transitions. [2023-12-05 21:12:35,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1002 transitions. [2023-12-05 21:12:35,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:35,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1002 transitions. [2023-12-05 21:12:35,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.25) internal successors, (1002), 8 states have internal predecessors, (1002), 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-12-05 21:12:35,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 190.0) internal successors, (1710), 9 states have internal predecessors, (1710), 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-12-05 21:12:35,479 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 190.0) internal successors, (1710), 9 states have internal predecessors, (1710), 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-12-05 21:12:35,479 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, 68 predicate places. [2023-12-05 21:12:35,479 INFO L500 AbstractCegarLoop]: Abstraction has has 255 places, 250 transitions, 1531 flow [2023-12-05 21:12:35,479 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.0) internal successors, (1035), 9 states have internal predecessors, (1035), 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-12-05 21:12:35,479 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:35,480 INFO L233 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-05 21:12:35,480 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:12:35,480 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:12:35,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:35,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1252762000, now seen corresponding path program 2 times [2023-12-05 21:12:35,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:35,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908891192] [2023-12-05 21:12:35,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:35,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:35,728 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-12-05 21:12:35,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:35,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908891192] [2023-12-05 21:12:35,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908891192] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:35,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:35,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-05 21:12:35,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555301588] [2023-12-05 21:12:35,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:35,729 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-05 21:12:35,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:35,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-05 21:12:35,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-12-05 21:12:35,731 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 190 [2023-12-05 21:12:35,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 250 transitions, 1531 flow. Second operand has 9 states, 9 states have (on average 114.88888888888889) internal successors, (1034), 9 states have internal predecessors, (1034), 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-12-05 21:12:35,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:35,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 190 [2023-12-05 21:12:35,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:36,078 INFO L124 PetriNetUnfolderBase]: 219/1028 cut-off events. [2023-12-05 21:12:36,078 INFO L125 PetriNetUnfolderBase]: For 3270/3496 co-relation queries the response was YES. [2023-12-05 21:12:36,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3502 conditions, 1028 events. 219/1028 cut-off events. For 3270/3496 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 6135 event pairs, 194 based on Foata normal form. 36/1039 useless extension candidates. Maximal degree in co-relation 2815. Up to 426 conditions per place. [2023-12-05 21:12:36,083 INFO L140 encePairwiseOnDemand]: 181/190 looper letters, 103 selfloop transitions, 5 changer transitions 5/267 dead transitions. [2023-12-05 21:12:36,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 267 transitions, 1897 flow [2023-12-05 21:12:36,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 21:12:36,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 21:12:36,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 766 transitions. [2023-12-05 21:12:36,085 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6719298245614035 [2023-12-05 21:12:36,085 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 766 transitions. [2023-12-05 21:12:36,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 766 transitions. [2023-12-05 21:12:36,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:36,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 766 transitions. [2023-12-05 21:12:36,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.66666666666667) internal successors, (766), 6 states have internal predecessors, (766), 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-12-05 21:12:36,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 190.0) internal successors, (1330), 7 states have internal predecessors, (1330), 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-12-05 21:12:36,088 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 190.0) internal successors, (1330), 7 states have internal predecessors, (1330), 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-12-05 21:12:36,088 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, 70 predicate places. [2023-12-05 21:12:36,088 INFO L500 AbstractCegarLoop]: Abstraction has has 257 places, 267 transitions, 1897 flow [2023-12-05 21:12:36,088 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.88888888888889) internal successors, (1034), 9 states have internal predecessors, (1034), 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-12-05 21:12:36,088 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:36,089 INFO L233 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-05 21:12:36,089 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:12:36,089 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:12:36,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:36,089 INFO L85 PathProgramCache]: Analyzing trace with hash 492289408, now seen corresponding path program 1 times [2023-12-05 21:12:36,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:36,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752642186] [2023-12-05 21:12:36,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:36,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:36,905 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-12-05 21:12:36,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:36,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752642186] [2023-12-05 21:12:36,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752642186] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:36,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:36,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-05 21:12:36,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692893717] [2023-12-05 21:12:36,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:36,906 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-05 21:12:36,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:36,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-05 21:12:36,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2023-12-05 21:12:36,909 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 190 [2023-12-05 21:12:36,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 267 transitions, 1897 flow. Second operand has 16 states, 16 states have (on average 86.3125) internal successors, (1381), 16 states have internal predecessors, (1381), 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-12-05 21:12:36,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:36,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 190 [2023-12-05 21:12:36,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:37,805 INFO L124 PetriNetUnfolderBase]: 252/1076 cut-off events. [2023-12-05 21:12:37,805 INFO L125 PetriNetUnfolderBase]: For 4288/4600 co-relation queries the response was YES. [2023-12-05 21:12:37,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4287 conditions, 1076 events. 252/1076 cut-off events. For 4288/4600 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 6419 event pairs, 212 based on Foata normal form. 15/1066 useless extension candidates. Maximal degree in co-relation 3507. Up to 444 conditions per place. [2023-12-05 21:12:37,812 INFO L140 encePairwiseOnDemand]: 160/190 looper letters, 102 selfloop transitions, 43 changer transitions 5/269 dead transitions. [2023-12-05 21:12:37,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 269 transitions, 2203 flow [2023-12-05 21:12:37,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-05 21:12:37,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-12-05 21:12:37,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2381 transitions. [2023-12-05 21:12:37,819 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.46413255360623784 [2023-12-05 21:12:37,819 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 2381 transitions. [2023-12-05 21:12:37,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 2381 transitions. [2023-12-05 21:12:37,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:37,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 2381 transitions. [2023-12-05 21:12:37,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 88.18518518518519) internal successors, (2381), 27 states have internal predecessors, (2381), 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-12-05 21:12:37,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 190.0) internal successors, (5320), 28 states have internal predecessors, (5320), 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-12-05 21:12:37,828 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 190.0) internal successors, (5320), 28 states have internal predecessors, (5320), 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-12-05 21:12:37,828 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, 94 predicate places. [2023-12-05 21:12:37,828 INFO L500 AbstractCegarLoop]: Abstraction has has 281 places, 269 transitions, 2203 flow [2023-12-05 21:12:37,829 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 86.3125) internal successors, (1381), 16 states have internal predecessors, (1381), 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-12-05 21:12:37,829 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:37,829 INFO L233 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-05 21:12:37,829 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:12:37,829 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:12:37,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:37,829 INFO L85 PathProgramCache]: Analyzing trace with hash 492289407, now seen corresponding path program 1 times [2023-12-05 21:12:37,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:37,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862868590] [2023-12-05 21:12:37,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:37,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:38,374 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-12-05 21:12:38,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:38,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862868590] [2023-12-05 21:12:38,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862868590] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:38,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:38,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-05 21:12:38,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084155674] [2023-12-05 21:12:38,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:38,377 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-05 21:12:38,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:38,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-05 21:12:38,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2023-12-05 21:12:38,378 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 190 [2023-12-05 21:12:38,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 269 transitions, 2203 flow. Second operand has 16 states, 16 states have (on average 95.3125) internal successors, (1525), 16 states have internal predecessors, (1525), 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-12-05 21:12:38,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:38,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 190 [2023-12-05 21:12:38,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:39,079 INFO L124 PetriNetUnfolderBase]: 252/1072 cut-off events. [2023-12-05 21:12:39,079 INFO L125 PetriNetUnfolderBase]: For 5557/5940 co-relation queries the response was YES. [2023-12-05 21:12:39,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4802 conditions, 1072 events. 252/1072 cut-off events. For 5557/5940 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 6417 event pairs, 201 based on Foata normal form. 15/1062 useless extension candidates. Maximal degree in co-relation 3940. Up to 444 conditions per place. [2023-12-05 21:12:39,085 INFO L140 encePairwiseOnDemand]: 163/190 looper letters, 94 selfloop transitions, 35 changer transitions 5/268 dead transitions. [2023-12-05 21:12:39,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 268 transitions, 2469 flow [2023-12-05 21:12:39,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-05 21:12:39,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-12-05 21:12:39,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2337 transitions. [2023-12-05 21:12:39,088 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5125 [2023-12-05 21:12:39,088 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2337 transitions. [2023-12-05 21:12:39,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2337 transitions. [2023-12-05 21:12:39,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:39,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2337 transitions. [2023-12-05 21:12:39,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 97.375) internal successors, (2337), 24 states have internal predecessors, (2337), 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-12-05 21:12:39,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 190.0) internal successors, (4750), 25 states have internal predecessors, (4750), 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-12-05 21:12:39,095 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 190.0) internal successors, (4750), 25 states have internal predecessors, (4750), 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-12-05 21:12:39,095 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, 115 predicate places. [2023-12-05 21:12:39,096 INFO L500 AbstractCegarLoop]: Abstraction has has 302 places, 268 transitions, 2469 flow [2023-12-05 21:12:39,096 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 95.3125) internal successors, (1525), 16 states have internal predecessors, (1525), 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-12-05 21:12:39,096 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:39,096 INFO L233 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-05 21:12:39,096 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:12:39,096 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:12:39,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:39,097 INFO L85 PathProgramCache]: Analyzing trace with hash 143892316, now seen corresponding path program 1 times [2023-12-05 21:12:39,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:39,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322644560] [2023-12-05 21:12:39,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:39,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:39,319 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-12-05 21:12:39,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:39,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322644560] [2023-12-05 21:12:39,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322644560] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:39,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:39,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 21:12:39,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752105799] [2023-12-05 21:12:39,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:39,320 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 21:12:39,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:39,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 21:12:39,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-05 21:12:39,321 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 190 [2023-12-05 21:12:39,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 268 transitions, 2469 flow. Second operand has 8 states, 8 states have (on average 114.875) internal successors, (919), 8 states have internal predecessors, (919), 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-12-05 21:12:39,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:39,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 190 [2023-12-05 21:12:39,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:39,701 INFO L124 PetriNetUnfolderBase]: 252/1070 cut-off events. [2023-12-05 21:12:39,702 INFO L125 PetriNetUnfolderBase]: For 6941/7378 co-relation queries the response was YES. [2023-12-05 21:12:39,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5277 conditions, 1070 events. 252/1070 cut-off events. For 6941/7378 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 6405 event pairs, 201 based on Foata normal form. 2/1047 useless extension candidates. Maximal degree in co-relation 4350. Up to 443 conditions per place. [2023-12-05 21:12:39,708 INFO L140 encePairwiseOnDemand]: 171/190 looper letters, 74 selfloop transitions, 26 changer transitions 5/266 dead transitions. [2023-12-05 21:12:39,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 266 transitions, 2661 flow [2023-12-05 21:12:39,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-05 21:12:39,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-05 21:12:39,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1287 transitions. [2023-12-05 21:12:39,710 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6157894736842106 [2023-12-05 21:12:39,710 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1287 transitions. [2023-12-05 21:12:39,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1287 transitions. [2023-12-05 21:12:39,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:39,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1287 transitions. [2023-12-05 21:12:39,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 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-12-05 21:12:39,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 190.0) internal successors, (2280), 12 states have internal predecessors, (2280), 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-12-05 21:12:39,714 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 190.0) internal successors, (2280), 12 states have internal predecessors, (2280), 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-12-05 21:12:39,714 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, 124 predicate places. [2023-12-05 21:12:39,715 INFO L500 AbstractCegarLoop]: Abstraction has has 311 places, 266 transitions, 2661 flow [2023-12-05 21:12:39,715 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.875) internal successors, (919), 8 states have internal predecessors, (919), 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-12-05 21:12:39,715 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:39,715 INFO L233 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-05 21:12:39,715 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:12:39,715 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:12:39,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:39,716 INFO L85 PathProgramCache]: Analyzing trace with hash 143892315, now seen corresponding path program 1 times [2023-12-05 21:12:39,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:39,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991019531] [2023-12-05 21:12:39,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:39,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:39,825 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-12-05 21:12:39,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:39,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991019531] [2023-12-05 21:12:39,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991019531] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:39,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:39,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:12:39,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510970285] [2023-12-05 21:12:39,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:39,827 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:12:39,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:39,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:12:39,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:12:39,829 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 190 [2023-12-05 21:12:39,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 266 transitions, 2661 flow. Second operand has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 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-12-05 21:12:39,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:39,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 190 [2023-12-05 21:12:39,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:40,111 INFO L124 PetriNetUnfolderBase]: 252/1068 cut-off events. [2023-12-05 21:12:40,111 INFO L125 PetriNetUnfolderBase]: For 8483/8986 co-relation queries the response was YES. [2023-12-05 21:12:40,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5730 conditions, 1068 events. 252/1068 cut-off events. For 8483/8986 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 6394 event pairs, 201 based on Foata normal form. 11/1054 useless extension candidates. Maximal degree in co-relation 4749. Up to 443 conditions per place. [2023-12-05 21:12:40,123 INFO L140 encePairwiseOnDemand]: 174/190 looper letters, 77 selfloop transitions, 19 changer transitions 5/265 dead transitions. [2023-12-05 21:12:40,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 265 transitions, 2849 flow [2023-12-05 21:12:40,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 21:12:40,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 21:12:40,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1075 transitions. [2023-12-05 21:12:40,124 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6286549707602339 [2023-12-05 21:12:40,124 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1075 transitions. [2023-12-05 21:12:40,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1075 transitions. [2023-12-05 21:12:40,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:40,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1075 transitions. [2023-12-05 21:12:40,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.44444444444444) internal successors, (1075), 9 states have internal predecessors, (1075), 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-12-05 21:12:40,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 190.0) internal successors, (1900), 10 states have internal predecessors, (1900), 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-12-05 21:12:40,127 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 190.0) internal successors, (1900), 10 states have internal predecessors, (1900), 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-12-05 21:12:40,128 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, 131 predicate places. [2023-12-05 21:12:40,130 INFO L500 AbstractCegarLoop]: Abstraction has has 318 places, 265 transitions, 2849 flow [2023-12-05 21:12:40,131 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 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-12-05 21:12:40,131 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:40,131 INFO L233 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-05 21:12:40,131 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:12:40,131 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:12:40,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:40,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1501368275, now seen corresponding path program 1 times [2023-12-05 21:12:40,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:40,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116915809] [2023-12-05 21:12:40,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:40,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:40,211 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-12-05 21:12:40,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:40,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116915809] [2023-12-05 21:12:40,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116915809] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:12:40,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624743327] [2023-12-05 21:12:40,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:40,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:40,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:12:40,234 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:12:40,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-05 21:12:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:40,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-05 21:12:40,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:12:40,430 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-12-05 21:12:40,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:12:40,488 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-12-05 21:12:40,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624743327] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:12:40,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:12:40,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-05 21:12:40,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201264746] [2023-12-05 21:12:40,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:12:40,489 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-05 21:12:40,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:40,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-05 21:12:40,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-05 21:12:40,491 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 190 [2023-12-05 21:12:40,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 265 transitions, 2849 flow. Second operand has 10 states, 10 states have (on average 170.4) internal successors, (1704), 10 states have internal predecessors, (1704), 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-12-05 21:12:40,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:40,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 190 [2023-12-05 21:12:40,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:40,739 INFO L124 PetriNetUnfolderBase]: 252/1118 cut-off events. [2023-12-05 21:12:40,740 INFO L125 PetriNetUnfolderBase]: For 9950/10449 co-relation queries the response was YES. [2023-12-05 21:12:40,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6150 conditions, 1118 events. 252/1118 cut-off events. For 9950/10449 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6103 event pairs, 201 based on Foata normal form. 0/1093 useless extension candidates. Maximal degree in co-relation 4852. Up to 468 conditions per place. [2023-12-05 21:12:40,747 INFO L140 encePairwiseOnDemand]: 184/190 looper letters, 26 selfloop transitions, 9 changer transitions 5/275 dead transitions. [2023-12-05 21:12:40,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 275 transitions, 3039 flow [2023-12-05 21:12:40,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 21:12:40,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 21:12:40,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1547 transitions. [2023-12-05 21:12:40,749 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9046783625730994 [2023-12-05 21:12:40,749 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1547 transitions. [2023-12-05 21:12:40,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1547 transitions. [2023-12-05 21:12:40,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:40,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1547 transitions. [2023-12-05 21:12:40,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 171.88888888888889) internal successors, (1547), 9 states have internal predecessors, (1547), 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-12-05 21:12:40,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 190.0) internal successors, (1900), 10 states have internal predecessors, (1900), 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-12-05 21:12:40,752 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 190.0) internal successors, (1900), 10 states have internal predecessors, (1900), 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-12-05 21:12:40,754 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, 139 predicate places. [2023-12-05 21:12:40,754 INFO L500 AbstractCegarLoop]: Abstraction has has 326 places, 275 transitions, 3039 flow [2023-12-05 21:12:40,754 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 170.4) internal successors, (1704), 10 states have internal predecessors, (1704), 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-12-05 21:12:40,754 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:40,754 INFO L233 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-05 21:12:40,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-05 21:12:40,983 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:40,983 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:12:40,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:40,984 INFO L85 PathProgramCache]: Analyzing trace with hash 2062108433, now seen corresponding path program 1 times [2023-12-05 21:12:40,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:40,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191185789] [2023-12-05 21:12:40,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:40,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:41,558 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-12-05 21:12:41,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:41,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191185789] [2023-12-05 21:12:41,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191185789] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:12:41,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777492319] [2023-12-05 21:12:41,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:41,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:41,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:12:41,568 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:12:41,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-05 21:12:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:41,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-05 21:12:41,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:12:42,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:12:42,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-05 21:12:42,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:12:42,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-05 21:12:42,315 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-05 21:12:42,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-12-05 21:12:42,330 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:12:42,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-05 21:12:42,498 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-05 21:12:42,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-12-05 21:12:42,511 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:12:42,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-05 21:12:42,730 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-05 21:12:42,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-12-05 21:12:42,739 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:12:42,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-05 21:12:42,810 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-12-05 21:12:42,811 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:12:43,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:12:43,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2023-12-05 21:12:43,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:12:43,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2023-12-05 21:12:45,861 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_12| Int)) (or (forall ((|v_ULTIMATE.start_new_#t~malloc30#1.base_39| Int) (v_ArrVal_825 Int) (v_ArrVal_824 Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_#t~malloc30#1.base_39| 1)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~#t1~0#1.base_12| v_ArrVal_824) |v_ULTIMATE.start_new_#t~malloc30#1.base_39|) 0)) (forall ((v_ArrVal_828 Int) (v_ArrVal_826 Int) (|v_ULTIMATE.start_new_#t~malloc30#1.base_31| Int)) (or (= |v_ULTIMATE.start_new_#t~malloc30#1.base_31| |c_~#c~0.base|) (< (+ 7 |c_~#c~0.offset|) (select (store (store (store |c_#length| |v_ULTIMATE.start_main_~#t1~0#1.base_12| v_ArrVal_825) |v_ULTIMATE.start_new_#t~malloc30#1.base_39| v_ArrVal_826) |v_ULTIMATE.start_new_#t~malloc30#1.base_31| v_ArrVal_828) |c_~#c~0.base|)))))) (< |v_ULTIMATE.start_main_~#t1~0#1.base_12| .cse0))) (or (forall ((|v_ULTIMATE.start_new_#t~malloc30#1.base_39| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_12| Int) (v_ArrVal_824 Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_#t~malloc30#1.base_39| 1)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~#t1~0#1.base_12| v_ArrVal_824) |v_ULTIMATE.start_new_#t~malloc30#1.base_39|) 0)) (< |v_ULTIMATE.start_main_~#t1~0#1.base_12| .cse0))) (< 0 (+ 5 |c_~#c~0.offset|))))) is different from false [2023-12-05 21:12:47,791 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-05 21:12:47,791 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-05 21:12:47,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2023-12-05 21:12:47,796 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-05 21:12:47,797 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-05 21:12:47,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-05 21:12:47,803 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-12-05 21:12:47,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777492319] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:12:47,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:12:47,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 32 [2023-12-05 21:12:47,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618864237] [2023-12-05 21:12:47,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:12:47,804 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-05 21:12:47,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:47,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-05 21:12:47,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=839, Unknown=1, NotChecked=60, Total=1056 [2023-12-05 21:12:47,806 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 190 [2023-12-05 21:12:47,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 275 transitions, 3039 flow. Second operand has 33 states, 33 states have (on average 96.96969696969697) internal successors, (3200), 33 states have internal predecessors, (3200), 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-12-05 21:12:47,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:47,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 190 [2023-12-05 21:12:47,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:49,037 INFO L124 PetriNetUnfolderBase]: 252/1114 cut-off events. [2023-12-05 21:12:49,037 INFO L125 PetriNetUnfolderBase]: For 11670/12287 co-relation queries the response was YES. [2023-12-05 21:12:49,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6762 conditions, 1114 events. 252/1114 cut-off events. For 11670/12287 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6066 event pairs, 201 based on Foata normal form. 17/1106 useless extension candidates. Maximal degree in co-relation 5398. Up to 464 conditions per place. [2023-12-05 21:12:49,046 INFO L140 encePairwiseOnDemand]: 170/190 looper letters, 128 selfloop transitions, 30 changer transitions 5/292 dead transitions. [2023-12-05 21:12:49,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 292 transitions, 3657 flow [2023-12-05 21:12:49,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-05 21:12:49,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-12-05 21:12:49,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1914 transitions. [2023-12-05 21:12:49,049 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5301939058171745 [2023-12-05 21:12:49,049 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1914 transitions. [2023-12-05 21:12:49,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1914 transitions. [2023-12-05 21:12:49,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:49,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1914 transitions. [2023-12-05 21:12:49,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 100.73684210526316) internal successors, (1914), 19 states have internal predecessors, (1914), 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-12-05 21:12:49,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 190.0) internal successors, (3800), 20 states have internal predecessors, (3800), 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-12-05 21:12:49,056 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 190.0) internal successors, (3800), 20 states have internal predecessors, (3800), 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-12-05 21:12:49,057 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, 155 predicate places. [2023-12-05 21:12:49,057 INFO L500 AbstractCegarLoop]: Abstraction has has 342 places, 292 transitions, 3657 flow [2023-12-05 21:12:49,058 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 96.96969696969697) internal successors, (3200), 33 states have internal predecessors, (3200), 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-12-05 21:12:49,058 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:49,058 INFO L233 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 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-12-05 21:12:49,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-05 21:12:49,264 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:49,264 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:12:49,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:49,265 INFO L85 PathProgramCache]: Analyzing trace with hash -436532883, now seen corresponding path program 2 times [2023-12-05 21:12:49,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:49,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55246362] [2023-12-05 21:12:49,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:49,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:49,516 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-12-05 21:12:49,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:49,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55246362] [2023-12-05 21:12:49,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55246362] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:12:49,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039077708] [2023-12-05 21:12:49,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-05 21:12:49,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:49,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:12:49,518 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:12:49,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-05 21:12:49,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-05 21:12:49,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-05 21:12:49,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-05 21:12:49,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:12:49,890 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-12-05 21:12:49,891 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:12:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-12-05 21:12:50,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039077708] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:12:50,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:12:50,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-12-05 21:12:50,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336742848] [2023-12-05 21:12:50,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:12:50,083 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-05 21:12:50,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:50,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-05 21:12:50,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-12-05 21:12:50,086 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 190 [2023-12-05 21:12:50,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 292 transitions, 3657 flow. Second operand has 18 states, 18 states have (on average 170.66666666666666) internal successors, (3072), 18 states have internal predecessors, (3072), 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-12-05 21:12:50,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:50,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 190 [2023-12-05 21:12:50,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:50,530 INFO L124 PetriNetUnfolderBase]: 252/1298 cut-off events. [2023-12-05 21:12:50,530 INFO L125 PetriNetUnfolderBase]: For 14222/14833 co-relation queries the response was YES. [2023-12-05 21:12:50,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8102 conditions, 1298 events. 252/1298 cut-off events. For 14222/14833 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6078 event pairs, 201 based on Foata normal form. 0/1273 useless extension candidates. Maximal degree in co-relation 5501. Up to 552 conditions per place. [2023-12-05 21:12:50,537 INFO L140 encePairwiseOnDemand]: 184/190 looper letters, 34 selfloop transitions, 21 changer transitions 5/316 dead transitions. [2023-12-05 21:12:50,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 316 transitions, 4155 flow [2023-12-05 21:12:50,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-05 21:12:50,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-12-05 21:12:50,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3585 transitions. [2023-12-05 21:12:50,610 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8984962406015038 [2023-12-05 21:12:50,610 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3585 transitions. [2023-12-05 21:12:50,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3585 transitions. [2023-12-05 21:12:50,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:50,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3585 transitions. [2023-12-05 21:12:50,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 170.71428571428572) internal successors, (3585), 21 states have internal predecessors, (3585), 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-12-05 21:12:50,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 190.0) internal successors, (4180), 22 states have internal predecessors, (4180), 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-12-05 21:12:50,619 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 190.0) internal successors, (4180), 22 states have internal predecessors, (4180), 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-12-05 21:12:50,620 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, 175 predicate places. [2023-12-05 21:12:50,620 INFO L500 AbstractCegarLoop]: Abstraction has has 362 places, 316 transitions, 4155 flow [2023-12-05 21:12:50,620 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 170.66666666666666) internal successors, (3072), 18 states have internal predecessors, (3072), 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-12-05 21:12:50,621 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:50,621 INFO L233 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 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-12-05 21:12:50,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-05 21:12:50,821 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-05 21:12:50,821 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:12:50,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:50,822 INFO L85 PathProgramCache]: Analyzing trace with hash 450501612, now seen corresponding path program 1 times [2023-12-05 21:12:50,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:50,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664897553] [2023-12-05 21:12:50,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:50,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:51,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1208 backedges. 0 proven. 973 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-12-05 21:12:51,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:51,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664897553] [2023-12-05 21:12:51,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664897553] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:12:51,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706008710] [2023-12-05 21:12:51,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:51,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:51,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:12:51,513 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:12:51,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-05 21:12:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:51,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 1750 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-05 21:12:51,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:12:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1208 backedges. 0 proven. 973 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-12-05 21:12:52,190 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:12:52,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1208 backedges. 0 proven. 973 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-12-05 21:12:52,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706008710] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:12:52,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:12:52,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-12-05 21:12:52,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759313444] [2023-12-05 21:12:52,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:12:52,521 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-05 21:12:52,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:52,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-05 21:12:52,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-12-05 21:12:52,524 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 190 [2023-12-05 21:12:52,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 316 transitions, 4155 flow. Second operand has 23 states, 23 states have (on average 170.8695652173913) internal successors, (3930), 23 states have internal predecessors, (3930), 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-12-05 21:12:52,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:52,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 190 [2023-12-05 21:12:52,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:53,155 INFO L124 PetriNetUnfolderBase]: 252/1436 cut-off events. [2023-12-05 21:12:53,156 INFO L125 PetriNetUnfolderBase]: For 16899/17512 co-relation queries the response was YES. [2023-12-05 21:12:53,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9181 conditions, 1436 events. 252/1436 cut-off events. For 16899/17512 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6069 event pairs, 201 based on Foata normal form. 0/1411 useless extension candidates. Maximal degree in co-relation 5604. Up to 618 conditions per place. [2023-12-05 21:12:53,165 INFO L140 encePairwiseOnDemand]: 184/190 looper letters, 43 selfloop transitions, 30 changer transitions 5/334 dead transitions. [2023-12-05 21:12:53,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 334 transitions, 4629 flow [2023-12-05 21:12:53,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-05 21:12:53,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-12-05 21:12:53,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5114 transitions. [2023-12-05 21:12:53,169 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8971929824561403 [2023-12-05 21:12:53,169 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 5114 transitions. [2023-12-05 21:12:53,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 5114 transitions. [2023-12-05 21:12:53,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:53,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 5114 transitions. [2023-12-05 21:12:53,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 170.46666666666667) internal successors, (5114), 30 states have internal predecessors, (5114), 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-12-05 21:12:53,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 190.0) internal successors, (5890), 31 states have internal predecessors, (5890), 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-12-05 21:12:53,183 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 190.0) internal successors, (5890), 31 states have internal predecessors, (5890), 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-12-05 21:12:53,183 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, 204 predicate places. [2023-12-05 21:12:53,183 INFO L500 AbstractCegarLoop]: Abstraction has has 391 places, 334 transitions, 4629 flow [2023-12-05 21:12:53,184 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 170.8695652173913) internal successors, (3930), 23 states have internal predecessors, (3930), 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-12-05 21:12:53,184 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:53,184 INFO L233 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 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-12-05 21:12:53,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-05 21:12:53,394 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-05 21:12:53,394 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:12:53,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:53,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1913482700, now seen corresponding path program 2 times [2023-12-05 21:12:53,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:53,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047378115] [2023-12-05 21:12:53,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:53,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:57,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2315 backedges. 0 proven. 370 refuted. 0 times theorem prover too weak. 1945 trivial. 0 not checked. [2023-12-05 21:12:57,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:57,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047378115] [2023-12-05 21:12:57,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047378115] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:12:57,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232467075] [2023-12-05 21:12:57,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-05 21:12:57,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:57,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:12:57,322 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:12:57,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-05 21:12:57,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-05 21:12:57,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-05 21:12:57,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 2431 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-05 21:12:57,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:12:57,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-05 21:12:57,975 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-05 21:12:57,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-05 21:12:58,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:12:58,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-05 21:12:58,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:12:58,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-05 21:12:58,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:12:58,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-05 21:12:58,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:12:58,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-05 21:12:58,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:12:58,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-05 21:12:58,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:12:58,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-05 21:12:58,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:12:58,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-05 21:12:58,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:12:58,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-05 21:12:58,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:12:58,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-05 21:12:58,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:12:58,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-05 21:12:58,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:12:58,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-05 21:12:58,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:12:58,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-05 21:12:58,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:12:58,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-05 21:12:58,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:12:58,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-05 21:12:58,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:12:58,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-05 21:12:58,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:12:58,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-05 21:12:58,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:12:58,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-05 21:12:59,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:12:59,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-05 21:12:59,087 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-05 21:12:59,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-12-05 21:12:59,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2315 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 1937 trivial. 0 not checked. [2023-12-05 21:12:59,121 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:13:00,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2315 backedges. 54 proven. 370 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2023-12-05 21:13:00,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232467075] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:13:00,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:13:00,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2023-12-05 21:13:00,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423416675] [2023-12-05 21:13:00,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:13:00,875 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-05 21:13:00,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:00,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-05 21:13:00,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2023-12-05 21:13:00,877 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 190 [2023-12-05 21:13:00,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 334 transitions, 4629 flow. Second operand has 12 states, 12 states have (on average 123.83333333333333) internal successors, (1486), 12 states have internal predecessors, (1486), 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-12-05 21:13:00,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:00,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 190 [2023-12-05 21:13:00,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:01,465 INFO L124 PetriNetUnfolderBase]: 274/1480 cut-off events. [2023-12-05 21:13:01,465 INFO L125 PetriNetUnfolderBase]: For 21048/21748 co-relation queries the response was YES. [2023-12-05 21:13:01,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10085 conditions, 1480 events. 274/1480 cut-off events. For 21048/21748 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 6477 event pairs, 210 based on Foata normal form. 10/1455 useless extension candidates. Maximal degree in co-relation 6296. Up to 632 conditions per place. [2023-12-05 21:13:01,477 INFO L140 encePairwiseOnDemand]: 183/190 looper letters, 114 selfloop transitions, 14 changer transitions 5/333 dead transitions. [2023-12-05 21:13:01,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 333 transitions, 4879 flow [2023-12-05 21:13:01,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:13:01,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:13:01,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions. [2023-12-05 21:13:01,478 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7065789473684211 [2023-12-05 21:13:01,478 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 537 transitions. [2023-12-05 21:13:01,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions. [2023-12-05 21:13:01,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:01,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions. [2023-12-05 21:13:01,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 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-12-05 21:13:01,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 190.0) internal successors, (950), 5 states have internal predecessors, (950), 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-12-05 21:13:01,480 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 190.0) internal successors, (950), 5 states have internal predecessors, (950), 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-12-05 21:13:01,480 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, 206 predicate places. [2023-12-05 21:13:01,480 INFO L500 AbstractCegarLoop]: Abstraction has has 393 places, 333 transitions, 4879 flow [2023-12-05 21:13:01,480 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 123.83333333333333) internal successors, (1486), 12 states have internal predecessors, (1486), 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-12-05 21:13:01,481 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:01,481 INFO L233 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 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-12-05 21:13:01,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-05 21:13:01,690 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-05 21:13:01,690 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:13:01,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:01,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1913482701, now seen corresponding path program 3 times [2023-12-05 21:13:01,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:01,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529957176] [2023-12-05 21:13:01,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:01,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:05,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2315 backedges. 0 proven. 1214 refuted. 0 times theorem prover too weak. 1101 trivial. 0 not checked. [2023-12-05 21:13:05,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:05,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529957176] [2023-12-05 21:13:05,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529957176] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:13:05,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366632890] [2023-12-05 21:13:05,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-05 21:13:05,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:13:05,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:13:05,707 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:13:05,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process Received shutdown request... [2023-12-05 21:16:55,744 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-05 21:16:55,744 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-05 21:16:56,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2023-12-05 21:16:56,951 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forcibly destroying the process [2023-12-05 21:16:56,962 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-05 21:16:56,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-05 21:16:56,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2023-12-05 21:16:56,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292103162] [2023-12-05 21:16:56,963 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-05 21:16:56,963 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-05 21:16:56,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:56,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-05 21:16:56,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-12-05 21:16:56,964 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 190 [2023-12-05 21:16:56,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 333 transitions, 4879 flow. Second operand has 10 states, 10 states have (on average 124.4) internal successors, (1244), 10 states have internal predecessors, (1244), 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-12-05 21:16:56,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:56,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 190 [2023-12-05 21:16:56,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:56,969 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 51 remaining) [2023-12-05 21:16:56,970 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forcibly destroying the process [2023-12-05 21:16:56,970 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:16:56,970 WARN L624 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-12-05 21:16:56,971 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 51 remaining) [2023-12-05 21:16:56,971 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 51 remaining) [2023-12-05 21:16:56,971 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 51 remaining) [2023-12-05 21:16:56,971 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 51 remaining) [2023-12-05 21:16:56,971 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 51 remaining) [2023-12-05 21:16:56,972 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 51 remaining) [2023-12-05 21:16:56,972 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 51 remaining) [2023-12-05 21:16:56,972 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 51 remaining) [2023-12-05 21:16:56,972 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 51 remaining) [2023-12-05 21:16:56,972 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 51 remaining) [2023-12-05 21:16:56,972 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 51 remaining) [2023-12-05 21:16:56,972 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 51 remaining) [2023-12-05 21:16:56,972 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 51 remaining) [2023-12-05 21:16:56,973 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 51 remaining) [2023-12-05 21:16:56,973 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 51 remaining) [2023-12-05 21:16:56,973 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 51 remaining) [2023-12-05 21:16:56,973 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 51 remaining) [2023-12-05 21:16:56,973 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 51 remaining) [2023-12-05 21:16:56,973 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 51 remaining) [2023-12-05 21:16:56,973 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 51 remaining) [2023-12-05 21:16:56,973 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 51 remaining) [2023-12-05 21:16:56,973 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 51 remaining) [2023-12-05 21:16:56,974 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 51 remaining) [2023-12-05 21:16:56,974 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 51 remaining) [2023-12-05 21:16:56,974 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 51 remaining) [2023-12-05 21:16:56,974 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 51 remaining) [2023-12-05 21:16:56,974 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 51 remaining) [2023-12-05 21:16:56,974 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 51 remaining) [2023-12-05 21:16:56,974 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 51 remaining) [2023-12-05 21:16:56,974 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 51 remaining) [2023-12-05 21:16:56,974 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 51 remaining) [2023-12-05 21:16:56,974 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 51 remaining) [2023-12-05 21:16:56,974 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 51 remaining) [2023-12-05 21:16:56,974 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 51 remaining) [2023-12-05 21:16:56,974 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 51 remaining) [2023-12-05 21:16:56,974 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 51 remaining) [2023-12-05 21:16:56,974 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 51 remaining) [2023-12-05 21:16:56,974 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 51 remaining) [2023-12-05 21:16:56,974 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 51 remaining) [2023-12-05 21:16:56,975 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 51 remaining) [2023-12-05 21:16:56,975 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 51 remaining) [2023-12-05 21:16:56,975 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 51 remaining) [2023-12-05 21:16:56,975 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 51 remaining) [2023-12-05 21:16:56,975 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 51 remaining) [2023-12-05 21:16:56,975 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 51 remaining) [2023-12-05 21:16:56,975 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 51 remaining) [2023-12-05 21:16:56,975 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 51 remaining) [2023-12-05 21:16:56,975 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 51 remaining) [2023-12-05 21:16:56,975 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 51 remaining) [2023-12-05 21:16:56,975 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 51 remaining) [2023-12-05 21:16:56,976 INFO L457 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:56,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 137 [2023-12-05 21:16:56,982 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:16:56,982 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:16:56,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:16:56 BasicIcfg [2023-12-05 21:16:56,985 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:16:56,988 INFO L158 Benchmark]: Toolchain (without parser) took 268372.45ms. Allocated memory was 198.2MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 148.2MB in the beginning and 708.7MB in the end (delta: -560.5MB). Peak memory consumption was 583.3MB. Max. memory is 8.0GB. [2023-12-05 21:16:56,988 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 198.2MB. Free memory is still 152.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:16:56,989 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.88ms. Allocated memory is still 198.2MB. Free memory was 148.2MB in the beginning and 108.4MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. [2023-12-05 21:16:56,989 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.78ms. Allocated memory is still 198.2MB. Free memory was 108.4MB in the beginning and 105.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:16:56,989 INFO L158 Benchmark]: Boogie Preprocessor took 33.11ms. Allocated memory is still 198.2MB. Free memory was 105.2MB in the beginning and 103.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:16:56,989 INFO L158 Benchmark]: RCFGBuilder took 490.63ms. Allocated memory was 198.2MB in the beginning and 238.0MB in the end (delta: 39.8MB). Free memory was 103.1MB in the beginning and 182.8MB in the end (delta: -79.7MB). Peak memory consumption was 3.5MB. Max. memory is 8.0GB. [2023-12-05 21:16:56,989 INFO L158 Benchmark]: TraceAbstraction took 267247.10ms. Allocated memory was 238.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 182.3MB in the beginning and 708.7MB in the end (delta: -526.4MB). Peak memory consumption was 577.7MB. Max. memory is 8.0GB. [2023-12-05 21:16:56,990 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 198.2MB. Free memory is still 152.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 549.88ms. Allocated memory is still 198.2MB. Free memory was 148.2MB in the beginning and 108.4MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.78ms. Allocated memory is still 198.2MB. Free memory was 108.4MB in the beginning and 105.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.11ms. Allocated memory is still 198.2MB. Free memory was 105.2MB in the beginning and 103.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 490.63ms. Allocated memory was 198.2MB in the beginning and 238.0MB in the end (delta: 39.8MB). Free memory was 103.1MB in the beginning and 182.8MB in the end (delta: -79.7MB). Peak memory consumption was 3.5MB. Max. memory is 8.0GB. * TraceAbstraction took 267247.10ms. Allocated memory was 238.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 182.3MB in the beginning and 708.7MB in the end (delta: -526.4MB). Peak memory consumption was 577.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1266]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 244 locations, 51 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: 267.1s, OverallIterations: 19, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1572 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1572 mSDsluCounter, 1061 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 138 IncrementalHoareTripleChecker+Unchecked, 733 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4291 IncrementalHoareTripleChecker+Invalid, 4548 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 328 mSDtfsCounter, 4291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3642 GetRequests, 3240 SyntacticMatches, 44 SemanticMatches, 358 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2721 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4879occurred in iteration=18, InterpolantAutomatonStates: 244, 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.4s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 21.3s InterpolantComputationTime, 4596 NumberOfCodeBlocks, 4561 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 6136 ConstructedInterpolants, 544 QuantifiedInterpolants, 48347 SizeOfPredicates, 85 NumberOfNonLiveVariables, 6398 ConjunctsInSsa, 156 ConjunctsInUnsatCore, 37 InterpolantComputations, 10 PerfectInterpolantSequences, 11289/17517 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown