/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_09-arraylist.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:12:25,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:12:25,082 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:25,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:12:25,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:12:25,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:12:25,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:12:25,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:12:25,107 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:12:25,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:12:25,110 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:12:25,110 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:12:25,111 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:12:25,111 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:12:25,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:12:25,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:12:25,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:12:25,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:12:25,112 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:12:25,112 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:12:25,113 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:12:25,113 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:12:25,113 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:12:25,113 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:12:25,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:12:25,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:12:25,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:12:25,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:12:25,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:12:25,115 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:12:25,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:12:25,116 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:12:25,116 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:12:25,116 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:25,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:12:25,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:12:25,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:12:25,315 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:12:25,315 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:12:25,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_09-arraylist.i [2023-12-05 21:12:26,445 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:12:26,668 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:12:26,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_09-arraylist.i [2023-12-05 21:12:26,682 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d885e72b8/6be56ead6e4846ec895949edc741b04a/FLAG93d8ea7db [2023-12-05 21:12:26,693 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d885e72b8/6be56ead6e4846ec895949edc741b04a [2023-12-05 21:12:26,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:12:26,696 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:12:26,696 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:12:26,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:12:26,699 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:12:26,700 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:12:26" (1/1) ... [2023-12-05 21:12:26,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49a9ff38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:26, skipping insertion in model container [2023-12-05 21:12:26,701 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:12:26" (1/1) ... [2023-12-05 21:12:26,748 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:12:27,143 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:12:27,152 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:12:27,239 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:12:27,310 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:12:27,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:27 WrapperNode [2023-12-05 21:12:27,311 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:12:27,311 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:12:27,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:12:27,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:12:27,316 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:27" (1/1) ... [2023-12-05 21:12:27,329 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:27" (1/1) ... [2023-12-05 21:12:27,346 INFO L138 Inliner]: procedures = 372, calls = 37, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 127 [2023-12-05 21:12:27,347 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:12:27,347 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:12:27,347 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:12:27,347 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:12:27,353 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:27" (1/1) ... [2023-12-05 21:12:27,354 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:27" (1/1) ... [2023-12-05 21:12:27,363 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:27" (1/1) ... [2023-12-05 21:12:27,363 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:27" (1/1) ... [2023-12-05 21:12:27,369 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:27" (1/1) ... [2023-12-05 21:12:27,371 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:27" (1/1) ... [2023-12-05 21:12:27,372 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:27" (1/1) ... [2023-12-05 21:12:27,373 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:27" (1/1) ... [2023-12-05 21:12:27,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:12:27,376 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:12:27,377 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:12:27,377 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:12:27,377 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:27" (1/1) ... [2023-12-05 21:12:27,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:12:27,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:12:27,404 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:27,407 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:27,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:12:27,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-05 21:12:27,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:12:27,429 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:12:27,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:12:27,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:12:27,429 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:12:27,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-05 21:12:27,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:12:27,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-05 21:12:27,430 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-05 21:12:27,430 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-05 21:12:27,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:12:27,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:12:27,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:12:27,431 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:27,552 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:12:27,554 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:12:27,888 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:12:27,901 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:12:27,901 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-05 21:12:27,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:12:27 BoogieIcfgContainer [2023-12-05 21:12:27,902 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:12:27,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:12:27,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:12:27,908 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:12:27,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:12:26" (1/3) ... [2023-12-05 21:12:27,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2e6a3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:12:27, skipping insertion in model container [2023-12-05 21:12:27,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:27" (2/3) ... [2023-12-05 21:12:27,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2e6a3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:12:27, skipping insertion in model container [2023-12-05 21:12:27,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:12:27" (3/3) ... [2023-12-05 21:12:27,911 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_09-arraylist.i [2023-12-05 21:12:27,922 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:12:27,923 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2023-12-05 21:12:27,923 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:12:27,994 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:12:28,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 187 transitions, 378 flow [2023-12-05 21:12:28,085 INFO L124 PetriNetUnfolderBase]: 4/186 cut-off events. [2023-12-05 21:12:28,086 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:12:28,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 186 events. 4/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 394 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-12-05 21:12:28,090 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 187 transitions, 378 flow [2023-12-05 21:12:28,093 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 186 places, 186 transitions, 375 flow [2023-12-05 21:12:28,099 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:12:28,106 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;@45a086f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:12:28,106 INFO L363 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2023-12-05 21:12:28,120 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:12:28,120 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2023-12-05 21:12:28,120 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:12:28,120 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:28,121 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] [2023-12-05 21:12:28,121 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:28,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:28,124 INFO L85 PathProgramCache]: Analyzing trace with hash -718043602, now seen corresponding path program 1 times [2023-12-05 21:12:28,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:28,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515749382] [2023-12-05 21:12:28,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:28,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:28,305 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:28,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:28,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515749382] [2023-12-05 21:12:28,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515749382] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:28,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:28,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:12:28,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941828207] [2023-12-05 21:12:28,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:28,313 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:12:28,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:28,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:12:28,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:12:28,333 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 187 [2023-12-05 21:12:28,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 186 transitions, 375 flow. Second operand has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 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:28,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:28,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 187 [2023-12-05 21:12:28,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:28,400 INFO L124 PetriNetUnfolderBase]: 7/300 cut-off events. [2023-12-05 21:12:28,400 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-05 21:12:28,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 300 events. 7/300 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 745 event pairs, 6 based on Foata normal form. 4/233 useless extension candidates. Maximal degree in co-relation 180. Up to 30 conditions per place. [2023-12-05 21:12:28,402 INFO L140 encePairwiseOnDemand]: 181/187 looper letters, 22 selfloop transitions, 2 changer transitions 1/190 dead transitions. [2023-12-05 21:12:28,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 190 transitions, 431 flow [2023-12-05 21:12:28,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:12:28,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:12:28,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 530 transitions. [2023-12-05 21:12:28,428 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9447415329768271 [2023-12-05 21:12:28,429 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 530 transitions. [2023-12-05 21:12:28,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 530 transitions. [2023-12-05 21:12:28,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:28,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 530 transitions. [2023-12-05 21:12:28,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 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:28,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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:28,440 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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:28,442 INFO L308 CegarLoopForPetriNet]: 186 programPoint places, 2 predicate places. [2023-12-05 21:12:28,442 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 190 transitions, 431 flow [2023-12-05 21:12:28,443 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 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:28,443 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:28,443 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] [2023-12-05 21:12:28,443 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:12:28,443 INFO L425 AbstractCegarLoop]: === Iteration 2 === 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:28,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:28,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1563098668, now seen corresponding path program 1 times [2023-12-05 21:12:28,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:28,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261973963] [2023-12-05 21:12:28,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:28,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:28,575 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:28,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:28,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261973963] [2023-12-05 21:12:28,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261973963] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:28,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:28,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:12:28,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468024269] [2023-12-05 21:12:28,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:28,577 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:12:28,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:28,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:12:28,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:12:28,578 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 187 [2023-12-05 21:12:28,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 190 transitions, 431 flow. Second operand has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 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:28,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:28,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 187 [2023-12-05 21:12:28,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:28,824 INFO L124 PetriNetUnfolderBase]: 138/761 cut-off events. [2023-12-05 21:12:28,824 INFO L125 PetriNetUnfolderBase]: For 55/61 co-relation queries the response was YES. [2023-12-05 21:12:28,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1209 conditions, 761 events. 138/761 cut-off events. For 55/61 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4252 event pairs, 137 based on Foata normal form. 0/622 useless extension candidates. Maximal degree in co-relation 962. Up to 332 conditions per place. [2023-12-05 21:12:28,828 INFO L140 encePairwiseOnDemand]: 175/187 looper letters, 55 selfloop transitions, 8 changer transitions 1/186 dead transitions. [2023-12-05 21:12:28,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 186 transitions, 549 flow [2023-12-05 21:12:28,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-05 21:12:28,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-05 21:12:28,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2023-12-05 21:12:28,830 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2023-12-05 21:12:28,830 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 660 transitions. [2023-12-05 21:12:28,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 660 transitions. [2023-12-05 21:12:28,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:28,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 660 transitions. [2023-12-05 21:12:28,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 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:28,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 187.0) internal successors, (1122), 6 states have internal predecessors, (1122), 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:28,834 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 187.0) internal successors, (1122), 6 states have internal predecessors, (1122), 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:28,835 INFO L308 CegarLoopForPetriNet]: 186 programPoint places, 2 predicate places. [2023-12-05 21:12:28,835 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 186 transitions, 549 flow [2023-12-05 21:12:28,835 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 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:28,835 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:28,835 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] [2023-12-05 21:12:28,835 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:12:28,836 INFO L425 AbstractCegarLoop]: === Iteration 3 === 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:28,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:28,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1563098667, now seen corresponding path program 1 times [2023-12-05 21:12:28,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:28,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661752050] [2023-12-05 21:12:28,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:28,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:28,977 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:28,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:28,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661752050] [2023-12-05 21:12:28,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661752050] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:28,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:28,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:12:28,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604853081] [2023-12-05 21:12:28,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:28,978 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:12:28,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:28,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:12:28,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:12:28,980 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 187 [2023-12-05 21:12:28,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 186 transitions, 549 flow. Second operand has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 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:28,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:28,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 187 [2023-12-05 21:12:28,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:29,191 INFO L124 PetriNetUnfolderBase]: 213/953 cut-off events. [2023-12-05 21:12:29,191 INFO L125 PetriNetUnfolderBase]: For 321/380 co-relation queries the response was YES. [2023-12-05 21:12:29,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1894 conditions, 953 events. 213/953 cut-off events. For 321/380 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 5930 event pairs, 212 based on Foata normal form. 0/929 useless extension candidates. Maximal degree in co-relation 1604. Up to 405 conditions per place. [2023-12-05 21:12:29,196 INFO L140 encePairwiseOnDemand]: 175/187 looper letters, 51 selfloop transitions, 8 changer transitions 1/182 dead transitions. [2023-12-05 21:12:29,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 182 transitions, 651 flow [2023-12-05 21:12:29,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-05 21:12:29,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-05 21:12:29,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 664 transitions. [2023-12-05 21:12:29,198 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7101604278074867 [2023-12-05 21:12:29,198 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 664 transitions. [2023-12-05 21:12:29,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 664 transitions. [2023-12-05 21:12:29,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:29,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 664 transitions. [2023-12-05 21:12:29,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 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:29,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 187.0) internal successors, (1122), 6 states have internal predecessors, (1122), 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:29,202 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 187.0) internal successors, (1122), 6 states have internal predecessors, (1122), 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:29,203 INFO L308 CegarLoopForPetriNet]: 186 programPoint places, 2 predicate places. [2023-12-05 21:12:29,203 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 182 transitions, 651 flow [2023-12-05 21:12:29,203 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 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:29,203 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:29,203 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, 1, 1, 1, 1] [2023-12-05 21:12:29,203 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:12:29,204 INFO L425 AbstractCegarLoop]: === Iteration 4 === 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:29,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:29,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1811731681, now seen corresponding path program 1 times [2023-12-05 21:12:29,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:29,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965285640] [2023-12-05 21:12:29,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:29,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:29,445 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:29,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:29,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965285640] [2023-12-05 21:12:29,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965285640] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:29,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:29,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:12:29,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884997523] [2023-12-05 21:12:29,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:29,446 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:12:29,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:29,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:12:29,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:12:29,448 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 187 [2023-12-05 21:12:29,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 182 transitions, 651 flow. Second operand has 7 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 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:29,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:29,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 187 [2023-12-05 21:12:29,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:29,661 INFO L124 PetriNetUnfolderBase]: 198/934 cut-off events. [2023-12-05 21:12:29,662 INFO L125 PetriNetUnfolderBase]: For 738/867 co-relation queries the response was YES. [2023-12-05 21:12:29,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2259 conditions, 934 events. 198/934 cut-off events. For 738/867 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 5738 event pairs, 181 based on Foata normal form. 32/944 useless extension candidates. Maximal degree in co-relation 1915. Up to 379 conditions per place. [2023-12-05 21:12:29,666 INFO L140 encePairwiseOnDemand]: 179/187 looper letters, 78 selfloop transitions, 4 changer transitions 5/201 dead transitions. [2023-12-05 21:12:29,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 201 transitions, 931 flow [2023-12-05 21:12:29,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-05 21:12:29,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-05 21:12:29,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 651 transitions. [2023-12-05 21:12:29,668 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6962566844919786 [2023-12-05 21:12:29,668 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 651 transitions. [2023-12-05 21:12:29,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 651 transitions. [2023-12-05 21:12:29,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:29,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 651 transitions. [2023-12-05 21:12:29,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 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:29,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 187.0) internal successors, (1122), 6 states have internal predecessors, (1122), 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:29,672 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 187.0) internal successors, (1122), 6 states have internal predecessors, (1122), 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:29,672 INFO L308 CegarLoopForPetriNet]: 186 programPoint places, 3 predicate places. [2023-12-05 21:12:29,673 INFO L500 AbstractCegarLoop]: Abstraction has has 189 places, 201 transitions, 931 flow [2023-12-05 21:12:29,673 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 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:29,673 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:29,673 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, 1, 1, 1, 1] [2023-12-05 21:12:29,673 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:12:29,674 INFO L425 AbstractCegarLoop]: === Iteration 5 === 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:29,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:29,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1811731682, now seen corresponding path program 1 times [2023-12-05 21:12:29,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:29,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962623957] [2023-12-05 21:12:29,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:29,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:29,882 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:29,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:29,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962623957] [2023-12-05 21:12:29,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962623957] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:29,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:29,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 21:12:29,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358924606] [2023-12-05 21:12:29,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:29,884 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 21:12:29,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:29,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 21:12:29,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-05 21:12:29,885 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 187 [2023-12-05 21:12:29,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 201 transitions, 931 flow. Second operand has 8 states, 8 states have (on average 98.125) internal successors, (785), 8 states have internal predecessors, (785), 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:29,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:29,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 187 [2023-12-05 21:12:29,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:30,203 INFO L124 PetriNetUnfolderBase]: 269/1128 cut-off events. [2023-12-05 21:12:30,203 INFO L125 PetriNetUnfolderBase]: For 1571/1792 co-relation queries the response was YES. [2023-12-05 21:12:30,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3348 conditions, 1128 events. 269/1128 cut-off events. For 1571/1792 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7368 event pairs, 201 based on Foata normal form. 13/1117 useless extension candidates. Maximal degree in co-relation 2939. Up to 504 conditions per place. [2023-12-05 21:12:30,209 INFO L140 encePairwiseOnDemand]: 178/187 looper letters, 140 selfloop transitions, 7 changer transitions 7/248 dead transitions. [2023-12-05 21:12:30,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 248 transitions, 1535 flow [2023-12-05 21:12:30,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 21:12:30,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 21:12:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 724 transitions. [2023-12-05 21:12:30,211 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6452762923351159 [2023-12-05 21:12:30,211 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 724 transitions. [2023-12-05 21:12:30,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 724 transitions. [2023-12-05 21:12:30,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:30,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 724 transitions. [2023-12-05 21:12:30,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.66666666666667) internal successors, (724), 6 states have internal predecessors, (724), 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,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 187.0) internal successors, (1309), 7 states have internal predecessors, (1309), 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,214 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 187.0) internal successors, (1309), 7 states have internal predecessors, (1309), 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,215 INFO L308 CegarLoopForPetriNet]: 186 programPoint places, 8 predicate places. [2023-12-05 21:12:30,215 INFO L500 AbstractCegarLoop]: Abstraction has has 194 places, 248 transitions, 1535 flow [2023-12-05 21:12:30,216 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.125) internal successors, (785), 8 states have internal predecessors, (785), 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,216 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:30,216 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, 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,216 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:12:30,216 INFO L425 AbstractCegarLoop]: === Iteration 6 === 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:30,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:30,216 INFO L85 PathProgramCache]: Analyzing trace with hash 16406645, now seen corresponding path program 1 times [2023-12-05 21:12:30,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:30,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847081878] [2023-12-05 21:12:30,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:30,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:30,592 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,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:30,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847081878] [2023-12-05 21:12:30,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847081878] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:30,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:30,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-05 21:12:30,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138223371] [2023-12-05 21:12:30,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:30,598 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-05 21:12:30,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:30,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-05 21:12:30,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2023-12-05 21:12:30,601 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 187 [2023-12-05 21:12:30,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 248 transitions, 1535 flow. Second operand has 15 states, 15 states have (on average 94.4) internal successors, (1416), 15 states have internal predecessors, (1416), 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,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:30,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 187 [2023-12-05 21:12:30,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:31,316 INFO L124 PetriNetUnfolderBase]: 269/1124 cut-off events. [2023-12-05 21:12:31,316 INFO L125 PetriNetUnfolderBase]: For 2492/2784 co-relation queries the response was YES. [2023-12-05 21:12:31,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3905 conditions, 1124 events. 269/1124 cut-off events. For 2492/2784 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7340 event pairs, 201 based on Foata normal form. 15/1115 useless extension candidates. Maximal degree in co-relation 3420. Up to 502 conditions per place. [2023-12-05 21:12:31,322 INFO L140 encePairwiseOnDemand]: 161/187 looper letters, 102 selfloop transitions, 35 changer transitions 7/245 dead transitions. [2023-12-05 21:12:31,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 245 transitions, 1791 flow [2023-12-05 21:12:31,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-05 21:12:31,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-12-05 21:12:31,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2214 transitions. [2023-12-05 21:12:31,327 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5147640083701465 [2023-12-05 21:12:31,327 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2214 transitions. [2023-12-05 21:12:31,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2214 transitions. [2023-12-05 21:12:31,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:31,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2214 transitions. [2023-12-05 21:12:31,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 96.26086956521739) internal successors, (2214), 23 states have internal predecessors, (2214), 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,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 187.0) internal successors, (4488), 24 states have internal predecessors, (4488), 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,336 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 187.0) internal successors, (4488), 24 states have internal predecessors, (4488), 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,337 INFO L308 CegarLoopForPetriNet]: 186 programPoint places, 28 predicate places. [2023-12-05 21:12:31,337 INFO L500 AbstractCegarLoop]: Abstraction has has 214 places, 245 transitions, 1791 flow [2023-12-05 21:12:31,337 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 94.4) internal successors, (1416), 15 states have internal predecessors, (1416), 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,337 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:31,338 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, 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,338 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:12:31,338 INFO L425 AbstractCegarLoop]: === Iteration 7 === 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:31,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:31,338 INFO L85 PathProgramCache]: Analyzing trace with hash 16406646, now seen corresponding path program 1 times [2023-12-05 21:12:31,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:31,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604238474] [2023-12-05 21:12:31,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:31,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:31,840 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:31,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:31,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604238474] [2023-12-05 21:12:31,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604238474] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:31,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:31,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-05 21:12:31,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581712203] [2023-12-05 21:12:31,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:31,841 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-05 21:12:31,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:31,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-05 21:12:31,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2023-12-05 21:12:31,843 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 187 [2023-12-05 21:12:31,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 245 transitions, 1791 flow. Second operand has 14 states, 14 states have (on average 85.57142857142857) internal successors, (1198), 14 states have internal predecessors, (1198), 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,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:31,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 187 [2023-12-05 21:12:31,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:32,666 INFO L124 PetriNetUnfolderBase]: 269/1120 cut-off events. [2023-12-05 21:12:32,666 INFO L125 PetriNetUnfolderBase]: For 3547/3943 co-relation queries the response was YES. [2023-12-05 21:12:32,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4584 conditions, 1120 events. 269/1120 cut-off events. For 3547/3943 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7388 event pairs, 201 based on Foata normal form. 17/1113 useless extension candidates. Maximal degree in co-relation 4024. Up to 500 conditions per place. [2023-12-05 21:12:32,671 INFO L140 encePairwiseOnDemand]: 160/187 looper letters, 118 selfloop transitions, 38 changer transitions 7/244 dead transitions. [2023-12-05 21:12:32,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 244 transitions, 2101 flow [2023-12-05 21:12:32,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-05 21:12:32,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-12-05 21:12:32,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2102 transitions. [2023-12-05 21:12:32,675 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4683600713012478 [2023-12-05 21:12:32,676 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2102 transitions. [2023-12-05 21:12:32,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2102 transitions. [2023-12-05 21:12:32,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:32,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2102 transitions. [2023-12-05 21:12:32,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 87.58333333333333) internal successors, (2102), 24 states have internal predecessors, (2102), 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,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 187.0) internal successors, (4675), 25 states have internal predecessors, (4675), 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,685 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 187.0) internal successors, (4675), 25 states have internal predecessors, (4675), 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,685 INFO L308 CegarLoopForPetriNet]: 186 programPoint places, 49 predicate places. [2023-12-05 21:12:32,685 INFO L500 AbstractCegarLoop]: Abstraction has has 235 places, 244 transitions, 2101 flow [2023-12-05 21:12:32,686 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 85.57142857142857) internal successors, (1198), 14 states have internal predecessors, (1198), 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,686 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:32,686 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, 1, 1, 1, 1, 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,686 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:12:32,686 INFO L425 AbstractCegarLoop]: === Iteration 8 === 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:32,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:32,686 INFO L85 PathProgramCache]: Analyzing trace with hash -754239621, now seen corresponding path program 1 times [2023-12-05 21:12:32,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:32,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271967790] [2023-12-05 21:12:32,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:32,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:32,842 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:32,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:32,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271967790] [2023-12-05 21:12:32,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271967790] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:32,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:32,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 21:12:32,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169877716] [2023-12-05 21:12:32,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:32,843 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 21:12:32,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:32,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 21:12:32,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-05 21:12:32,844 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 187 [2023-12-05 21:12:32,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 244 transitions, 2101 flow. Second operand has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 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,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:32,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 187 [2023-12-05 21:12:32,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:33,157 INFO L124 PetriNetUnfolderBase]: 269/1118 cut-off events. [2023-12-05 21:12:33,157 INFO L125 PetriNetUnfolderBase]: For 4742/5189 co-relation queries the response was YES. [2023-12-05 21:12:33,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5106 conditions, 1118 events. 269/1118 cut-off events. For 4742/5189 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7328 event pairs, 201 based on Foata normal form. 3/1097 useless extension candidates. Maximal degree in co-relation 4480. Up to 499 conditions per place. [2023-12-05 21:12:33,164 INFO L140 encePairwiseOnDemand]: 168/187 looper letters, 91 selfloop transitions, 26 changer transitions 7/242 dead transitions. [2023-12-05 21:12:33,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 242 transitions, 2331 flow [2023-12-05 21:12:33,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-05 21:12:33,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-05 21:12:33,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1255 transitions. [2023-12-05 21:12:33,167 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6101118133203695 [2023-12-05 21:12:33,167 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1255 transitions. [2023-12-05 21:12:33,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1255 transitions. [2023-12-05 21:12:33,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:33,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1255 transitions. [2023-12-05 21:12:33,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 114.0909090909091) internal successors, (1255), 11 states have internal predecessors, (1255), 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,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 187.0) internal successors, (2244), 12 states have internal predecessors, (2244), 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,173 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 187.0) internal successors, (2244), 12 states have internal predecessors, (2244), 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,173 INFO L308 CegarLoopForPetriNet]: 186 programPoint places, 58 predicate places. [2023-12-05 21:12:33,173 INFO L500 AbstractCegarLoop]: Abstraction has has 244 places, 242 transitions, 2331 flow [2023-12-05 21:12:33,174 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 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,174 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:33,174 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, 1, 1, 1, 1, 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,174 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:12:33,174 INFO L425 AbstractCegarLoop]: === Iteration 9 === 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:33,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:33,174 INFO L85 PathProgramCache]: Analyzing trace with hash -754239622, now seen corresponding path program 1 times [2023-12-05 21:12:33,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:33,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994275161] [2023-12-05 21:12:33,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:33,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:33,282 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:33,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:33,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994275161] [2023-12-05 21:12:33,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994275161] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:33,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:33,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:12:33,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202554023] [2023-12-05 21:12:33,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:33,283 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:12:33,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:33,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:12:33,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:12:33,285 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 187 [2023-12-05 21:12:33,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 242 transitions, 2331 flow. Second operand has 7 states, 7 states have (on average 112.42857142857143) internal successors, (787), 7 states have internal predecessors, (787), 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,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:33,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 187 [2023-12-05 21:12:33,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:33,540 INFO L124 PetriNetUnfolderBase]: 269/1116 cut-off events. [2023-12-05 21:12:33,540 INFO L125 PetriNetUnfolderBase]: For 6211/6730 co-relation queries the response was YES. [2023-12-05 21:12:33,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5604 conditions, 1116 events. 269/1116 cut-off events. For 6211/6730 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7315 event pairs, 201 based on Foata normal form. 12/1104 useless extension candidates. Maximal degree in co-relation 4925. Up to 498 conditions per place. [2023-12-05 21:12:33,547 INFO L140 encePairwiseOnDemand]: 171/187 looper letters, 90 selfloop transitions, 19 changer transitions 7/240 dead transitions. [2023-12-05 21:12:33,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 240 transitions, 2533 flow [2023-12-05 21:12:33,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 21:12:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 21:12:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1049 transitions. [2023-12-05 21:12:33,550 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6232917409387998 [2023-12-05 21:12:33,550 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1049 transitions. [2023-12-05 21:12:33,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1049 transitions. [2023-12-05 21:12:33,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:33,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1049 transitions. [2023-12-05 21:12:33,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 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,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 187.0) internal successors, (1870), 10 states have internal predecessors, (1870), 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,554 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 187.0) internal successors, (1870), 10 states have internal predecessors, (1870), 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,555 INFO L308 CegarLoopForPetriNet]: 186 programPoint places, 65 predicate places. [2023-12-05 21:12:33,555 INFO L500 AbstractCegarLoop]: Abstraction has has 251 places, 240 transitions, 2533 flow [2023-12-05 21:12:33,555 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.42857142857143) internal successors, (787), 7 states have internal predecessors, (787), 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,555 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:33,555 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,555 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:12:33,555 INFO L425 AbstractCegarLoop]: === Iteration 10 === 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:33,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:33,556 INFO L85 PathProgramCache]: Analyzing trace with hash 431392053, now seen corresponding path program 1 times [2023-12-05 21:12:33,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:33,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953004033] [2023-12-05 21:12:33,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:33,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:33,623 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:33,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:33,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953004033] [2023-12-05 21:12:33,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953004033] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:12:33,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358521532] [2023-12-05 21:12:33,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:33,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:33,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:12:33,626 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:33,657 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:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:33,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-05 21:12:33,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:12:33,899 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:33,900 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:12:33,988 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:33,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358521532] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:12:33,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:12:33,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-05 21:12:33,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402667727] [2023-12-05 21:12:33,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:12:33,989 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-05 21:12:33,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:33,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-05 21:12:33,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-05 21:12:33,991 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 187 [2023-12-05 21:12:33,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 240 transitions, 2533 flow. Second operand has 10 states, 10 states have (on average 168.4) internal successors, (1684), 10 states have internal predecessors, (1684), 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,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:33,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 187 [2023-12-05 21:12:33,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:34,217 INFO L124 PetriNetUnfolderBase]: 269/1166 cut-off events. [2023-12-05 21:12:34,218 INFO L125 PetriNetUnfolderBase]: For 7354/7869 co-relation queries the response was YES. [2023-12-05 21:12:34,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6046 conditions, 1166 events. 269/1166 cut-off events. For 7354/7869 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 6996 event pairs, 201 based on Foata normal form. 1/1143 useless extension candidates. Maximal degree in co-relation 5050. Up to 523 conditions per place. [2023-12-05 21:12:34,225 INFO L140 encePairwiseOnDemand]: 181/187 looper letters, 27 selfloop transitions, 9 changer transitions 7/250 dead transitions. [2023-12-05 21:12:34,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 250 transitions, 2727 flow [2023-12-05 21:12:34,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 21:12:34,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 21:12:34,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1529 transitions. [2023-12-05 21:12:34,229 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9084967320261438 [2023-12-05 21:12:34,229 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1529 transitions. [2023-12-05 21:12:34,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1529 transitions. [2023-12-05 21:12:34,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:34,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1529 transitions. [2023-12-05 21:12:34,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 169.88888888888889) internal successors, (1529), 9 states have internal predecessors, (1529), 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,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 187.0) internal successors, (1870), 10 states have internal predecessors, (1870), 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,235 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 187.0) internal successors, (1870), 10 states have internal predecessors, (1870), 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,236 INFO L308 CegarLoopForPetriNet]: 186 programPoint places, 73 predicate places. [2023-12-05 21:12:34,236 INFO L500 AbstractCegarLoop]: Abstraction has has 259 places, 250 transitions, 2727 flow [2023-12-05 21:12:34,237 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 168.4) internal successors, (1684), 10 states have internal predecessors, (1684), 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,237 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:34,237 INFO L233 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1] [2023-12-05 21:12:34,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-05 21:12:34,459 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-05 21:12:34,460 INFO L425 AbstractCegarLoop]: === Iteration 11 === 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,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:34,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1447950121, now seen corresponding path program 1 times [2023-12-05 21:12:34,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:34,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020418125] [2023-12-05 21:12:34,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:34,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:35,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:35,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020418125] [2023-12-05 21:12:35,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020418125] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:12:35,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765367383] [2023-12-05 21:12:35,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:35,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:35,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:12:35,065 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:35,066 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:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:35,214 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-05 21:12:35,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:12:35,390 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-05 21:12:35,390 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 17 treesize of output 21 [2023-12-05 21:12:35,396 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:35,594 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-12-05 21:12:35,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-12-05 21:12:35,605 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:35,763 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-05 21:12:35,763 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:35,779 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:12:35,779 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:36,031 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-05 21:12:36,033 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:36,042 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:12:36,042 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:36,150 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:36,150 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:12:36,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:12:36,563 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:36,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:12:36,824 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:37,459 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:37,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765367383] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:12:37,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:12:37,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 31 [2023-12-05 21:12:37,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555763828] [2023-12-05 21:12:37,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:12:37,460 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-05 21:12:37,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:37,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-05 21:12:37,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2023-12-05 21:12:37,463 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 187 [2023-12-05 21:12:37,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 250 transitions, 2727 flow. Second operand has 32 states, 32 states have (on average 96.90625) internal successors, (3101), 32 states have internal predecessors, (3101), 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,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:37,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 187 [2023-12-05 21:12:37,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:38,539 INFO L124 PetriNetUnfolderBase]: 269/1177 cut-off events. [2023-12-05 21:12:38,539 INFO L125 PetriNetUnfolderBase]: For 9211/9841 co-relation queries the response was YES. [2023-12-05 21:12:38,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6818 conditions, 1177 events. 269/1177 cut-off events. For 9211/9841 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 7080 event pairs, 201 based on Foata normal form. 19/1172 useless extension candidates. Maximal degree in co-relation 5654. Up to 528 conditions per place. [2023-12-05 21:12:38,563 INFO L140 encePairwiseOnDemand]: 170/187 looper letters, 154 selfloop transitions, 24 changer transitions 7/277 dead transitions. [2023-12-05 21:12:38,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 277 transitions, 3569 flow [2023-12-05 21:12:38,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-05 21:12:38,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-12-05 21:12:38,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1676 transitions. [2023-12-05 21:12:38,579 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5601604278074866 [2023-12-05 21:12:38,579 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1676 transitions. [2023-12-05 21:12:38,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1676 transitions. [2023-12-05 21:12:38,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:38,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1676 transitions. [2023-12-05 21:12:38,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 104.75) internal successors, (1676), 16 states have internal predecessors, (1676), 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,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 187.0) internal successors, (3179), 17 states have internal predecessors, (3179), 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,585 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 187.0) internal successors, (3179), 17 states have internal predecessors, (3179), 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,585 INFO L308 CegarLoopForPetriNet]: 186 programPoint places, 87 predicate places. [2023-12-05 21:12:38,585 INFO L500 AbstractCegarLoop]: Abstraction has has 273 places, 277 transitions, 3569 flow [2023-12-05 21:12:38,586 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 96.90625) internal successors, (3101), 32 states have internal predecessors, (3101), 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,586 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:38,587 INFO L233 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1] [2023-12-05 21:12:38,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-05 21:12:38,797 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,SelfDestructingSolverStorable10 [2023-12-05 21:12:38,797 INFO L425 AbstractCegarLoop]: === Iteration 12 === 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:38,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:38,798 INFO L85 PathProgramCache]: Analyzing trace with hash -478128509, now seen corresponding path program 2 times [2023-12-05 21:12:38,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:38,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980682509] [2023-12-05 21:12:38,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:38,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:39,033 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:39,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:39,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980682509] [2023-12-05 21:12:39,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980682509] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:12:39,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367942156] [2023-12-05 21:12:39,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-05 21:12:39,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:39,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:12:39,034 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:39,062 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:39,233 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-05 21:12:39,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-05 21:12:39,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-05 21:12:39,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:12:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:39,428 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:12:39,592 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:39,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367942156] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:12:39,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:12:39,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-12-05 21:12:39,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473383143] [2023-12-05 21:12:39,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:12:39,593 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-05 21:12:39,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:39,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-05 21:12:39,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-12-05 21:12:39,596 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 187 [2023-12-05 21:12:39,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 277 transitions, 3569 flow. Second operand has 18 states, 18 states have (on average 168.66666666666666) internal successors, (3036), 18 states have internal predecessors, (3036), 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,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:39,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 187 [2023-12-05 21:12:39,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:40,051 INFO L124 PetriNetUnfolderBase]: 269/1350 cut-off events. [2023-12-05 21:12:40,051 INFO L125 PetriNetUnfolderBase]: For 11486/12108 co-relation queries the response was YES. [2023-12-05 21:12:40,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8111 conditions, 1350 events. 269/1350 cut-off events. For 11486/12108 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7005 event pairs, 201 based on Foata normal form. 0/1326 useless extension candidates. Maximal degree in co-relation 5779. Up to 611 conditions per place. [2023-12-05 21:12:40,060 INFO L140 encePairwiseOnDemand]: 181/187 looper letters, 39 selfloop transitions, 21 changer transitions 7/303 dead transitions. [2023-12-05 21:12:40,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 303 transitions, 4115 flow [2023-12-05 21:12:40,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-05 21:12:40,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-12-05 21:12:40,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3547 transitions. [2023-12-05 21:12:40,063 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9032340208810797 [2023-12-05 21:12:40,063 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3547 transitions. [2023-12-05 21:12:40,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3547 transitions. [2023-12-05 21:12:40,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:40,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3547 transitions. [2023-12-05 21:12:40,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 168.9047619047619) internal successors, (3547), 21 states have internal predecessors, (3547), 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,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 187.0) internal successors, (4114), 22 states have internal predecessors, (4114), 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,073 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 187.0) internal successors, (4114), 22 states have internal predecessors, (4114), 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,073 INFO L308 CegarLoopForPetriNet]: 186 programPoint places, 107 predicate places. [2023-12-05 21:12:40,073 INFO L500 AbstractCegarLoop]: Abstraction has has 293 places, 303 transitions, 4115 flow [2023-12-05 21:12:40,074 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 168.66666666666666) internal successors, (3036), 18 states have internal predecessors, (3036), 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,074 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:40,075 INFO L233 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2023-12-05 21:12:40,100 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:40,281 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:40,281 INFO L425 AbstractCegarLoop]: === Iteration 13 === 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,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:40,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1282735863, now seen corresponding path program 2 times [2023-12-05 21:12:40,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:40,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478189264] [2023-12-05 21:12:40,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:40,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:41,785 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:41,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:41,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478189264] [2023-12-05 21:12:41,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478189264] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:12:41,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016848528] [2023-12-05 21:12:41,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-05 21:12:41,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:41,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:12:41,787 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:41,804 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:42,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-05 21:12:42,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-05 21:12:42,013 INFO L262 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 90 conjunts are in the unsatisfiable core [2023-12-05 21:12:42,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:12:42,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:12:42,133 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,146 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-05 21:12:42,146 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:42,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:12:42,228 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,355 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:12:42,356 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,362 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,624 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:12:42,624 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,630 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,765 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-05 21:12:42,765 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,781 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:12:42,781 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:43,048 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:12:43,048 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:43,051 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:43,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-05 21:12:43,257 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-05 21:12:43,257 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:43,268 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:12:43,269 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:43,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 12 [2023-12-05 21:12:43,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 12 [2023-12-05 21:12:43,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 8 [2023-12-05 21:12:43,689 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-05 21:12:43,689 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:43,707 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-05 21:12:43,708 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:43,841 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:43,841 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:12:44,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:12:44,303 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:44,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:12:44,570 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:44,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:12:44,967 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,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:12:45,270 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,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:12:45,825 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:46,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:12:46,106 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:46,632 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:46,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016848528] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:12:46,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:12:46,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27, 16] total 62 [2023-12-05 21:12:46,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805964613] [2023-12-05 21:12:46,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:12:46,633 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-12-05 21:12:46,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:46,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-12-05 21:12:46,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=3356, Unknown=0, NotChecked=0, Total=3906 [2023-12-05 21:12:46,638 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 187 [2023-12-05 21:12:46,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 303 transitions, 4115 flow. Second operand has 63 states, 63 states have (on average 88.76190476190476) internal successors, (5592), 63 states have internal predecessors, (5592), 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:46,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:46,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 187 [2023-12-05 21:12:46,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:50,284 INFO L124 PetriNetUnfolderBase]: 269/1361 cut-off events. [2023-12-05 21:12:50,285 INFO L125 PetriNetUnfolderBase]: For 13930/14667 co-relation queries the response was YES. [2023-12-05 21:12:50,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9053 conditions, 1361 events. 269/1361 cut-off events. For 13930/14667 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7091 event pairs, 201 based on Foata normal form. 17/1354 useless extension candidates. Maximal degree in co-relation 6383. Up to 616 conditions per place. [2023-12-05 21:12:50,295 INFO L140 encePairwiseOnDemand]: 160/187 looper letters, 282 selfloop transitions, 62 changer transitions 7/432 dead transitions. [2023-12-05 21:12:50,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 432 transitions, 6741 flow [2023-12-05 21:12:50,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-12-05 21:12:50,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2023-12-05 21:12:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 4390 transitions. [2023-12-05 21:12:50,299 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.47910073120157154 [2023-12-05 21:12:50,299 INFO L72 ComplementDD]: Start complementDD. Operand 49 states and 4390 transitions. [2023-12-05 21:12:50,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 4390 transitions. [2023-12-05 21:12:50,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:50,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 4390 transitions. [2023-12-05 21:12:50,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 50 states, 49 states have (on average 89.59183673469387) internal successors, (4390), 49 states have internal predecessors, (4390), 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,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 50 states, 50 states have (on average 187.0) internal successors, (9350), 50 states have internal predecessors, (9350), 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,312 INFO L81 ComplementDD]: Finished complementDD. Result has 50 states, 50 states have (on average 187.0) internal successors, (9350), 50 states have internal predecessors, (9350), 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,313 INFO L308 CegarLoopForPetriNet]: 186 programPoint places, 155 predicate places. [2023-12-05 21:12:50,313 INFO L500 AbstractCegarLoop]: Abstraction has has 341 places, 432 transitions, 6741 flow [2023-12-05 21:12:50,314 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 88.76190476190476) internal successors, (5592), 63 states have internal predecessors, (5592), 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,314 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:50,314 INFO L233 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1] [2023-12-05 21:12:50,329 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:50,520 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:50,521 INFO L425 AbstractCegarLoop]: === Iteration 14 === 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,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:50,522 INFO L85 PathProgramCache]: Analyzing trace with hash 335513119, now seen corresponding path program 3 times [2023-12-05 21:12:50,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:50,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120361961] [2023-12-05 21:12:50,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:50,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:51,159 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 0 proven. 973 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:51,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:51,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120361961] [2023-12-05 21:12:51,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120361961] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:12:51,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561734566] [2023-12-05 21:12:51,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-05 21:12:51,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:51,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:12:51,161 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:51,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process Received shutdown request... [2023-12-05 21:17:02,576 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:17:02,578 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-05 21:17:03,588 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:17:03,784 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forcibly destroying the process [2023-12-05 21:17:03,799 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-05 21:17:03,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-05 21:17:03,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2023-12-05 21:17:03,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230898813] [2023-12-05 21:17:03,799 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-05 21:17:03,800 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-05 21:17:03,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:17:03,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-05 21:17:03,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-12-05 21:17:03,802 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 187 [2023-12-05 21:17:03,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 432 transitions, 6741 flow. Second operand has 17 states, 17 states have (on average 168.7058823529412) internal successors, (2868), 17 states have internal predecessors, (2868), 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:17:03,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:17:03,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 187 [2023-12-05 21:17:03,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:17:03,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 137 [2023-12-05 21:17:03,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-05 21:17:03,818 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 51 remaining) [2023-12-05 21:17:03,818 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:17:03,818 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). [2023-12-05 21:17:03,820 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 51 remaining) [2023-12-05 21:17:03,820 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 51 remaining) [2023-12-05 21:17:03,820 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 51 remaining) [2023-12-05 21:17:03,820 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 51 remaining) [2023-12-05 21:17:03,820 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 51 remaining) [2023-12-05 21:17:03,820 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 51 remaining) [2023-12-05 21:17:03,820 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 51 remaining) [2023-12-05 21:17:03,820 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 51 remaining) [2023-12-05 21:17:03,820 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 51 remaining) [2023-12-05 21:17:03,820 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 51 remaining) [2023-12-05 21:17:03,820 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 51 remaining) [2023-12-05 21:17:03,820 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 51 remaining) [2023-12-05 21:17:03,820 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 51 remaining) [2023-12-05 21:17:03,820 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 51 remaining) [2023-12-05 21:17:03,820 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 51 remaining) [2023-12-05 21:17:03,821 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 51 remaining) [2023-12-05 21:17:03,821 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 51 remaining) [2023-12-05 21:17:03,821 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 51 remaining) [2023-12-05 21:17:03,821 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 51 remaining) [2023-12-05 21:17:03,821 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 51 remaining) [2023-12-05 21:17:03,821 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 51 remaining) [2023-12-05 21:17:03,821 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 51 remaining) [2023-12-05 21:17:03,821 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 51 remaining) [2023-12-05 21:17:03,821 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 51 remaining) [2023-12-05 21:17:03,821 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 51 remaining) [2023-12-05 21:17:03,821 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 51 remaining) [2023-12-05 21:17:03,821 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 51 remaining) [2023-12-05 21:17:03,821 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 51 remaining) [2023-12-05 21:17:03,821 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 51 remaining) [2023-12-05 21:17:03,821 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 51 remaining) [2023-12-05 21:17:03,821 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 51 remaining) [2023-12-05 21:17:03,821 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 51 remaining) [2023-12-05 21:17:03,822 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 51 remaining) [2023-12-05 21:17:03,822 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 51 remaining) [2023-12-05 21:17:03,822 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 51 remaining) [2023-12-05 21:17:03,822 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 51 remaining) [2023-12-05 21:17:03,822 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 51 remaining) [2023-12-05 21:17:03,822 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 51 remaining) [2023-12-05 21:17:03,822 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 51 remaining) [2023-12-05 21:17:03,822 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 51 remaining) [2023-12-05 21:17:03,822 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 51 remaining) [2023-12-05 21:17:03,822 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 51 remaining) [2023-12-05 21:17:03,822 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 51 remaining) [2023-12-05 21:17:03,822 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 51 remaining) [2023-12-05 21:17:03,822 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 51 remaining) [2023-12-05 21:17:03,822 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 51 remaining) [2023-12-05 21:17:03,822 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 51 remaining) [2023-12-05 21:17:03,822 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 51 remaining) [2023-12-05 21:17:03,822 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 51 remaining) [2023-12-05 21:17:03,823 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 51 remaining) [2023-12-05 21:17:03,823 INFO L457 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:03,826 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:17:03,826 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:17:03,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:17:03 BasicIcfg [2023-12-05 21:17:03,843 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:17:03,844 INFO L158 Benchmark]: Toolchain (without parser) took 277147.81ms. Allocated memory was 184.5MB in the beginning and 858.8MB in the end (delta: 674.2MB). Free memory was 118.4MB in the beginning and 347.5MB in the end (delta: -229.1MB). Peak memory consumption was 445.4MB. Max. memory is 8.0GB. [2023-12-05 21:17:03,844 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 184.5MB. Free memory was 134.0MB in the beginning and 133.9MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:17:03,844 INFO L158 Benchmark]: CACSL2BoogieTranslator took 614.31ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 118.1MB in the beginning and 169.3MB in the end (delta: -51.2MB). Peak memory consumption was 29.0MB. Max. memory is 8.0GB. [2023-12-05 21:17:03,844 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.59ms. Allocated memory is still 222.3MB. Free memory was 169.3MB in the beginning and 166.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-05 21:17:03,844 INFO L158 Benchmark]: Boogie Preprocessor took 28.71ms. Allocated memory is still 222.3MB. Free memory was 166.2MB in the beginning and 164.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:17:03,845 INFO L158 Benchmark]: RCFGBuilder took 525.56ms. Allocated memory is still 222.3MB. Free memory was 164.1MB in the beginning and 137.3MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2023-12-05 21:17:03,845 INFO L158 Benchmark]: TraceAbstraction took 275939.83ms. Allocated memory was 222.3MB in the beginning and 858.8MB in the end (delta: 636.5MB). Free memory was 136.8MB in the beginning and 347.5MB in the end (delta: -210.7MB). Peak memory consumption was 425.8MB. Max. memory is 8.0GB. [2023-12-05 21:17:03,846 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.11ms. Allocated memory is still 184.5MB. Free memory was 134.0MB in the beginning and 133.9MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 614.31ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 118.1MB in the beginning and 169.3MB in the end (delta: -51.2MB). Peak memory consumption was 29.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.59ms. Allocated memory is still 222.3MB. Free memory was 169.3MB in the beginning and 166.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.71ms. Allocated memory is still 222.3MB. Free memory was 166.2MB in the beginning and 164.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 525.56ms. Allocated memory is still 222.3MB. Free memory was 164.1MB in the beginning and 137.3MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 275939.83ms. Allocated memory was 222.3MB in the beginning and 858.8MB in the end (delta: 636.5MB). Free memory was 136.8MB in the beginning and 347.5MB in the end (delta: -210.7MB). Peak memory consumption was 425.8MB. 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 CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: 1262]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 166/187 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 25 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 243 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: 275.8s, OverallIterations: 14, TraceHistogramMax: 7, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3241 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3241 mSDsluCounter, 2437 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2091 mSDsCounter, 266 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6528 IncrementalHoareTripleChecker+Invalid, 6794 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 266 mSolverCounterUnsat, 346 mSDtfsCounter, 6528 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1291 GetRequests, 975 SyntacticMatches, 11 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5463 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6741occurred in iteration=13, InterpolantAutomatonStates: 186, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 1830 NumberOfCodeBlocks, 1830 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2324 ConstructedInterpolants, 238 QuantifiedInterpolants, 23032 SizeOfPredicates, 56 NumberOfNonLiveVariables, 2228 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 22 InterpolantComputations, 9 PerfectInterpolantSequences, 0/1993 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