./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-12 21:28:38,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 21:28:38,403 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 21:28:38,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 21:28:38,409 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 21:28:38,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 21:28:38,436 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 21:28:38,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 21:28:38,437 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 21:28:38,437 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 21:28:38,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 21:28:38,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 21:28:38,438 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 21:28:38,438 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 21:28:38,439 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 21:28:38,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 21:28:38,440 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 21:28:38,442 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 21:28:38,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 21:28:38,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 21:28:38,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 21:28:38,443 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 21:28:38,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 21:28:38,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 21:28:38,443 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 21:28:38,443 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 21:28:38,444 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 21:28:38,444 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 21:28:38,444 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 21:28:38,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 21:28:38,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 21:28:38,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 21:28:38,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 21:28:38,445 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 21:28:38,445 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 21:28:38,445 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 21:28:38,445 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 21:28:38,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 21:28:38,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 21:28:38,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 21:28:38,446 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 21:28:38,447 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 21:28:38,447 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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/certificate-witnesses-artifact/automizer/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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-12 21:28:38,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 21:28:38,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 21:28:38,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 21:28:38,654 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 21:28:38,654 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 21:28:38,655 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2024-09-12 21:28:39,859 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 21:28:40,016 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 21:28:40,017 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2024-09-12 21:28:40,024 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/6db555736/dd7d356af23f4ac48b5eb2c3920ad5d0/FLAGb3cb7b8b5 [2024-09-12 21:28:40,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/6db555736/dd7d356af23f4ac48b5eb2c3920ad5d0 [2024-09-12 21:28:40,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 21:28:40,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 21:28:40,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 21:28:40,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 21:28:40,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 21:28:40,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 09:28:40" (1/1) ... [2024-09-12 21:28:40,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43971c4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:40, skipping insertion in model container [2024-09-12 21:28:40,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 09:28:40" (1/1) ... [2024-09-12 21:28:40,069 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 21:28:40,192 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i[893,906] [2024-09-12 21:28:40,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 21:28:40,222 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 21:28:40,231 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i[893,906] [2024-09-12 21:28:40,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 21:28:40,249 INFO L204 MainTranslator]: Completed translation [2024-09-12 21:28:40,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:40 WrapperNode [2024-09-12 21:28:40,250 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 21:28:40,251 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 21:28:40,251 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 21:28:40,251 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 21:28:40,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:40" (1/1) ... [2024-09-12 21:28:40,264 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:40" (1/1) ... [2024-09-12 21:28:40,269 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 21:28:40,269 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 21:28:40,270 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 21:28:40,270 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 21:28:40,270 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 21:28:40,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:40" (1/1) ... [2024-09-12 21:28:40,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:40" (1/1) ... [2024-09-12 21:28:40,279 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:40" (1/1) ... [2024-09-12 21:28:40,288 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-12 21:28:40,289 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:40" (1/1) ... [2024-09-12 21:28:40,289 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:40" (1/1) ... [2024-09-12 21:28:40,292 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:40" (1/1) ... [2024-09-12 21:28:40,297 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:40" (1/1) ... [2024-09-12 21:28:40,302 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:40" (1/1) ... [2024-09-12 21:28:40,302 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:40" (1/1) ... [2024-09-12 21:28:40,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 21:28:40,304 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 21:28:40,304 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 21:28:40,305 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 21:28:40,306 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:40" (1/1) ... [2024-09-12 21:28:40,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 21:28:40,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:28:40,335 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 21:28:40,336 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 21:28:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 21:28:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 21:28:40,371 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 21:28:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 21:28:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 21:28:40,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 21:28:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 21:28:40,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 21:28:40,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 21:28:40,372 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 21:28:40,417 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 21:28:40,419 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 21:28:40,617 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-09-12 21:28:40,617 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 21:28:40,636 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 21:28:40,636 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-12 21:28:40,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 09:28:40 BoogieIcfgContainer [2024-09-12 21:28:40,637 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 21:28:40,638 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 21:28:40,638 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 21:28:40,642 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 21:28:40,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 09:28:40" (1/3) ... [2024-09-12 21:28:40,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b1ce293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 09:28:40, skipping insertion in model container [2024-09-12 21:28:40,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:40" (2/3) ... [2024-09-12 21:28:40,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b1ce293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 09:28:40, skipping insertion in model container [2024-09-12 21:28:40,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 09:28:40" (3/3) ... [2024-09-12 21:28:40,645 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2024-09-12 21:28:40,657 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 21:28:40,657 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 21:28:40,702 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 21:28:40,707 INFO L336 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@37a697ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 21:28:40,707 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 21:28:40,710 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 32 states have internal predecessors, (47), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-12 21:28:40,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 21:28:40,715 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:40,715 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:28:40,715 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:28:40,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:40,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1997840557, now seen corresponding path program 1 times [2024-09-12 21:28:40,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:40,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585460086] [2024-09-12 21:28:40,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:40,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:40,980 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:40,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:28:40,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:40,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585460086] [2024-09-12 21:28:40,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585460086] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:40,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:40,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 21:28:40,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383935875] [2024-09-12 21:28:40,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:40,997 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 21:28:40,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:41,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 21:28:41,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 21:28:41,018 INFO L87 Difference]: Start difference. First operand has 53 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 32 states have internal predecessors, (47), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:41,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:41,164 INFO L93 Difference]: Finished difference Result 111 states and 206 transitions. [2024-09-12 21:28:41,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 21:28:41,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-12 21:28:41,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:41,173 INFO L225 Difference]: With dead ends: 111 [2024-09-12 21:28:41,173 INFO L226 Difference]: Without dead ends: 63 [2024-09-12 21:28:41,176 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-12 21:28:41,178 INFO L434 NwaCegarLoop]: 73 mSDtfsCounter, 13 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:41,180 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 259 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:28:41,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-12 21:28:41,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2024-09-12 21:28:41,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 30 states have (on average 1.2) internal successors, (36), 34 states have internal predecessors, (36), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-12 21:28:41,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2024-09-12 21:28:41,237 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 16 [2024-09-12 21:28:41,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:41,237 INFO L474 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2024-09-12 21:28:41,238 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:41,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:41,238 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2024-09-12 21:28:41,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-12 21:28:41,239 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:41,240 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:28:41,240 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 21:28:41,240 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:28:41,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:41,241 INFO L85 PathProgramCache]: Analyzing trace with hash 348964071, now seen corresponding path program 1 times [2024-09-12 21:28:41,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:41,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123163336] [2024-09-12 21:28:41,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:41,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:41,415 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:41,422 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-12 21:28:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:41,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:28:41,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:41,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123163336] [2024-09-12 21:28:41,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123163336] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:41,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:41,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 21:28:41,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777945876] [2024-09-12 21:28:41,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:41,436 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 21:28:41,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:41,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 21:28:41,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 21:28:41,438 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 21:28:41,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:41,549 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2024-09-12 21:28:41,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 21:28:41,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-09-12 21:28:41,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:41,552 INFO L225 Difference]: With dead ends: 62 [2024-09-12 21:28:41,553 INFO L226 Difference]: Without dead ends: 60 [2024-09-12 21:28:41,555 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:28:41,556 INFO L434 NwaCegarLoop]: 52 mSDtfsCounter, 15 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:41,557 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 215 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:28:41,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-12 21:28:41,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-09-12 21:28:41,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 37 states have internal predecessors, (39), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-12 21:28:41,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 82 transitions. [2024-09-12 21:28:41,571 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 82 transitions. Word has length 21 [2024-09-12 21:28:41,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:41,572 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 82 transitions. [2024-09-12 21:28:41,572 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 21:28:41,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:41,572 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2024-09-12 21:28:41,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-12 21:28:41,573 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:41,573 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:28:41,573 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 21:28:41,574 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:28:41,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:41,574 INFO L85 PathProgramCache]: Analyzing trace with hash 2112377310, now seen corresponding path program 1 times [2024-09-12 21:28:41,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:41,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334501670] [2024-09-12 21:28:41,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:41,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:41,628 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:41,632 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-12 21:28:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:41,634 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-12 21:28:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:41,636 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-12 21:28:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:41,643 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-12 21:28:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:41,647 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 21:28:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:41,655 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-12 21:28:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:41,663 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-12 21:28:41,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:41,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334501670] [2024-09-12 21:28:41,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334501670] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:41,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:41,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 21:28:41,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096940690] [2024-09-12 21:28:41,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:41,665 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 21:28:41,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:41,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 21:28:41,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 21:28:41,666 INFO L87 Difference]: Start difference. First operand 60 states and 82 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-12 21:28:41,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:41,692 INFO L93 Difference]: Finished difference Result 89 states and 122 transitions. [2024-09-12 21:28:41,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 21:28:41,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2024-09-12 21:28:41,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:41,694 INFO L225 Difference]: With dead ends: 89 [2024-09-12 21:28:41,694 INFO L226 Difference]: Without dead ends: 60 [2024-09-12 21:28:41,695 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 21:28:41,697 INFO L434 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:41,698 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 21:28:41,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-12 21:28:41,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-09-12 21:28:41,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.121212121212121) internal successors, (37), 37 states have internal predecessors, (37), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-12 21:28:41,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2024-09-12 21:28:41,714 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 50 [2024-09-12 21:28:41,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:41,715 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2024-09-12 21:28:41,715 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-12 21:28:41,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:41,716 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2024-09-12 21:28:41,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-09-12 21:28:41,717 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:41,717 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:28:41,718 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 21:28:41,718 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:28:41,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:41,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1527746620, now seen corresponding path program 1 times [2024-09-12 21:28:41,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:41,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813145721] [2024-09-12 21:28:41,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:41,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:41,840 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:41,842 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-12 21:28:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:41,847 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-12 21:28:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:41,850 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-12 21:28:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:41,853 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-12 21:28:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:41,856 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-12 21:28:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:41,863 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-12 21:28:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:41,869 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-12 21:28:41,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:41,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813145721] [2024-09-12 21:28:41,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813145721] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:41,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:41,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 21:28:41,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077603994] [2024-09-12 21:28:41,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:41,871 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 21:28:41,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:41,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 21:28:41,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-12 21:28:41,873 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-12 21:28:41,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:41,981 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2024-09-12 21:28:41,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 21:28:41,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 51 [2024-09-12 21:28:41,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:41,983 INFO L225 Difference]: With dead ends: 67 [2024-09-12 21:28:41,983 INFO L226 Difference]: Without dead ends: 65 [2024-09-12 21:28:41,984 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:28:41,984 INFO L434 NwaCegarLoop]: 50 mSDtfsCounter, 16 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:41,985 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 162 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:28:41,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-09-12 21:28:41,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2024-09-12 21:28:41,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 40 states have internal predecessors, (40), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-12 21:28:41,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2024-09-12 21:28:41,999 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 51 [2024-09-12 21:28:41,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:42,000 INFO L474 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2024-09-12 21:28:42,000 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-12 21:28:42,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:42,000 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2024-09-12 21:28:42,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-09-12 21:28:42,002 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:42,002 INFO L216 NwaCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:28:42,002 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 21:28:42,002 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:28:42,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:42,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1740534074, now seen corresponding path program 1 times [2024-09-12 21:28:42,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:42,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618880136] [2024-09-12 21:28:42,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:42,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,076 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,078 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-12 21:28:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,080 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-12 21:28:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,081 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-12 21:28:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,082 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-12 21:28:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,084 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-12 21:28:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,085 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-12 21:28:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,086 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-12 21:28:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,088 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 21:28:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,089 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-12 21:28:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,090 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-12 21:28:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,092 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-12 21:28:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,094 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-12 21:28:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,096 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-09-12 21:28:42,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:42,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618880136] [2024-09-12 21:28:42,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618880136] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:42,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:42,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 21:28:42,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546983813] [2024-09-12 21:28:42,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:42,097 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 21:28:42,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:42,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 21:28:42,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-12 21:28:42,098 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-09-12 21:28:42,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:42,148 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2024-09-12 21:28:42,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 21:28:42,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 86 [2024-09-12 21:28:42,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:42,150 INFO L225 Difference]: With dead ends: 73 [2024-09-12 21:28:42,150 INFO L226 Difference]: Without dead ends: 71 [2024-09-12 21:28:42,151 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:28:42,151 INFO L434 NwaCegarLoop]: 65 mSDtfsCounter, 6 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:42,152 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 277 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 21:28:42,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-09-12 21:28:42,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2024-09-12 21:28:42,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 43 states have internal predecessors, (43), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-12 21:28:42,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2024-09-12 21:28:42,161 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 86 [2024-09-12 21:28:42,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:42,162 INFO L474 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2024-09-12 21:28:42,162 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-09-12 21:28:42,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:42,162 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2024-09-12 21:28:42,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-09-12 21:28:42,167 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:42,167 INFO L216 NwaCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:28:42,167 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 21:28:42,168 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:28:42,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:42,168 INFO L85 PathProgramCache]: Analyzing trace with hash 268638176, now seen corresponding path program 1 times [2024-09-12 21:28:42,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:42,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220156908] [2024-09-12 21:28:42,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:42,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,287 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,289 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-12 21:28:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,291 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-12 21:28:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,292 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-12 21:28:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,293 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-12 21:28:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,298 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-12 21:28:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,300 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-12 21:28:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,302 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-12 21:28:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,304 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 21:28:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,305 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-12 21:28:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,306 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-12 21:28:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,308 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-12 21:28:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,310 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-12 21:28:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,311 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-09-12 21:28:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:42,313 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-09-12 21:28:42,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:42,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220156908] [2024-09-12 21:28:42,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220156908] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:42,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:42,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 21:28:42,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893262621] [2024-09-12 21:28:42,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:42,315 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 21:28:42,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:42,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 21:28:42,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 21:28:42,315 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-09-12 21:28:42,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:42,380 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2024-09-12 21:28:42,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 21:28:42,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 91 [2024-09-12 21:28:42,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:42,381 INFO L225 Difference]: With dead ends: 74 [2024-09-12 21:28:42,381 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 21:28:42,382 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:28:42,382 INFO L434 NwaCegarLoop]: 69 mSDtfsCounter, 9 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:42,383 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 293 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 21:28:42,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 21:28:42,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 21:28:42,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-12 21:28:42,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 21:28:42,383 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2024-09-12 21:28:42,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:42,383 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 21:28:42,383 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-09-12 21:28:42,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:42,384 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 21:28:42,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 21:28:42,388 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-12 21:28:42,388 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-12 21:28:42,391 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-09-12 21:28:42,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 21:28:42,721 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 21:28:42,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 09:28:42 BoogieIcfgContainer [2024-09-12 21:28:42,736 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 21:28:42,737 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 21:28:42,737 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 21:28:42,737 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 21:28:42,740 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 09:28:40" (3/4) ... [2024-09-12 21:28:42,741 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 21:28:42,744 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 21:28:42,744 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 21:28:42,744 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-12 21:28:42,748 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2024-09-12 21:28:42,749 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-09-12 21:28:42,749 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-12 21:28:42,749 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 21:28:42,824 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 21:28:42,825 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 21:28:42,825 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 21:28:42,828 INFO L158 Benchmark]: Toolchain (without parser) took 2787.33ms. Allocated memory was 176.2MB in the beginning and 270.5MB in the end (delta: 94.4MB). Free memory was 119.6MB in the beginning and 164.3MB in the end (delta: -44.7MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2024-09-12 21:28:42,828 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 176.2MB. Free memory is still 140.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 21:28:42,828 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.12ms. Allocated memory is still 176.2MB. Free memory was 119.3MB in the beginning and 107.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-12 21:28:42,829 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.27ms. Allocated memory is still 176.2MB. Free memory was 107.0MB in the beginning and 106.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 21:28:42,829 INFO L158 Benchmark]: Boogie Preprocessor took 34.10ms. Allocated memory is still 176.2MB. Free memory was 106.0MB in the beginning and 104.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 21:28:42,829 INFO L158 Benchmark]: RCFGBuilder took 332.35ms. Allocated memory is still 176.2MB. Free memory was 104.2MB in the beginning and 88.2MB in the end (delta: 16.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-09-12 21:28:42,829 INFO L158 Benchmark]: TraceAbstraction took 2098.35ms. Allocated memory was 176.2MB in the beginning and 270.5MB in the end (delta: 94.4MB). Free memory was 87.5MB in the beginning and 170.2MB in the end (delta: -82.7MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-09-12 21:28:42,829 INFO L158 Benchmark]: Witness Printer took 90.92ms. Allocated memory is still 270.5MB. Free memory was 170.2MB in the beginning and 164.3MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-12 21:28:42,830 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 176.2MB. Free memory is still 140.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.12ms. Allocated memory is still 176.2MB. Free memory was 119.3MB in the beginning and 107.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.27ms. Allocated memory is still 176.2MB. Free memory was 107.0MB in the beginning and 106.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.10ms. Allocated memory is still 176.2MB. Free memory was 106.0MB in the beginning and 104.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 332.35ms. Allocated memory is still 176.2MB. Free memory was 104.2MB in the beginning and 88.2MB in the end (delta: 16.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2098.35ms. Allocated memory was 176.2MB in the beginning and 270.5MB in the end (delta: 94.4MB). Free memory was 87.5MB in the beginning and 170.2MB in the end (delta: -82.7MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Witness Printer took 90.92ms. Allocated memory is still 270.5MB. Free memory was 170.2MB in the beginning and 164.3MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 107 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 1332 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 954 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 376 IncrementalHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 378 mSDtfsCounter, 376 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=5, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 309 ConstructedInterpolants, 0 QuantifiedInterpolants, 470 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 772/772 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((((long long) cp + 1) <= urilen) && (c == 0)) && (1 <= cp)) || (((1 <= c) && (((long long) cp + 1) <= urilen)) && (1 <= cp))) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((long long) cp + 1) <= urilen) && (1 <= cp)) - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (\old(cond) != 0) Ensures: (\old(cond) != 0) RESULT: Ultimate proved your program to be correct! [2024-09-12 21:28:42,850 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE