/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_13-arraycollapse_nr.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:12:26,314 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:12:26,404 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 21:12:26,434 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:12:26,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:12:26,436 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:12:26,437 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:12:26,437 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:12:26,437 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:12:26,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:12:26,442 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:12:26,442 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:12:26,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:12:26,443 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:12:26,444 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:12:26,444 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:12:26,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:12:26,444 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:12:26,445 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:12:26,445 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:12:26,445 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:12:26,446 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:12:26,446 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:12:26,446 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:12:26,447 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:12:26,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:12:26,447 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:12:26,447 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:12:26,448 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:12:26,448 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:12:26,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:12:26,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:12:26,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:12:26,449 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:26,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:12:26,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:12:26,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:12:26,716 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:12:26,716 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:12:26,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_13-arraycollapse_nr.i [2023-12-05 21:12:27,932 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:12:28,219 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:12:28,220 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_13-arraycollapse_nr.i [2023-12-05 21:12:28,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10d72a481/c589de6e611445a2b9798f00a461c473/FLAG37d5088d0 [2023-12-05 21:12:28,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10d72a481/c589de6e611445a2b9798f00a461c473 [2023-12-05 21:12:28,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:12:28,260 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:12:28,262 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:12:28,262 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:12:28,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:12:28,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:12:28" (1/1) ... [2023-12-05 21:12:28,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dace751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:28, skipping insertion in model container [2023-12-05 21:12:28,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:12:28" (1/1) ... [2023-12-05 21:12:28,325 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:12:28,847 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:12:28,871 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:12:28,937 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:12:29,017 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:12:29,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:29 WrapperNode [2023-12-05 21:12:29,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:12:29,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:12:29,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:12:29,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:12:29,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:29" (1/1) ... [2023-12-05 21:12:29,058 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:29" (1/1) ... [2023-12-05 21:12:29,098 INFO L138 Inliner]: procedures = 371, calls = 39, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 174 [2023-12-05 21:12:29,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:12:29,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:12:29,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:12:29,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:12:29,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:29" (1/1) ... [2023-12-05 21:12:29,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:29" (1/1) ... [2023-12-05 21:12:29,122 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:29" (1/1) ... [2023-12-05 21:12:29,123 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:29" (1/1) ... [2023-12-05 21:12:29,142 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:29" (1/1) ... [2023-12-05 21:12:29,145 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:29" (1/1) ... [2023-12-05 21:12:29,147 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:29" (1/1) ... [2023-12-05 21:12:29,149 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:29" (1/1) ... [2023-12-05 21:12:29,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:12:29,153 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:12:29,153 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:12:29,153 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:12:29,154 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:29" (1/1) ... [2023-12-05 21:12:29,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:12:29,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:12:29,193 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 21:12:29,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:12:29,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-05 21:12:29,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:12:29,230 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:12:29,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:12:29,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:12:29,230 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:12:29,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-05 21:12:29,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:12:29,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-05 21:12:29,231 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-05 21:12:29,231 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-05 21:12:29,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:12:29,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:12:29,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 21:12:29,234 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:12:29,419 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:12:29,421 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:12:30,009 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:12:30,043 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:12:30,043 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-05 21:12:30,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:12:30 BoogieIcfgContainer [2023-12-05 21:12:30,045 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:12:30,047 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:12:30,049 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:12:30,052 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:12:30,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:12:28" (1/3) ... [2023-12-05 21:12:30,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf664f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:12:30, skipping insertion in model container [2023-12-05 21:12:30,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:29" (2/3) ... [2023-12-05 21:12:30,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf664f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:12:30, skipping insertion in model container [2023-12-05 21:12:30,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:12:30" (3/3) ... [2023-12-05 21:12:30,056 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_13-arraycollapse_nr.i [2023-12-05 21:12:30,073 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:12:30,073 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2023-12-05 21:12:30,073 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:12:30,163 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:12:30,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 276 transitions, 556 flow [2023-12-05 21:12:30,320 INFO L124 PetriNetUnfolderBase]: 5/275 cut-off events. [2023-12-05 21:12:30,320 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:12:30,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 275 events. 5/275 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 410 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 190. Up to 2 conditions per place. [2023-12-05 21:12:30,327 INFO L82 GeneralOperation]: Start removeDead. Operand has 275 places, 276 transitions, 556 flow [2023-12-05 21:12:30,337 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 274 places, 275 transitions, 553 flow [2023-12-05 21:12:30,352 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:12:30,364 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;@209a4b41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:12:30,364 INFO L363 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2023-12-05 21:12:30,369 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:12:30,370 INFO L124 PetriNetUnfolderBase]: 1/32 cut-off events. [2023-12-05 21:12:30,370 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:12:30,370 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:30,371 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] [2023-12-05 21:12:30,371 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-05 21:12:30,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:30,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1417883990, now seen corresponding path program 1 times [2023-12-05 21:12:30,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:30,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826404131] [2023-12-05 21:12:30,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:30,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:30,690 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,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:30,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826404131] [2023-12-05 21:12:30,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826404131] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:30,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:30,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:12:30,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093122690] [2023-12-05 21:12:30,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:30,700 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:12:30,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:30,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:12:30,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:12:30,732 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 276 [2023-12-05 21:12:30,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 275 transitions, 553 flow. Second operand has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 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,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:30,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 276 [2023-12-05 21:12:30,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:31,146 INFO L124 PetriNetUnfolderBase]: 136/782 cut-off events. [2023-12-05 21:12:31,146 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:12:31,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 782 events. 136/782 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3997 event pairs, 135 based on Foata normal form. 8/644 useless extension candidates. Maximal degree in co-relation 896. Up to 336 conditions per place. [2023-12-05 21:12:31,156 INFO L140 encePairwiseOnDemand]: 248/276 looper letters, 81 selfloop transitions, 16 changer transitions 2/263 dead transitions. [2023-12-05 21:12:31,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 263 transitions, 723 flow [2023-12-05 21:12:31,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-05 21:12:31,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-05 21:12:31,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 944 transitions. [2023-12-05 21:12:31,172 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6840579710144927 [2023-12-05 21:12:31,173 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 944 transitions. [2023-12-05 21:12:31,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 944 transitions. [2023-12-05 21:12:31,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:31,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 944 transitions. [2023-12-05 21:12:31,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 188.8) internal successors, (944), 5 states have internal predecessors, (944), 0 states have call successors, (0), 0 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,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 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,191 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 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,194 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, -4 predicate places. [2023-12-05 21:12:31,194 INFO L500 AbstractCegarLoop]: Abstraction has has 270 places, 263 transitions, 723 flow [2023-12-05 21:12:31,195 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 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,195 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:31,195 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] [2023-12-05 21:12:31,195 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:12:31,196 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-05 21:12:31,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:31,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1417883989, now seen corresponding path program 1 times [2023-12-05 21:12:31,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:31,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391270201] [2023-12-05 21:12:31,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:31,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:31,372 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,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:31,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391270201] [2023-12-05 21:12:31,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391270201] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:31,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:31,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:12:31,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667263594] [2023-12-05 21:12:31,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:31,374 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:12:31,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:31,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:12:31,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:12:31,376 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 276 [2023-12-05 21:12:31,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 263 transitions, 723 flow. Second operand has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 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,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:31,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 276 [2023-12-05 21:12:31,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:31,710 INFO L124 PetriNetUnfolderBase]: 211/974 cut-off events. [2023-12-05 21:12:31,710 INFO L125 PetriNetUnfolderBase]: For 186/237 co-relation queries the response was YES. [2023-12-05 21:12:31,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1824 conditions, 974 events. 211/974 cut-off events. For 186/237 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 5635 event pairs, 210 based on Foata normal form. 0/950 useless extension candidates. Maximal degree in co-relation 1517. Up to 409 conditions per place. [2023-12-05 21:12:31,717 INFO L140 encePairwiseOnDemand]: 252/276 looper letters, 71 selfloop transitions, 16 changer transitions 2/255 dead transitions. [2023-12-05 21:12:31,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 255 transitions, 865 flow [2023-12-05 21:12:31,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-05 21:12:31,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-05 21:12:31,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 940 transitions. [2023-12-05 21:12:31,720 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6811594202898551 [2023-12-05 21:12:31,720 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 940 transitions. [2023-12-05 21:12:31,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 940 transitions. [2023-12-05 21:12:31,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:31,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 940 transitions. [2023-12-05 21:12:31,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 0 states have call successors, (0), 0 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,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 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,726 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 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,727 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, -8 predicate places. [2023-12-05 21:12:31,727 INFO L500 AbstractCegarLoop]: Abstraction has has 266 places, 255 transitions, 865 flow [2023-12-05 21:12:31,728 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 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,728 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:31,728 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] [2023-12-05 21:12:31,728 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:12:31,728 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-05 21:12:31,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:31,729 INFO L85 PathProgramCache]: Analyzing trace with hash 846772874, now seen corresponding path program 1 times [2023-12-05 21:12:31,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:31,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886816897] [2023-12-05 21:12:31,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:31,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:32,094 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,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:32,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886816897] [2023-12-05 21:12:32,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886816897] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:32,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:32,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:12:32,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095721351] [2023-12-05 21:12:32,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:32,099 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:12:32,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:32,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:12:32,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:12:32,102 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 276 [2023-12-05 21:12:32,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 255 transitions, 865 flow. Second operand has 7 states, 7 states have (on average 139.42857142857142) internal successors, (976), 7 states have internal predecessors, (976), 0 states have call successors, (0), 0 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,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:32,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 276 [2023-12-05 21:12:32,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:32,569 INFO L124 PetriNetUnfolderBase]: 242/1054 cut-off events. [2023-12-05 21:12:32,569 INFO L125 PetriNetUnfolderBase]: For 641/774 co-relation queries the response was YES. [2023-12-05 21:12:32,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2574 conditions, 1054 events. 242/1054 cut-off events. For 641/774 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5858 event pairs, 201 based on Foata normal form. 40/1069 useless extension candidates. Maximal degree in co-relation 2064. Up to 508 conditions per place. [2023-12-05 21:12:32,575 INFO L140 encePairwiseOnDemand]: 258/276 looper letters, 152 selfloop transitions, 9 changer transitions 4/299 dead transitions. [2023-12-05 21:12:32,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 299 transitions, 1415 flow [2023-12-05 21:12:32,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 21:12:32,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 21:12:32,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 996 transitions. [2023-12-05 21:12:32,578 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6014492753623188 [2023-12-05 21:12:32,578 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 996 transitions. [2023-12-05 21:12:32,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 996 transitions. [2023-12-05 21:12:32,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:32,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 996 transitions. [2023-12-05 21:12:32,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 166.0) internal successors, (996), 6 states have internal predecessors, (996), 0 states have call successors, (0), 0 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,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 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,585 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 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,585 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, -8 predicate places. [2023-12-05 21:12:32,586 INFO L500 AbstractCegarLoop]: Abstraction has has 266 places, 299 transitions, 1415 flow [2023-12-05 21:12:32,586 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 139.42857142857142) internal successors, (976), 7 states have internal predecessors, (976), 0 states have call successors, (0), 0 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,586 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:32,587 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] [2023-12-05 21:12:32,587 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:12:32,587 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-05 21:12:32,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:32,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1544817637, now seen corresponding path program 1 times [2023-12-05 21:12:32,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:32,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698026684] [2023-12-05 21:12:32,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:32,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:33,299 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,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:33,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698026684] [2023-12-05 21:12:33,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698026684] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:33,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:33,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-05 21:12:33,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576200549] [2023-12-05 21:12:33,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:33,301 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-05 21:12:33,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:33,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-05 21:12:33,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2023-12-05 21:12:33,305 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 276 [2023-12-05 21:12:33,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 299 transitions, 1415 flow. Second operand has 15 states, 15 states have (on average 110.4) internal successors, (1656), 15 states have internal predecessors, (1656), 0 states have call successors, (0), 0 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,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:33,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 276 [2023-12-05 21:12:33,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:34,546 INFO L124 PetriNetUnfolderBase]: 242/1050 cut-off events. [2023-12-05 21:12:34,547 INFO L125 PetriNetUnfolderBase]: For 1153/1400 co-relation queries the response was YES. [2023-12-05 21:12:34,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3226 conditions, 1050 events. 242/1050 cut-off events. For 1153/1400 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5787 event pairs, 201 based on Foata normal form. 17/1042 useless extension candidates. Maximal degree in co-relation 2579. Up to 506 conditions per place. [2023-12-05 21:12:34,554 INFO L140 encePairwiseOnDemand]: 231/276 looper letters, 129 selfloop transitions, 58 changer transitions 4/296 dead transitions. [2023-12-05 21:12:34,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 296 transitions, 1771 flow [2023-12-05 21:12:34,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-05 21:12:34,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-12-05 21:12:34,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2974 transitions. [2023-12-05 21:12:34,561 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4144370122630992 [2023-12-05 21:12:34,562 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2974 transitions. [2023-12-05 21:12:34,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2974 transitions. [2023-12-05 21:12:34,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:34,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2974 transitions. [2023-12-05 21:12:34,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 114.38461538461539) internal successors, (2974), 26 states have internal predecessors, (2974), 0 states have call successors, (0), 0 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,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 276.0) internal successors, (7452), 27 states have internal predecessors, (7452), 0 states have call successors, (0), 0 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,579 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 276.0) internal successors, (7452), 27 states have internal predecessors, (7452), 0 states have call successors, (0), 0 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,580 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 15 predicate places. [2023-12-05 21:12:34,580 INFO L500 AbstractCegarLoop]: Abstraction has has 289 places, 296 transitions, 1771 flow [2023-12-05 21:12:34,581 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 110.4) internal successors, (1656), 15 states have internal predecessors, (1656), 0 states have call successors, (0), 0 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,581 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:34,581 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] [2023-12-05 21:12:34,581 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:12:34,582 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-05 21:12:34,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:34,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1544817638, now seen corresponding path program 1 times [2023-12-05 21:12:34,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:34,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076371530] [2023-12-05 21:12:34,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:34,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:34,945 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:34,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:34,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076371530] [2023-12-05 21:12:34,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076371530] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:34,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:34,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-05 21:12:34,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877494881] [2023-12-05 21:12:34,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:34,946 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-05 21:12:34,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:34,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-05 21:12:34,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-12-05 21:12:34,950 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 276 [2023-12-05 21:12:34,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 296 transitions, 1771 flow. Second operand has 13 states, 13 states have (on average 121.76923076923077) internal successors, (1583), 13 states have internal predecessors, (1583), 0 states have call successors, (0), 0 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,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:34,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 276 [2023-12-05 21:12:34,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:35,767 INFO L124 PetriNetUnfolderBase]: 242/1044 cut-off events. [2023-12-05 21:12:35,767 INFO L125 PetriNetUnfolderBase]: For 1921/2237 co-relation queries the response was YES. [2023-12-05 21:12:35,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3748 conditions, 1044 events. 242/1044 cut-off events. For 1921/2237 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5777 event pairs, 201 based on Foata normal form. 17/1036 useless extension candidates. Maximal degree in co-relation 2987. Up to 502 conditions per place. [2023-12-05 21:12:35,774 INFO L140 encePairwiseOnDemand]: 238/276 looper letters, 120 selfloop transitions, 44 changer transitions 4/290 dead transitions. [2023-12-05 21:12:35,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 290 transitions, 2055 flow [2023-12-05 21:12:35,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-05 21:12:35,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-12-05 21:12:35,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2766 transitions. [2023-12-05 21:12:35,781 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.45553359683794464 [2023-12-05 21:12:35,781 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2766 transitions. [2023-12-05 21:12:35,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2766 transitions. [2023-12-05 21:12:35,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:35,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2766 transitions. [2023-12-05 21:12:35,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 125.72727272727273) internal successors, (2766), 22 states have internal predecessors, (2766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:35,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 276.0) internal successors, (6348), 23 states have internal predecessors, (6348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:35,797 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 276.0) internal successors, (6348), 23 states have internal predecessors, (6348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:35,797 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 32 predicate places. [2023-12-05 21:12:35,797 INFO L500 AbstractCegarLoop]: Abstraction has has 306 places, 290 transitions, 2055 flow [2023-12-05 21:12:35,798 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 121.76923076923077) internal successors, (1583), 13 states have internal predecessors, (1583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:35,798 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:35,798 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] [2023-12-05 21:12:35,798 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:12:35,799 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-05 21:12:35,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:35,799 INFO L85 PathProgramCache]: Analyzing trace with hash 653019295, now seen corresponding path program 1 times [2023-12-05 21:12:35,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:35,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312036309] [2023-12-05 21:12:35,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:35,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:35,995 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:35,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:35,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312036309] [2023-12-05 21:12:35,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312036309] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:35,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:35,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 21:12:35,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751348301] [2023-12-05 21:12:35,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:35,996 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 21:12:35,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:35,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 21:12:35,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-05 21:12:35,999 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 276 [2023-12-05 21:12:36,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 290 transitions, 2055 flow. Second operand has 8 states, 8 states have (on average 143.875) internal successors, (1151), 8 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:36,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:36,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 276 [2023-12-05 21:12:36,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:36,572 INFO L124 PetriNetUnfolderBase]: 242/1042 cut-off events. [2023-12-05 21:12:36,572 INFO L125 PetriNetUnfolderBase]: For 2809/3179 co-relation queries the response was YES. [2023-12-05 21:12:36,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4247 conditions, 1042 events. 242/1042 cut-off events. For 2809/3179 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5838 event pairs, 201 based on Foata normal form. 2/1019 useless extension candidates. Maximal degree in co-relation 3372. Up to 501 conditions per place. [2023-12-05 21:12:36,579 INFO L140 encePairwiseOnDemand]: 245/276 looper letters, 109 selfloop transitions, 38 changer transitions 4/288 dead transitions. [2023-12-05 21:12:36,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 288 transitions, 2337 flow [2023-12-05 21:12:36,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-05 21:12:36,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-05 21:12:36,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1655 transitions. [2023-12-05 21:12:36,584 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5451251646903821 [2023-12-05 21:12:36,584 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1655 transitions. [2023-12-05 21:12:36,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1655 transitions. [2023-12-05 21:12:36,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:36,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1655 transitions. [2023-12-05 21:12:36,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 150.45454545454547) internal successors, (1655), 11 states have internal predecessors, (1655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:36,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 276.0) internal successors, (3312), 12 states have internal predecessors, (3312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:36,592 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 276.0) internal successors, (3312), 12 states have internal predecessors, (3312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:36,593 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 41 predicate places. [2023-12-05 21:12:36,593 INFO L500 AbstractCegarLoop]: Abstraction has has 315 places, 288 transitions, 2337 flow [2023-12-05 21:12:36,594 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 143.875) internal successors, (1151), 8 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:36,594 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:36,594 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] [2023-12-05 21:12:36,594 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:12:36,594 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-05 21:12:36,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:36,595 INFO L85 PathProgramCache]: Analyzing trace with hash 653019294, now seen corresponding path program 1 times [2023-12-05 21:12:36,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:36,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449076860] [2023-12-05 21:12:36,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:36,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:36,694 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:36,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:36,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449076860] [2023-12-05 21:12:36,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449076860] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:36,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:36,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:12:36,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139064906] [2023-12-05 21:12:36,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:36,696 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:12:36,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:36,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:12:36,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:12:36,698 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 276 [2023-12-05 21:12:36,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 288 transitions, 2337 flow. Second operand has 7 states, 7 states have (on average 146.28571428571428) internal successors, (1024), 7 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:12:36,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:36,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 276 [2023-12-05 21:12:36,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:37,129 INFO L124 PetriNetUnfolderBase]: 242/1040 cut-off events. [2023-12-05 21:12:37,130 INFO L125 PetriNetUnfolderBase]: For 3882/4318 co-relation queries the response was YES. [2023-12-05 21:12:37,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4718 conditions, 1040 events. 242/1040 cut-off events. For 3882/4318 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5869 event pairs, 201 based on Foata normal form. 11/1026 useless extension candidates. Maximal degree in co-relation 3746. Up to 500 conditions per place. [2023-12-05 21:12:37,138 INFO L140 encePairwiseOnDemand]: 248/276 looper letters, 102 selfloop transitions, 31 changer transitions 4/286 dead transitions. [2023-12-05 21:12:37,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 286 transitions, 2583 flow [2023-12-05 21:12:37,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:12:37,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:12:37,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1539 transitions. [2023-12-05 21:12:37,142 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5576086956521739 [2023-12-05 21:12:37,142 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1539 transitions. [2023-12-05 21:12:37,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1539 transitions. [2023-12-05 21:12:37,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:37,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1539 transitions. [2023-12-05 21:12:37,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 153.9) internal successors, (1539), 10 states have internal predecessors, (1539), 0 states have call successors, (0), 0 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,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 276.0) internal successors, (3036), 11 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:37,151 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 276.0) internal successors, (3036), 11 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:37,152 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 49 predicate places. [2023-12-05 21:12:37,152 INFO L500 AbstractCegarLoop]: Abstraction has has 323 places, 286 transitions, 2583 flow [2023-12-05 21:12:37,153 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 146.28571428571428) internal successors, (1024), 7 states have internal predecessors, (1024), 0 states have call successors, (0), 0 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,153 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:37,153 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 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] [2023-12-05 21:12:37,154 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:12:37,154 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-05 21:12:37,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:37,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1894802274, now seen corresponding path program 1 times [2023-12-05 21:12:37,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:37,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323499529] [2023-12-05 21:12:37,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:37,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:37,757 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:37,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:37,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323499529] [2023-12-05 21:12:37,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323499529] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:12:37,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526761947] [2023-12-05 21:12:37,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:37,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:37,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:12:37,764 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:37,782 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:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:37,910 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-05 21:12:37,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:12:38,117 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:12:38,117 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:38,130 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:38,294 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:12:38,294 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:38,299 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:38,611 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-05 21:12:38,612 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:38,631 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:12:38,631 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:38,723 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:38,723 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:12:39,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:12:39,202 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:39,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:12:39,483 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:39,861 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:39,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526761947] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:12:39,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:12:39,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 8] total 28 [2023-12-05 21:12:39,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474761211] [2023-12-05 21:12:39,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:12:39,864 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-05 21:12:39,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:39,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-05 21:12:39,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=655, Unknown=0, NotChecked=0, Total=812 [2023-12-05 21:12:39,870 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 276 [2023-12-05 21:12:39,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 286 transitions, 2583 flow. Second operand has 29 states, 29 states have (on average 140.10344827586206) internal successors, (4063), 29 states have internal predecessors, (4063), 0 states have call successors, (0), 0 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,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:39,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 276 [2023-12-05 21:12:39,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:41,799 INFO L124 PetriNetUnfolderBase]: 463/1910 cut-off events. [2023-12-05 21:12:41,799 INFO L125 PetriNetUnfolderBase]: For 9713/10777 co-relation queries the response was YES. [2023-12-05 21:12:41,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9880 conditions, 1910 events. 463/1910 cut-off events. For 9713/10777 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 11056 event pairs, 401 based on Foata normal form. 17/1877 useless extension candidates. Maximal degree in co-relation 4261. Up to 1003 conditions per place. [2023-12-05 21:12:41,813 INFO L140 encePairwiseOnDemand]: 260/276 looper letters, 230 selfloop transitions, 24 changer transitions 4/392 dead transitions. [2023-12-05 21:12:41,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 392 transitions, 4560 flow [2023-12-05 21:12:41,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-05 21:12:41,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-12-05 21:12:41,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2437 transitions. [2023-12-05 21:12:41,819 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5518568840579711 [2023-12-05 21:12:41,819 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2437 transitions. [2023-12-05 21:12:41,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2437 transitions. [2023-12-05 21:12:41,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:41,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2437 transitions. [2023-12-05 21:12:41,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 152.3125) internal successors, (2437), 16 states have internal predecessors, (2437), 0 states have call successors, (0), 0 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:41,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 276.0) internal successors, (4692), 17 states have internal predecessors, (4692), 0 states have call successors, (0), 0 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:41,834 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 276.0) internal successors, (4692), 17 states have internal predecessors, (4692), 0 states have call successors, (0), 0 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:41,835 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 63 predicate places. [2023-12-05 21:12:41,835 INFO L500 AbstractCegarLoop]: Abstraction has has 337 places, 392 transitions, 4560 flow [2023-12-05 21:12:41,836 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 140.10344827586206) internal successors, (4063), 29 states have internal predecessors, (4063), 0 states have call successors, (0), 0 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:41,836 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:41,837 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-05 21:12:41,847 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:42,037 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:42,038 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-05 21:12:42,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:42,038 INFO L85 PathProgramCache]: Analyzing trace with hash 569122582, now seen corresponding path program 1 times [2023-12-05 21:12:42,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:42,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111514291] [2023-12-05 21:12:42,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:42,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:42,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:42,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111514291] [2023-12-05 21:12:42,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111514291] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:12:42,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586050914] [2023-12-05 21:12:42,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:42,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:42,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:12:42,302 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:42,322 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:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:42,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-05 21:12:42,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:12:42,612 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:42,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:12:42,803 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:42,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586050914] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:12:42,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:12:42,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-12-05 21:12:42,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326397450] [2023-12-05 21:12:42,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:12:42,804 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-05 21:12:42,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:42,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-05 21:12:42,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-05 21:12:42,808 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 276 [2023-12-05 21:12:42,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 392 transitions, 4560 flow. Second operand has 14 states, 14 states have (on average 255.92857142857142) internal successors, (3583), 14 states have internal predecessors, (3583), 0 states have call successors, (0), 0 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:42,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:42,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 276 [2023-12-05 21:12:42,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:43,257 INFO L124 PetriNetUnfolderBase]: 242/1183 cut-off events. [2023-12-05 21:12:43,257 INFO L125 PetriNetUnfolderBase]: For 6504/7041 co-relation queries the response was YES. [2023-12-05 21:12:43,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6276 conditions, 1183 events. 242/1183 cut-off events. For 6504/7041 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5651 event pairs, 201 based on Foata normal form. 0/1158 useless extension candidates. Maximal degree in co-relation 4351. Up to 570 conditions per place. [2023-12-05 21:12:43,267 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 34 selfloop transitions, 15 changer transitions 4/333 dead transitions. [2023-12-05 21:12:43,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 333 transitions, 3663 flow [2023-12-05 21:12:43,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-05 21:12:43,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-12-05 21:12:43,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3846 transitions. [2023-12-05 21:12:43,273 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9289855072463769 [2023-12-05 21:12:43,273 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3846 transitions. [2023-12-05 21:12:43,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3846 transitions. [2023-12-05 21:12:43,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:43,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3846 transitions. [2023-12-05 21:12:43,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 256.4) internal successors, (3846), 15 states have internal predecessors, (3846), 0 states have call successors, (0), 0 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:43,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 276.0) internal successors, (4416), 16 states have internal predecessors, (4416), 0 states have call successors, (0), 0 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:43,288 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 276.0) internal successors, (4416), 16 states have internal predecessors, (4416), 0 states have call successors, (0), 0 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:43,289 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 75 predicate places. [2023-12-05 21:12:43,289 INFO L500 AbstractCegarLoop]: Abstraction has has 349 places, 333 transitions, 3663 flow [2023-12-05 21:12:43,290 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 255.92857142857142) internal successors, (3583), 14 states have internal predecessors, (3583), 0 states have call successors, (0), 0 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:43,290 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:43,290 INFO L233 CegarLoopForPetriNet]: trace histogram [4, 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] [2023-12-05 21:12:43,299 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:43,496 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,SelfDestructingSolverStorable8 [2023-12-05 21:12:43,497 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-05 21:12:43,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:43,498 INFO L85 PathProgramCache]: Analyzing trace with hash 515999518, now seen corresponding path program 2 times [2023-12-05 21:12:43,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:43,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323997112] [2023-12-05 21:12:43,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:43,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:45,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:45,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323997112] [2023-12-05 21:12:45,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323997112] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:12:45,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517801992] [2023-12-05 21:12:45,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-05 21:12:45,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:45,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:12:45,429 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:45,432 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:45,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-05 21:12:45,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-05 21:12:45,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 83 conjunts are in the unsatisfiable core [2023-12-05 21:12:45,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:12:45,860 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:12:45,860 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:45,878 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:46,065 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:46,183 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-05 21:12:46,183 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:46,198 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:12:46,198 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:46,291 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:46,317 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:46,392 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:46,698 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:12:46,699 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:46,704 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:46,861 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-05 21:12:46,861 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:46,874 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:12:46,874 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:47,158 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-05 21:12:47,158 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:47,169 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:12:47,169 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:47,308 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:12:47,308 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:47,323 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:47,573 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:12:47,574 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:47,578 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:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:47,667 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:12:48,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:12:48,120 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:48,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:12:48,447 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:48,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:12:48,965 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:49,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:12:49,291 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:49,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:12:49,917 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:50,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:12:50,225 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:50,675 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:50,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517801992] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:12:50,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:12:50,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 26, 14] total 58 [2023-12-05 21:12:50,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45815685] [2023-12-05 21:12:50,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:12:50,677 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-12-05 21:12:50,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:50,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-12-05 21:12:50,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=3010, Unknown=0, NotChecked=0, Total=3422 [2023-12-05 21:12:50,684 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 276 [2023-12-05 21:12:50,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 333 transitions, 3663 flow. Second operand has 59 states, 59 states have (on average 119.28813559322033) internal successors, (7038), 59 states have internal predecessors, (7038), 0 states have call successors, (0), 0 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,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:50,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 276 [2023-12-05 21:12:50,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:57,085 INFO L124 PetriNetUnfolderBase]: 464/2099 cut-off events. [2023-12-05 21:12:57,085 INFO L125 PetriNetUnfolderBase]: For 14576/15858 co-relation queries the response was YES. [2023-12-05 21:12:57,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12514 conditions, 2099 events. 464/2099 cut-off events. For 14576/15858 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10859 event pairs, 401 based on Foata normal form. 17/2065 useless extension candidates. Maximal degree in co-relation 4866. Up to 1096 conditions per place. [2023-12-05 21:12:57,100 INFO L140 encePairwiseOnDemand]: 247/276 looper letters, 393 selfloop transitions, 62 changer transitions 4/569 dead transitions. [2023-12-05 21:12:57,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 569 transitions, 7938 flow [2023-12-05 21:12:57,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-12-05 21:12:57,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2023-12-05 21:12:57,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 5998 transitions. [2023-12-05 21:12:57,121 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4435078379177758 [2023-12-05 21:12:57,122 INFO L72 ComplementDD]: Start complementDD. Operand 49 states and 5998 transitions. [2023-12-05 21:12:57,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 5998 transitions. [2023-12-05 21:12:57,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:57,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 5998 transitions. [2023-12-05 21:12:57,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 50 states, 49 states have (on average 122.40816326530613) internal successors, (5998), 49 states have internal predecessors, (5998), 0 states have call successors, (0), 0 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:57,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 50 states, 50 states have (on average 276.0) internal successors, (13800), 50 states have internal predecessors, (13800), 0 states have call successors, (0), 0 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:57,150 INFO L81 ComplementDD]: Finished complementDD. Result has 50 states, 50 states have (on average 276.0) internal successors, (13800), 50 states have internal predecessors, (13800), 0 states have call successors, (0), 0 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:57,151 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 123 predicate places. [2023-12-05 21:12:57,151 INFO L500 AbstractCegarLoop]: Abstraction has has 397 places, 569 transitions, 7938 flow [2023-12-05 21:12:57,153 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 119.28813559322033) internal successors, (7038), 59 states have internal predecessors, (7038), 0 states have call successors, (0), 0 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:57,153 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:57,153 INFO L233 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,162 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:57,361 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:57,361 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-05 21:12:57,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:57,362 INFO L85 PathProgramCache]: Analyzing trace with hash -2140236630, now seen corresponding path program 2 times [2023-12-05 21:12:57,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:57,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647154135] [2023-12-05 21:12:57,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:57,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:58,109 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 0 proven. 475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:58,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:58,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647154135] [2023-12-05 21:12:58,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647154135] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:12:58,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324400995] [2023-12-05 21:12:58,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-05 21:12:58,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:12:58,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:12:58,111 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:58,131 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:58,462 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-05 21:12:58,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-05 21:12:58,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 1300 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-05 21:12:58,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:12:58,751 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 0 proven. 475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:58,751 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:12:59,098 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 0 proven. 475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:59,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324400995] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:12:59,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:12:59,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2023-12-05 21:12:59,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153744117] [2023-12-05 21:12:59,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:12:59,099 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-05 21:12:59,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:59,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-05 21:12:59,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-12-05 21:12:59,108 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 276 [2023-12-05 21:12:59,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 569 transitions, 7938 flow. Second operand has 23 states, 23 states have (on average 256.30434782608694) internal successors, (5895), 23 states have internal predecessors, (5895), 0 states have call successors, (0), 0 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:59,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:59,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 276 [2023-12-05 21:12:59,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:59,876 INFO L124 PetriNetUnfolderBase]: 242/1419 cut-off events. [2023-12-05 21:12:59,877 INFO L125 PetriNetUnfolderBase]: For 10500/11146 co-relation queries the response was YES. [2023-12-05 21:12:59,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8759 conditions, 1419 events. 242/1419 cut-off events. For 10500/11146 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5666 event pairs, 201 based on Foata normal form. 0/1394 useless extension candidates. Maximal degree in co-relation 4956. Up to 686 conditions per place. [2023-12-05 21:12:59,882 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 55 selfloop transitions, 30 changer transitions 4/505 dead transitions. [2023-12-05 21:12:59,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 505 transitions, 6975 flow [2023-12-05 21:12:59,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-05 21:12:59,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-12-05 21:12:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 7679 transitions. [2023-12-05 21:12:59,889 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9274154589371981 [2023-12-05 21:12:59,890 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 7679 transitions. [2023-12-05 21:12:59,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 7679 transitions. [2023-12-05 21:12:59,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:59,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 7679 transitions. [2023-12-05 21:12:59,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 255.96666666666667) internal successors, (7679), 30 states have internal predecessors, (7679), 0 states have call successors, (0), 0 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:59,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 276.0) internal successors, (8556), 31 states have internal predecessors, (8556), 0 states have call successors, (0), 0 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:59,910 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 276.0) internal successors, (8556), 31 states have internal predecessors, (8556), 0 states have call successors, (0), 0 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:59,911 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 150 predicate places. [2023-12-05 21:12:59,911 INFO L500 AbstractCegarLoop]: Abstraction has has 424 places, 505 transitions, 6975 flow [2023-12-05 21:12:59,912 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 256.30434782608694) internal successors, (5895), 23 states have internal predecessors, (5895), 0 states have call successors, (0), 0 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:59,912 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:59,912 INFO L233 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2023-12-05 21:12:59,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-05 21:13:00,120 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:13:00,120 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-05 21:13:00,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:00,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1088603106, now seen corresponding path program 3 times [2023-12-05 21:13:00,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:00,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634597418] [2023-12-05 21:13:00,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:00,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 0 proven. 1099 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:13:06,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:06,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634597418] [2023-12-05 21:13:06,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634597418] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:13:06,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219625210] [2023-12-05 21:13:06,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-05 21:13:06,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:13:06,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:13:06,508 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:13:06,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-05 21:16:15,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-12-05 21:16:15,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-05 21:16:15,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 1719 conjuncts, 261 conjunts are in the unsatisfiable core [2023-12-05 21:16:15,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:16:15,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:16:15,777 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:16:15,919 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:16:15,919 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:16:15,934 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:16:16,214 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-05 21:16:16,214 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:16:16,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-12-05 21:16:16,614 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:16:16,614 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:16:16,630 INFO L349 Elim1Store]: treesize reduction 45, result has 35.7 percent of original size [2023-12-05 21:16:16,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 49 [2023-12-05 21:16:16,815 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 51 treesize of output 42 [2023-12-05 21:16:16,833 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 51 treesize of output 42 [2023-12-05 21:16:16,944 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 47 treesize of output 23 [2023-12-05 21:16:17,412 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-12-05 21:16:17,412 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 18 treesize of output 22 [2023-12-05 21:16:17,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-12-05 21:16:17,933 INFO L349 Elim1Store]: treesize reduction 40, result has 56.0 percent of original size [2023-12-05 21:16:17,933 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 3 case distinctions, treesize of input 33 treesize of output 61 [2023-12-05 21:16:17,958 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:16:17,958 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:16:18,187 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 34 treesize of output 27 [2023-12-05 21:16:18,201 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 34 treesize of output 27 [2023-12-05 21:16:18,350 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 30 treesize of output 14 [2023-12-05 21:16:18,915 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:16:18,915 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:16:18,921 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 20 treesize of output 13 [2023-12-05 21:16:19,256 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 23 treesize of output 1 [2023-12-05 21:16:19,385 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:16:19,385 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:16:19,395 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:16:19,556 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 21 treesize of output 16 [2023-12-05 21:16:19,571 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 21 treesize of output 16 [2023-12-05 21:16:19,749 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 24 treesize of output 8 [2023-12-05 21:16:20,284 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-12-05 21:16:20,285 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 12 treesize of output 18 [2023-12-05 21:16:20,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-12-05 21:16:20,893 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:16:20,893 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:16:20,913 INFO L349 Elim1Store]: treesize reduction 45, result has 35.7 percent of original size [2023-12-05 21:16:20,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 49 [2023-12-05 21:16:21,163 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 51 treesize of output 42 [2023-12-05 21:16:21,187 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 51 treesize of output 42 [2023-12-05 21:16:21,349 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 47 treesize of output 23 [2023-12-05 21:16:22,084 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-05 21:16:22,085 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 20 treesize of output 17 [2023-12-05 21:16:22,098 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:16:22,098 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:16:22,553 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 23 treesize of output 1 [2023-12-05 21:16:22,767 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-05 21:16:22,768 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 20 treesize of output 17 [2023-12-05 21:16:22,785 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:16:22,786 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:16:23,117 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 21 treesize of output 16 [2023-12-05 21:16:23,135 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 21 treesize of output 16 [2023-12-05 21:16:23,405 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 24 treesize of output 8 [2023-12-05 21:16:24,199 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:16:24,199 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:16:24,204 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 20 treesize of output 13 [2023-12-05 21:16:24,718 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 23 treesize of output 1 [2023-12-05 21:16:24,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-05 21:16:24,928 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:16:24,928 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:16:24,937 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:16:25,195 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 20 treesize of output 15 [2023-12-05 21:16:25,206 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 21 treesize of output 16 [2023-12-05 21:16:25,219 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 20 treesize of output 15 [2023-12-05 21:16:25,231 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 21 treesize of output 16 [2023-12-05 21:16:25,523 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 24 treesize of output 8 [2023-12-05 21:16:25,527 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 11 treesize of output 3 [2023-12-05 21:16:26,424 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-05 21:16:26,425 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:16:26,437 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:16:26,437 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:16:26,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 0 proven. 1099 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:26,696 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:16:27,461 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-05 21:16:27,462 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 13 treesize of output 12 [2023-12-05 21:16:27,918 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-05 21:16:27,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-12-05 21:16:29,152 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-05 21:16:29,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-12-05 21:16:31,771 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-05 21:16:31,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-12-05 21:16:39,952 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-05 21:16:39,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-12-05 21:16:42,995 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-05 21:16:42,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 Received shutdown request... [2023-12-05 21:16:43,953 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 75 remaining) [2023-12-05 21:16:43,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-05 21:16:43,996 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:16:43,996 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-05 21:16:44,156 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-05 21:16:44,156 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. [2023-12-05 21:16:44,158 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 75 remaining) [2023-12-05 21:16:44,158 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 75 remaining) [2023-12-05 21:16:44,158 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 75 remaining) [2023-12-05 21:16:44,159 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 75 remaining) [2023-12-05 21:16:44,159 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 75 remaining) [2023-12-05 21:16:44,159 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 75 remaining) [2023-12-05 21:16:44,159 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 75 remaining) [2023-12-05 21:16:44,159 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 75 remaining) [2023-12-05 21:16:44,159 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 75 remaining) [2023-12-05 21:16:44,159 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 75 remaining) [2023-12-05 21:16:44,159 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 75 remaining) [2023-12-05 21:16:44,159 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 75 remaining) [2023-12-05 21:16:44,159 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 75 remaining) [2023-12-05 21:16:44,160 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 75 remaining) [2023-12-05 21:16:44,160 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 75 remaining) [2023-12-05 21:16:44,160 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 75 remaining) [2023-12-05 21:16:44,160 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 75 remaining) [2023-12-05 21:16:44,160 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 75 remaining) [2023-12-05 21:16:44,160 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 75 remaining) [2023-12-05 21:16:44,160 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 75 remaining) [2023-12-05 21:16:44,160 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 75 remaining) [2023-12-05 21:16:44,160 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 75 remaining) [2023-12-05 21:16:44,160 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 75 remaining) [2023-12-05 21:16:44,160 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 75 remaining) [2023-12-05 21:16:44,160 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 75 remaining) [2023-12-05 21:16:44,161 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 75 remaining) [2023-12-05 21:16:44,161 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 75 remaining) [2023-12-05 21:16:44,161 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 75 remaining) [2023-12-05 21:16:44,161 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 75 remaining) [2023-12-05 21:16:44,161 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 75 remaining) [2023-12-05 21:16:44,161 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 75 remaining) [2023-12-05 21:16:44,161 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 75 remaining) [2023-12-05 21:16:44,161 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 75 remaining) [2023-12-05 21:16:44,161 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 75 remaining) [2023-12-05 21:16:44,161 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 75 remaining) [2023-12-05 21:16:44,161 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 75 remaining) [2023-12-05 21:16:44,161 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 75 remaining) [2023-12-05 21:16:44,161 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 75 remaining) [2023-12-05 21:16:44,161 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 75 remaining) [2023-12-05 21:16:44,162 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 75 remaining) [2023-12-05 21:16:44,162 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 75 remaining) [2023-12-05 21:16:44,162 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 75 remaining) [2023-12-05 21:16:44,162 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 75 remaining) [2023-12-05 21:16:44,162 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 75 remaining) [2023-12-05 21:16:44,162 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 75 remaining) [2023-12-05 21:16:44,162 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 75 remaining) [2023-12-05 21:16:44,162 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 75 remaining) [2023-12-05 21:16:44,162 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 75 remaining) [2023-12-05 21:16:44,162 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 75 remaining) [2023-12-05 21:16:44,162 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 75 remaining) [2023-12-05 21:16:44,162 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 75 remaining) [2023-12-05 21:16:44,162 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 75 remaining) [2023-12-05 21:16:44,162 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 75 remaining) [2023-12-05 21:16:44,162 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 75 remaining) [2023-12-05 21:16:44,163 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 75 remaining) [2023-12-05 21:16:44,163 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 75 remaining) [2023-12-05 21:16:44,163 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 75 remaining) [2023-12-05 21:16:44,163 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 75 remaining) [2023-12-05 21:16:44,163 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 75 remaining) [2023-12-05 21:16:44,163 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 75 remaining) [2023-12-05 21:16:44,163 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 75 remaining) [2023-12-05 21:16:44,163 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 75 remaining) [2023-12-05 21:16:44,163 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 75 remaining) [2023-12-05 21:16:44,163 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 75 remaining) [2023-12-05 21:16:44,163 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 75 remaining) [2023-12-05 21:16:44,164 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 75 remaining) [2023-12-05 21:16:44,164 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 75 remaining) [2023-12-05 21:16:44,164 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 75 remaining) [2023-12-05 21:16:44,164 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 75 remaining) [2023-12-05 21:16:44,164 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 75 remaining) [2023-12-05 21:16:44,164 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 75 remaining) [2023-12-05 21:16:44,164 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 75 remaining) [2023-12-05 21:16:44,164 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 75 remaining) [2023-12-05 21:16:44,164 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 75 remaining) [2023-12-05 21:16:44,165 INFO L457 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:44,170 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:16:44,170 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:16:44,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:16:44 BasicIcfg [2023-12-05 21:16:44,174 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:16:44,174 INFO L158 Benchmark]: Toolchain (without parser) took 255914.70ms. Allocated memory was 203.4MB in the beginning and 912.3MB in the end (delta: 708.8MB). Free memory was 155.5MB in the beginning and 581.7MB in the end (delta: -426.2MB). Peak memory consumption was 283.6MB. Max. memory is 8.0GB. [2023-12-05 21:16:44,174 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 203.4MB. Free memory is still 161.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:16:44,174 INFO L158 Benchmark]: CACSL2BoogieTranslator took 756.11ms. Allocated memory is still 203.4MB. Free memory was 155.5MB in the beginning and 115.6MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. [2023-12-05 21:16:44,175 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.59ms. Allocated memory is still 203.4MB. Free memory was 115.6MB in the beginning and 112.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-05 21:16:44,175 INFO L158 Benchmark]: Boogie Preprocessor took 52.91ms. Allocated memory is still 203.4MB. Free memory was 112.5MB in the beginning and 110.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:16:44,175 INFO L158 Benchmark]: RCFGBuilder took 892.36ms. Allocated memory was 203.4MB in the beginning and 244.3MB in the end (delta: 40.9MB). Free memory was 110.0MB in the beginning and 192.1MB in the end (delta: -82.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-05 21:16:44,175 INFO L158 Benchmark]: TraceAbstraction took 254126.28ms. Allocated memory was 244.3MB in the beginning and 912.3MB in the end (delta: 667.9MB). Free memory was 191.0MB in the beginning and 581.7MB in the end (delta: -390.7MB). Peak memory consumption was 278.8MB. Max. memory is 8.0GB. [2023-12-05 21:16:44,177 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.14ms. Allocated memory is still 203.4MB. Free memory is still 161.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 756.11ms. Allocated memory is still 203.4MB. Free memory was 155.5MB in the beginning and 115.6MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 79.59ms. Allocated memory is still 203.4MB. Free memory was 115.6MB in the beginning and 112.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.91ms. Allocated memory is still 203.4MB. Free memory was 112.5MB in the beginning and 110.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 892.36ms. Allocated memory was 203.4MB in the beginning and 244.3MB in the end (delta: 40.9MB). Free memory was 110.0MB in the beginning and 192.1MB in the end (delta: -82.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 254126.28ms. Allocated memory was 244.3MB in the beginning and 912.3MB in the end (delta: 667.9MB). Free memory was 191.0MB in the beginning and 581.7MB in the end (delta: -390.7MB). Peak memory consumption was 278.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 analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: 1268]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 357 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 145 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 331 locations, 75 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: 254.0s, OverallIterations: 12, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3859 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3859 mSDsluCounter, 3682 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3182 mSDsCounter, 344 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9181 IncrementalHoareTripleChecker+Invalid, 9525 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 344 mSolverCounterUnsat, 500 mSDtfsCounter, 9181 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1588 GetRequests, 1282 SyntacticMatches, 14 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5218 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7938occurred in iteration=10, InterpolantAutomatonStates: 195, 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.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 1611 NumberOfCodeBlocks, 1611 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2265 ConstructedInterpolants, 212 QuantifiedInterpolants, 21529 SizeOfPredicates, 60 NumberOfNonLiveVariables, 3035 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 0/2187 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