/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 01:26:22,521 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 01:26:22,523 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 01:26:22,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 01:26:22,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 01:26:22,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 01:26:22,557 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 01:26:22,559 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 01:26:22,560 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 01:26:22,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 01:26:22,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 01:26:22,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 01:26:22,567 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 01:26:22,569 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 01:26:22,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 01:26:22,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 01:26:22,573 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 01:26:22,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 01:26:22,575 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 01:26:22,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 01:26:22,579 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 01:26:22,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 01:26:22,581 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 01:26:22,582 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 01:26:22,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 01:26:22,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 01:26:22,587 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 01:26:22,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 01:26:22,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 01:26:22,588 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 01:26:22,588 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 01:26:22,589 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 01:26:22,589 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 01:26:22,590 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 01:26:22,590 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 01:26:22,590 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 01:26:22,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 01:26:22,591 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 01:26:22,591 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 01:26:22,591 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 01:26:22,592 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 01:26:22,595 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-04-02 01:26:22,620 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 01:26:22,620 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 01:26:22,621 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 01:26:22,621 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 01:26:22,622 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 01:26:22,622 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 01:26:22,622 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-02 01:26:22,622 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-02 01:26:22,622 INFO L138 SettingsManager]: * Use SBE=true [2023-04-02 01:26:22,622 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 01:26:22,623 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 01:26:22,623 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 01:26:22,623 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 01:26:22,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 01:26:22,623 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 01:26:22,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 01:26:22,624 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 01:26:22,624 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 01:26:22,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 01:26:22,624 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 01:26:22,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 01:26:22,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 01:26:22,624 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-02 01:26:22,624 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 01:26:22,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 01:26:22,624 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 01:26:22,624 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 01:26:22,625 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 01:26:22,625 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-02 01:26:22,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 01:26:22,625 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-02 01:26:22,625 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 01:26:22,625 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-02 01:26:22,625 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-02 01:26:22,625 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-02 01:26:22,626 INFO L138 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/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 [2023-04-02 01:26:22,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 01:26:22,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 01:26:22,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 01:26:22,814 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 01:26:22,814 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 01:26:22,815 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2023-04-02 01:26:23,830 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 01:26:23,996 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 01:26:23,996 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2023-04-02 01:26:24,000 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d073483d/082758968f064ac58a5352381fefc987/FLAGb9712b793 [2023-04-02 01:26:24,010 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d073483d/082758968f064ac58a5352381fefc987 [2023-04-02 01:26:24,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 01:26:24,013 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 01:26:24,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 01:26:24,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 01:26:24,021 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 01:26:24,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 01:26:24" (1/1) ... [2023-04-02 01:26:24,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35415133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:26:24, skipping insertion in model container [2023-04-02 01:26:24,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 01:26:24" (1/1) ... [2023-04-02 01:26:24,027 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 01:26:24,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 01:26:24,132 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i[893,906] [2023-04-02 01:26:24,153 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 01:26:24,160 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 01:26:24,167 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i[893,906] [2023-04-02 01:26:24,174 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 01:26:24,186 INFO L208 MainTranslator]: Completed translation [2023-04-02 01:26:24,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:26:24 WrapperNode [2023-04-02 01:26:24,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 01:26:24,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 01:26:24,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 01:26:24,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 01:26:24,196 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:26:24" (1/1) ... [2023-04-02 01:26:24,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:26:24" (1/1) ... [2023-04-02 01:26:24,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:26:24" (1/1) ... [2023-04-02 01:26:24,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:26:24" (1/1) ... [2023-04-02 01:26:24,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:26:24" (1/1) ... [2023-04-02 01:26:24,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:26:24" (1/1) ... [2023-04-02 01:26:24,225 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:26:24" (1/1) ... [2023-04-02 01:26:24,226 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:26:24" (1/1) ... [2023-04-02 01:26:24,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 01:26:24,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 01:26:24,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 01:26:24,228 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 01:26:24,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:26:24" (1/1) ... [2023-04-02 01:26:24,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 01:26:24,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:26:24,250 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-04-02 01:26:24,260 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-04-02 01:26:24,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 01:26:24,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 01:26:24,284 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 01:26:24,285 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-02 01:26:24,285 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-04-02 01:26:24,285 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 01:26:24,285 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 01:26:24,285 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 01:26:24,285 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2023-04-02 01:26:24,285 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2023-04-02 01:26:24,285 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 01:26:24,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 01:26:24,285 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-02 01:26:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-02 01:26:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-02 01:26:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 01:26:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 01:26:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 01:26:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 01:26:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 01:26:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 01:26:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 01:26:24,357 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 01:26:24,358 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 01:26:24,589 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 01:26:24,594 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 01:26:24,594 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-04-02 01:26:24,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 01:26:24 BoogieIcfgContainer [2023-04-02 01:26:24,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 01:26:24,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 01:26:24,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 01:26:24,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 01:26:24,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 01:26:24" (1/3) ... [2023-04-02 01:26:24,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e01757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 01:26:24, skipping insertion in model container [2023-04-02 01:26:24,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:26:24" (2/3) ... [2023-04-02 01:26:24,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e01757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 01:26:24, skipping insertion in model container [2023-04-02 01:26:24,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 01:26:24" (3/3) ... [2023-04-02 01:26:24,607 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2023-04-02 01:26:24,619 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 01:26:24,619 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 01:26:24,651 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 01:26:24,656 INFO L357 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=LoopsAndPotentialCycles, 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;@3bb33c13, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-02 01:26:24,656 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 01:26:24,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 33 states have internal predecessors, (48), 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) [2023-04-02 01:26:24,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-04-02 01:26:24,664 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:26:24,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:26:24,665 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:26:24,671 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:26:24,672 INFO L85 PathProgramCache]: Analyzing trace with hash -494472251, now seen corresponding path program 1 times [2023-04-02 01:26:24,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:26:24,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673635158] [2023-04-02 01:26:24,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:26:24,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:26:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:24,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:26:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:26:24,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:26:24,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673635158] [2023-04-02 01:26:24,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673635158] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:26:24,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:26:24,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-02 01:26:24,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597552707] [2023-04-02 01:26:24,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:26:24,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 01:26:24,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:26:25,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 01:26:25,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-02 01:26:25,004 INFO L87 Difference]: Start difference. First operand has 54 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 33 states have internal predecessors, (48), 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 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:26:25,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:26:25,437 INFO L93 Difference]: Finished difference Result 112 states and 207 transitions. [2023-04-02 01:26:25,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-02 01:26:25,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 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 17 [2023-04-02 01:26:25,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:26:25,446 INFO L225 Difference]: With dead ends: 112 [2023-04-02 01:26:25,447 INFO L226 Difference]: Without dead ends: 64 [2023-04-02 01:26:25,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-04-02 01:26:25,453 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 86 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-02 01:26:25,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 29 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-02 01:26:25,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-04-02 01:26:25,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2023-04-02 01:26:25,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 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) [2023-04-02 01:26:25,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2023-04-02 01:26:25,509 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 17 [2023-04-02 01:26:25,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:26:25,509 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2023-04-02 01:26:25,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:26:25,510 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2023-04-02 01:26:25,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-04-02 01:26:25,511 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:26:25,511 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:26:25,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-02 01:26:25,511 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:26:25,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:26:25,512 INFO L85 PathProgramCache]: Analyzing trace with hash -730438524, now seen corresponding path program 1 times [2023-04-02 01:26:25,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:26:25,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285199028] [2023-04-02 01:26:25,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:26:25,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:26:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:25,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:26:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:25,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-04-02 01:26:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:25,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:26:25,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:26:25,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285199028] [2023-04-02 01:26:25,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285199028] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:26:25,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:26:25,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-02 01:26:25,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570065887] [2023-04-02 01:26:25,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:26:25,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-02 01:26:25,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:26:25,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-02 01:26:25,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-04-02 01:26:25,637 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-02 01:26:25,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:26:25,869 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2023-04-02 01:26:25,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-02 01:26:25,870 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 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 22 [2023-04-02 01:26:25,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:26:25,874 INFO L225 Difference]: With dead ends: 63 [2023-04-02 01:26:25,874 INFO L226 Difference]: Without dead ends: 61 [2023-04-02 01:26:25,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-04-02 01:26:25,875 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 59 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 01:26:25,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 27 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 01:26:25,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-04-02 01:26:25,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-04-02 01:26:25,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 38 states have internal predecessors, (40), 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) [2023-04-02 01:26:25,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2023-04-02 01:26:25,890 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 22 [2023-04-02 01:26:25,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:26:25,890 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2023-04-02 01:26:25,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-02 01:26:25,891 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2023-04-02 01:26:25,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-04-02 01:26:25,892 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:26:25,892 INFO L195 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] [2023-04-02 01:26:25,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-02 01:26:25,892 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:26:25,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:26:25,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1977228752, now seen corresponding path program 1 times [2023-04-02 01:26:25,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:26:25,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260016402] [2023-04-02 01:26:25,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:26:25,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:26:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:25,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:26:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:25,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-04-02 01:26:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:25,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-04-02 01:26:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:25,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-04-02 01:26:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:25,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-04-02 01:26:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:25,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-04-02 01:26:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:25,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-04-02 01:26:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:25,953 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-04-02 01:26:25,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:26:25,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260016402] [2023-04-02 01:26:25,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260016402] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:26:25,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:26:25,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-02 01:26:25,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849472206] [2023-04-02 01:26:25,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:26:25,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-02 01:26:25,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:26:25,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-02 01:26:25,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-02 01:26:25,956 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-04-02 01:26:26,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:26:26,069 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2023-04-02 01:26:26,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-02 01:26:26,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 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 51 [2023-04-02 01:26:26,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:26:26,073 INFO L225 Difference]: With dead ends: 90 [2023-04-02 01:26:26,073 INFO L226 Difference]: Without dead ends: 61 [2023-04-02 01:26:26,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-04-02 01:26:26,081 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:26:26,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 12 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:26:26,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-04-02 01:26:26,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-04-02 01:26:26,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 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) [2023-04-02 01:26:26,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2023-04-02 01:26:26,105 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 51 [2023-04-02 01:26:26,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:26:26,105 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2023-04-02 01:26:26,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-04-02 01:26:26,106 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2023-04-02 01:26:26,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-04-02 01:26:26,107 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:26:26,108 INFO L195 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, 1] [2023-04-02 01:26:26,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-02 01:26:26,108 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:26:26,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:26:26,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1335676676, now seen corresponding path program 1 times [2023-04-02 01:26:26,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:26:26,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759553825] [2023-04-02 01:26:26,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:26:26,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:26:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:26:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-04-02 01:26:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-04-02 01:26:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-04-02 01:26:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-04-02 01:26:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-04-02 01:26:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-04-02 01:26:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,265 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-04-02 01:26:26,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:26:26,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759553825] [2023-04-02 01:26:26,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759553825] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:26:26,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:26:26,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-02 01:26:26,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714262049] [2023-04-02 01:26:26,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:26:26,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-02 01:26:26,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:26:26,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-02 01:26:26,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-04-02 01:26:26,267 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-04-02 01:26:26,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:26:26,455 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2023-04-02 01:26:26,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-02 01:26:26,456 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 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 52 [2023-04-02 01:26:26,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:26:26,457 INFO L225 Difference]: With dead ends: 68 [2023-04-02 01:26:26,457 INFO L226 Difference]: Without dead ends: 66 [2023-04-02 01:26:26,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-04-02 01:26:26,458 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 43 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:26:26,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 27 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:26:26,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-04-02 01:26:26,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2023-04-02 01:26:26,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 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) [2023-04-02 01:26:26,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2023-04-02 01:26:26,467 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 52 [2023-04-02 01:26:26,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:26:26,468 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2023-04-02 01:26:26,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-04-02 01:26:26,468 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2023-04-02 01:26:26,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-04-02 01:26:26,469 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:26:26,469 INFO L195 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, 1] [2023-04-02 01:26:26,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-04-02 01:26:26,469 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:26:26,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:26:26,470 INFO L85 PathProgramCache]: Analyzing trace with hash -296574164, now seen corresponding path program 1 times [2023-04-02 01:26:26,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:26:26,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126273547] [2023-04-02 01:26:26,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:26:26,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:26:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:26:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-04-02 01:26:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-04-02 01:26:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-04-02 01:26:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-04-02 01:26:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-04-02 01:26:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-04-02 01:26:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-04-02 01:26:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-04-02 01:26:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-04-02 01:26:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-04-02 01:26:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-04-02 01:26:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-04-02 01:26:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,613 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-04-02 01:26:26,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:26:26,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126273547] [2023-04-02 01:26:26,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126273547] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:26:26,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:26:26,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-02 01:26:26,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14962105] [2023-04-02 01:26:26,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:26:26,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-02 01:26:26,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:26:26,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-02 01:26:26,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-04-02 01:26:26,615 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-04-02 01:26:26,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:26:26,771 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2023-04-02 01:26:26,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-02 01:26:26,772 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 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 87 [2023-04-02 01:26:26,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:26:26,773 INFO L225 Difference]: With dead ends: 74 [2023-04-02 01:26:26,773 INFO L226 Difference]: Without dead ends: 72 [2023-04-02 01:26:26,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-04-02 01:26:26,774 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 49 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:26:26,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 22 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:26:26,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-04-02 01:26:26,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2023-04-02 01:26:26,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 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) [2023-04-02 01:26:26,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2023-04-02 01:26:26,783 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 87 [2023-04-02 01:26:26,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:26:26,784 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2023-04-02 01:26:26,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-04-02 01:26:26,784 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2023-04-02 01:26:26,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-04-02 01:26:26,785 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:26:26,785 INFO L195 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, 1] [2023-04-02 01:26:26,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-04-02 01:26:26,785 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:26:26,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:26:26,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1057322499, now seen corresponding path program 1 times [2023-04-02 01:26:26,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:26:26,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195825361] [2023-04-02 01:26:26,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:26:26,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:26:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:26:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-04-02 01:26:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-04-02 01:26:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-04-02 01:26:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-04-02 01:26:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-04-02 01:26:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-04-02 01:26:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-04-02 01:26:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-04-02 01:26:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-04-02 01:26:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-04-02 01:26:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-04-02 01:26:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-04-02 01:26:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-04-02 01:26:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:26:26,894 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-04-02 01:26:26,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:26:26,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195825361] [2023-04-02 01:26:26,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195825361] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:26:26,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:26:26,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-02 01:26:26,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515836056] [2023-04-02 01:26:26,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:26:26,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-02 01:26:26,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:26:26,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-02 01:26:26,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-04-02 01:26:26,896 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-04-02 01:26:27,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:26:27,069 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2023-04-02 01:26:27,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-02 01:26:27,069 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 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 92 [2023-04-02 01:26:27,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:26:27,070 INFO L225 Difference]: With dead ends: 75 [2023-04-02 01:26:27,070 INFO L226 Difference]: Without dead ends: 0 [2023-04-02 01:26:27,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-04-02 01:26:27,071 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 50 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:26:27,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 27 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:26:27,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-04-02 01:26:27,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-04-02 01:26:27,072 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) [2023-04-02 01:26:27,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-04-02 01:26:27,072 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2023-04-02 01:26:27,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:26:27,072 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-04-02 01:26:27,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-04-02 01:26:27,072 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-04-02 01:26:27,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-04-02 01:26:27,074 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-02 01:26:27,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-04-02 01:26:27,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-04-02 01:26:27,334 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2023-04-02 01:26:27,334 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2023-04-02 01:26:27,335 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line 12) no Hoare annotation was computed. [2023-04-02 01:26:27,335 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2023-04-02 01:26:27,335 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2023-04-02 01:26:27,335 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(lines 14 16) no Hoare annotation was computed. [2023-04-02 01:26:27,335 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2023-04-02 01:26:27,335 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 83) no Hoare annotation was computed. [2023-04-02 01:26:27,335 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 80) no Hoare annotation was computed. [2023-04-02 01:26:27,335 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 75) no Hoare annotation was computed. [2023-04-02 01:26:27,335 INFO L899 garLoopResultBuilder]: For program point L36(lines 25 83) no Hoare annotation was computed. [2023-04-02 01:26:27,335 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 69 75) no Hoare annotation was computed. [2023-04-02 01:26:27,335 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 79) no Hoare annotation was computed. [2023-04-02 01:26:27,336 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (<= 1 main_~cp~0)) [2023-04-02 01:26:27,336 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2023-04-02 01:26:27,336 INFO L895 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2023-04-02 01:26:27,336 INFO L899 garLoopResultBuilder]: For program point L37(lines 25 83) no Hoare annotation was computed. [2023-04-02 01:26:27,336 INFO L899 garLoopResultBuilder]: For program point L54(lines 44 80) no Hoare annotation was computed. [2023-04-02 01:26:27,336 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 83) no Hoare annotation was computed. [2023-04-02 01:26:27,336 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 24 83) the Hoare annotation is: true [2023-04-02 01:26:27,337 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0)) [2023-04-02 01:26:27,338 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0)) [2023-04-02 01:26:27,339 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (= main_~c~0 0) (<= 1 main_~cp~0)) [2023-04-02 01:26:27,339 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (= main_~c~0 0) (<= 1 main_~cp~0)) [2023-04-02 01:26:27,339 INFO L895 garLoopResultBuilder]: At program point L47-1(lines 47 52) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2023-04-02 01:26:27,341 INFO L895 garLoopResultBuilder]: At program point L47-2(lines 47 52) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (<= 1 main_~cp~0)) [2023-04-02 01:26:27,341 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0)) [2023-04-02 01:26:27,342 INFO L895 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2023-04-02 01:26:27,342 INFO L895 garLoopResultBuilder]: At program point L56-1(line 56) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2023-04-02 01:26:27,343 INFO L902 garLoopResultBuilder]: At program point L81(lines 25 83) the Hoare annotation is: true [2023-04-02 01:26:27,343 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2023-04-02 01:26:27,343 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0)) [2023-04-02 01:26:27,343 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2023-04-02 01:26:27,343 INFO L895 garLoopResultBuilder]: At program point L65-1(lines 65 77) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (< main_~cp~0 main_~urilen~0)) (.cse2 (<= 1 main_~cp~0))) (or (and .cse0 .cse1 (= main_~c~0 0) .cse2) (and .cse0 (<= 1 main_~c~0) .cse1 .cse2))) [2023-04-02 01:26:27,343 INFO L899 garLoopResultBuilder]: For program point L57(lines 44 80) no Hoare annotation was computed. [2023-04-02 01:26:27,343 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2023-04-02 01:26:27,343 INFO L895 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2023-04-02 01:26:27,344 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2023-04-02 01:26:27,344 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-04-02 01:26:27,344 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2023-04-02 01:26:27,344 INFO L895 garLoopResultBuilder]: At program point L42-1(line 42) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2023-04-02 01:26:27,344 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (< main_~cp~0 main_~urilen~0)) (.cse2 (not (= main_~urilen~0 (+ main_~cp~0 1)))) (.cse3 (<= 1 main_~cp~0))) (or (and .cse0 (<= 1 main_~c~0) .cse1 .cse2 (<= (+ main_~c~0 2) main_~tokenlen~0) .cse3) (and .cse0 .cse1 .cse2 (= main_~c~0 0) .cse3 (<= 2 main_~tokenlen~0)))) [2023-04-02 01:26:27,344 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2023-04-02 01:26:27,344 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (< main_~cp~0 main_~urilen~0)) (.cse2 (not (= main_~urilen~0 (+ main_~cp~0 1)))) (.cse3 (<= 1 main_~cp~0))) (or (and .cse0 (<= 1 main_~c~0) .cse1 .cse2 (<= (+ main_~c~0 2) main_~tokenlen~0) .cse3) (and .cse0 .cse1 .cse2 (= main_~c~0 0) .cse3 (<= 2 main_~tokenlen~0)))) [2023-04-02 01:26:27,344 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2023-04-02 01:26:27,344 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-04-02 01:26:27,344 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2023-04-02 01:26:27,344 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 25 83) no Hoare annotation was computed. [2023-04-02 01:26:27,344 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2023-04-02 01:26:27,345 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2023-04-02 01:26:27,345 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2023-04-02 01:26:27,345 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-04-02 01:26:27,345 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2023-04-02 01:26:27,345 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-04-02 01:26:27,345 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-02 01:26:27,345 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2023-04-02 01:26:27,345 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2023-04-02 01:26:27,345 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 17 22) the Hoare annotation is: true [2023-04-02 01:26:27,345 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-04-02 01:26:27,345 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-04-02 01:26:27,345 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2023-04-02 01:26:27,347 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-04-02 01:26:27,349 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-02 01:26:27,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.04 01:26:27 BoogieIcfgContainer [2023-04-02 01:26:27,360 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-02 01:26:27,362 INFO L158 Benchmark]: Toolchain (without parser) took 3347.64ms. Allocated memory is still 232.8MB. Free memory was 195.8MB in the beginning and 128.6MB in the end (delta: 67.2MB). Peak memory consumption was 67.7MB. Max. memory is 8.0GB. [2023-04-02 01:26:27,362 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 194.0MB. Free memory is still 140.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-02 01:26:27,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.29ms. Allocated memory is still 232.8MB. Free memory was 195.8MB in the beginning and 184.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-04-02 01:26:27,362 INFO L158 Benchmark]: Boogie Preprocessor took 38.53ms. Allocated memory is still 232.8MB. Free memory was 184.8MB in the beginning and 183.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-04-02 01:26:27,362 INFO L158 Benchmark]: RCFGBuilder took 367.95ms. Allocated memory is still 232.8MB. Free memory was 183.2MB in the beginning and 168.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-04-02 01:26:27,363 INFO L158 Benchmark]: TraceAbstraction took 2763.26ms. Allocated memory is still 232.8MB. Free memory was 168.0MB in the beginning and 129.1MB in the end (delta: 38.9MB). Peak memory consumption was 40.5MB. Max. memory is 8.0GB. [2023-04-02 01:26:27,364 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 194.0MB. Free memory is still 140.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 174.29ms. Allocated memory is still 232.8MB. Free memory was 195.8MB in the beginning and 184.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.53ms. Allocated memory is still 232.8MB. Free memory was 184.8MB in the beginning and 183.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 367.95ms. Allocated memory is still 232.8MB. Free memory was 183.2MB in the beginning and 168.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 2763.26ms. Allocated memory is still 232.8MB. Free memory was 168.0MB in the beginning and 129.1MB in the end (delta: 38.9MB). Peak memory consumption was 40.5MB. Max. memory is 8.0GB. * 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]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 387 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 333 mSDsluCounter, 144 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 111 mSDsCounter, 233 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1531 IncrementalHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 233 mSolverCounterUnsat, 33 mSDtfsCounter, 1531 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=5, InterpolantAutomatonStates: 43, 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: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 76 PreInvPairs, 105 NumberOfFragments, 457 HoareAnnotationTreeSize, 76 FomulaSimplifications, 246 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 26 FomulaSimplificationsInter, 280 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 315 ConstructedInterpolants, 0 QuantifiedInterpolants, 502 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]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (((0 < scheme + 1 && cp < urilen) && c == 0) && 1 <= cp) || (((0 < scheme + 1 && 1 <= c) && cp < urilen) && 1 <= cp) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (0 < scheme + 1 && cp + 1 <= urilen) && 1 <= cp RESULT: Ultimate proved your program to be correct! [2023-04-02 01:26:27,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...