/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-23 21:59:06,913 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 21:59:06,918 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 21:59:07,004 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 21:59:07,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 21:59:07,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 21:59:07,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 21:59:07,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 21:59:07,055 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 21:59:07,064 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 21:59:07,067 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 21:59:07,070 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 21:59:07,070 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 21:59:07,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 21:59:07,080 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 21:59:07,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 21:59:07,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 21:59:07,093 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 21:59:07,105 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 21:59:07,116 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 21:59:07,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 21:59:07,125 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 21:59:07,129 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 21:59:07,134 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 21:59:07,151 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 21:59:07,151 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 21:59:07,152 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 21:59:07,156 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 21:59:07,157 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 21:59:07,160 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 21:59:07,161 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 21:59:07,163 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 21:59:07,167 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 21:59:07,169 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 21:59:07,171 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 21:59:07,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 21:59:07,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 21:59:07,174 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 21:59:07,174 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 21:59:07,176 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 21:59:07,178 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 21:59:07,180 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-23 21:59:07,222 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 21:59:07,222 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 21:59:07,232 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 21:59:07,233 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 21:59:07,233 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 21:59:07,234 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 21:59:07,234 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 21:59:07,234 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 21:59:07,234 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 21:59:07,235 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 21:59:07,237 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 21:59:07,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 21:59:07,238 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 21:59:07,238 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 21:59:07,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 21:59:07,239 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-23 21:59:07,239 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 21:59:07,239 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 21:59:07,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 21:59:07,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 21:59:07,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-23 21:59:07,241 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 21:59:07,241 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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 [2020-10-23 21:59:07,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 21:59:07,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 21:59:07,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 21:59:07,916 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 21:59:07,918 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 21:59:07,926 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2020-10-23 21:59:08,059 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60b04f8b7/64b115d6f7ac4afd86fba265c9bb14ae/FLAG4bd893a45 [2020-10-23 21:59:09,097 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 21:59:09,097 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2020-10-23 21:59:09,120 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60b04f8b7/64b115d6f7ac4afd86fba265c9bb14ae/FLAG4bd893a45 [2020-10-23 21:59:09,390 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60b04f8b7/64b115d6f7ac4afd86fba265c9bb14ae [2020-10-23 21:59:09,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 21:59:09,410 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 21:59:09,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 21:59:09,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 21:59:09,421 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 21:59:09,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:59:09" (1/1) ... [2020-10-23 21:59:09,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d9c990f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:59:09, skipping insertion in model container [2020-10-23 21:59:09,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:59:09" (1/1) ... [2020-10-23 21:59:09,448 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 21:59:09,493 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 21:59:09,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 21:59:09,831 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 21:59:09,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 21:59:09,982 INFO L208 MainTranslator]: Completed translation [2020-10-23 21:59:09,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:59:09 WrapperNode [2020-10-23 21:59:09,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 21:59:09,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 21:59:09,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 21:59:09,988 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 21:59:10,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:59:09" (1/1) ... [2020-10-23 21:59:10,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:59:09" (1/1) ... [2020-10-23 21:59:10,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:59:09" (1/1) ... [2020-10-23 21:59:10,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:59:09" (1/1) ... [2020-10-23 21:59:10,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:59:09" (1/1) ... [2020-10-23 21:59:10,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:59:09" (1/1) ... [2020-10-23 21:59:10,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:59:09" (1/1) ... [2020-10-23 21:59:10,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 21:59:10,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 21:59:10,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 21:59:10,149 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 21:59:10,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:59:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 21:59:10,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 21:59:10,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 21:59:10,327 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 21:59:10,328 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-10-23 21:59:10,328 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-10-23 21:59:10,329 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 21:59:10,329 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 21:59:10,329 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 21:59:10,330 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-10-23 21:59:10,330 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-10-23 21:59:10,330 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 21:59:10,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 21:59:10,332 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-10-23 21:59:10,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-10-23 21:59:10,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-23 21:59:10,333 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 21:59:10,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 21:59:10,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 21:59:10,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 21:59:10,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 21:59:10,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 21:59:10,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 21:59:11,237 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 21:59:11,238 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-10-23 21:59:11,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:59:11 BoogieIcfgContainer [2020-10-23 21:59:11,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 21:59:11,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 21:59:11,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 21:59:11,256 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 21:59:11,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 09:59:09" (1/3) ... [2020-10-23 21:59:11,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@635086da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:59:11, skipping insertion in model container [2020-10-23 21:59:11,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:59:09" (2/3) ... [2020-10-23 21:59:11,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@635086da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:59:11, skipping insertion in model container [2020-10-23 21:59:11,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:59:11" (3/3) ... [2020-10-23 21:59:11,268 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2020-10-23 21:59:11,296 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-23 21:59:11,306 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 21:59:11,331 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 21:59:11,405 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 21:59:11,405 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 21:59:11,406 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-10-23 21:59:11,406 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 21:59:11,406 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 21:59:11,406 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 21:59:11,406 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 21:59:11,407 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 21:59:11,438 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2020-10-23 21:59:11,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-23 21:59:11,457 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 21:59:11,459 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 21:59:11,460 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 21:59:11,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 21:59:11,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1591405496, now seen corresponding path program 1 times [2020-10-23 21:59:11,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 21:59:11,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1515235808] [2020-10-23 21:59:11,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 21:59:11,643 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 21:59:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:12,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 21:59:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:12,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 21:59:12,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1515235808] [2020-10-23 21:59:12,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 21:59:12,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-23 21:59:12,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157049437] [2020-10-23 21:59:12,180 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-23 21:59:12,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 21:59:12,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-23 21:59:12,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-23 21:59:12,213 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 7 states. [2020-10-23 21:59:13,035 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-10-23 21:59:14,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 21:59:14,721 INFO L93 Difference]: Finished difference Result 193 states and 291 transitions. [2020-10-23 21:59:14,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-23 21:59:14,724 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2020-10-23 21:59:14,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 21:59:14,742 INFO L225 Difference]: With dead ends: 193 [2020-10-23 21:59:14,742 INFO L226 Difference]: Without dead ends: 112 [2020-10-23 21:59:14,751 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-10-23 21:59:14,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-23 21:59:14,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2020-10-23 21:59:14,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-10-23 21:59:14,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2020-10-23 21:59:14,883 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 39 [2020-10-23 21:59:14,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 21:59:14,885 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 125 transitions. [2020-10-23 21:59:14,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-23 21:59:14,885 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2020-10-23 21:59:14,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-10-23 21:59:14,889 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 21:59:14,890 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 21:59:14,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 21:59:14,891 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 21:59:14,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 21:59:14,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1635530832, now seen corresponding path program 1 times [2020-10-23 21:59:14,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 21:59:14,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1908486801] [2020-10-23 21:59:14,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 21:59:14,899 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 21:59:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:15,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 21:59:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:15,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-10-23 21:59:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:15,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 21:59:15,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1908486801] [2020-10-23 21:59:15,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 21:59:15,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-23 21:59:15,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699534952] [2020-10-23 21:59:15,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 21:59:15,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 21:59:15,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 21:59:15,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-23 21:59:15,205 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. Second operand 8 states. [2020-10-23 21:59:16,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 21:59:16,303 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2020-10-23 21:59:16,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-23 21:59:16,305 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2020-10-23 21:59:16,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 21:59:16,311 INFO L225 Difference]: With dead ends: 110 [2020-10-23 21:59:16,311 INFO L226 Difference]: Without dead ends: 106 [2020-10-23 21:59:16,314 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-23 21:59:16,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-23 21:59:16,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-10-23 21:59:16,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-23 21:59:16,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 128 transitions. [2020-10-23 21:59:16,355 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 128 transitions. Word has length 44 [2020-10-23 21:59:16,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 21:59:16,356 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 128 transitions. [2020-10-23 21:59:16,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 21:59:16,356 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 128 transitions. [2020-10-23 21:59:16,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-10-23 21:59:16,360 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 21:59:16,360 INFO L422 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 21:59:16,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 21:59:16,361 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 21:59:16,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 21:59:16,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1417093932, now seen corresponding path program 1 times [2020-10-23 21:59:16,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 21:59:16,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [669349110] [2020-10-23 21:59:16,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 21:59:16,368 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 21:59:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:16,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 21:59:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:16,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-10-23 21:59:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:16,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-23 21:59:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:16,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-23 21:59:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:16,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-23 21:59:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:16,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-10-23 21:59:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:16,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-10-23 21:59:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:16,613 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-23 21:59:16,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [669349110] [2020-10-23 21:59:16,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 21:59:16,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 21:59:16,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079247072] [2020-10-23 21:59:16,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 21:59:16,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 21:59:16,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 21:59:16,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 21:59:16,622 INFO L87 Difference]: Start difference. First operand 106 states and 128 transitions. Second operand 4 states. [2020-10-23 21:59:17,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 21:59:17,203 INFO L93 Difference]: Finished difference Result 151 states and 184 transitions. [2020-10-23 21:59:17,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 21:59:17,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-10-23 21:59:17,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 21:59:17,207 INFO L225 Difference]: With dead ends: 151 [2020-10-23 21:59:17,208 INFO L226 Difference]: Without dead ends: 106 [2020-10-23 21:59:17,210 INFO L677 BasicCegarLoop]: 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 [2020-10-23 21:59:17,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-23 21:59:17,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-10-23 21:59:17,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-23 21:59:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2020-10-23 21:59:17,249 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 74 [2020-10-23 21:59:17,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 21:59:17,250 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2020-10-23 21:59:17,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 21:59:17,250 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2020-10-23 21:59:17,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-10-23 21:59:17,253 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 21:59:17,254 INFO L422 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 21:59:17,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-23 21:59:17,255 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 21:59:17,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 21:59:17,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1237786455, now seen corresponding path program 1 times [2020-10-23 21:59:17,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 21:59:17,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [599535303] [2020-10-23 21:59:17,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 21:59:17,262 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 21:59:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:17,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 21:59:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:17,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-10-23 21:59:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:17,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-23 21:59:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:17,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-23 21:59:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:17,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-23 21:59:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:17,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-23 21:59:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:17,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-10-23 21:59:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-23 21:59:17,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [599535303] [2020-10-23 21:59:17,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 21:59:17,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-23 21:59:17,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704881587] [2020-10-23 21:59:17,740 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 21:59:17,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 21:59:17,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 21:59:17,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-23 21:59:17,742 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand 8 states. [2020-10-23 21:59:18,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 21:59:18,813 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2020-10-23 21:59:18,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-23 21:59:18,814 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2020-10-23 21:59:18,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 21:59:18,817 INFO L225 Difference]: With dead ends: 114 [2020-10-23 21:59:18,818 INFO L226 Difference]: Without dead ends: 110 [2020-10-23 21:59:18,819 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-23 21:59:18,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-23 21:59:18,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-10-23 21:59:18,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-10-23 21:59:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 129 transitions. [2020-10-23 21:59:18,862 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 129 transitions. Word has length 77 [2020-10-23 21:59:18,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 21:59:18,868 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 129 transitions. [2020-10-23 21:59:18,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 21:59:18,869 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 129 transitions. [2020-10-23 21:59:18,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-10-23 21:59:18,880 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 21:59:18,884 INFO L422 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 21:59:18,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-23 21:59:18,885 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 21:59:18,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 21:59:18,887 INFO L82 PathProgramCache]: Analyzing trace with hash 84471203, now seen corresponding path program 1 times [2020-10-23 21:59:18,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 21:59:18,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1383894671] [2020-10-23 21:59:18,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 21:59:18,900 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 21:59:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:19,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 21:59:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:19,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-10-23 21:59:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:19,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-23 21:59:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:19,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-23 21:59:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:19,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-23 21:59:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:19,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-23 21:59:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:19,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-10-23 21:59:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:19,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-10-23 21:59:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:19,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-10-23 21:59:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:19,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-10-23 21:59:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:19,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-10-23 21:59:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:19,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-10-23 21:59:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:19,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-10-23 21:59:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:19,236 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-10-23 21:59:19,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1383894671] [2020-10-23 21:59:19,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 21:59:19,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-23 21:59:19,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933901141] [2020-10-23 21:59:19,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-23 21:59:19,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 21:59:19,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-23 21:59:19,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-23 21:59:19,240 INFO L87 Difference]: Start difference. First operand 110 states and 129 transitions. Second operand 7 states. [2020-10-23 21:59:20,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 21:59:20,179 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2020-10-23 21:59:20,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-23 21:59:20,180 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 123 [2020-10-23 21:59:20,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 21:59:20,183 INFO L225 Difference]: With dead ends: 123 [2020-10-23 21:59:20,184 INFO L226 Difference]: Without dead ends: 119 [2020-10-23 21:59:20,185 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-23 21:59:20,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-10-23 21:59:20,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2020-10-23 21:59:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-10-23 21:59:20,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 132 transitions. [2020-10-23 21:59:20,222 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 132 transitions. Word has length 123 [2020-10-23 21:59:20,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 21:59:20,223 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 132 transitions. [2020-10-23 21:59:20,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-23 21:59:20,223 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 132 transitions. [2020-10-23 21:59:20,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-10-23 21:59:20,240 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 21:59:20,241 INFO L422 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 21:59:20,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-23 21:59:20,243 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 21:59:20,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 21:59:20,244 INFO L82 PathProgramCache]: Analyzing trace with hash -749261739, now seen corresponding path program 1 times [2020-10-23 21:59:20,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 21:59:20,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1974138169] [2020-10-23 21:59:20,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 21:59:20,251 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 21:59:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:20,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 21:59:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:20,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-10-23 21:59:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:20,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-23 21:59:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:20,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-23 21:59:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:20,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-23 21:59:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:20,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-23 21:59:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:20,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-10-23 21:59:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:20,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-10-23 21:59:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:20,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-10-23 21:59:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:20,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-10-23 21:59:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:20,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-10-23 21:59:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:20,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-10-23 21:59:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:20,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-10-23 21:59:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:20,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-10-23 21:59:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 21:59:20,739 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-10-23 21:59:20,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1974138169] [2020-10-23 21:59:20,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 21:59:20,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-23 21:59:20,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490443393] [2020-10-23 21:59:20,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-23 21:59:20,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 21:59:20,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-23 21:59:20,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-23 21:59:20,757 INFO L87 Difference]: Start difference. First operand 114 states and 132 transitions. Second operand 7 states. [2020-10-23 21:59:21,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 21:59:21,845 INFO L93 Difference]: Finished difference Result 126 states and 147 transitions. [2020-10-23 21:59:21,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-23 21:59:21,846 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2020-10-23 21:59:21,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 21:59:21,849 INFO L225 Difference]: With dead ends: 126 [2020-10-23 21:59:21,850 INFO L226 Difference]: Without dead ends: 0 [2020-10-23 21:59:21,856 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-23 21:59:21,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-23 21:59:21,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-23 21:59:21,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-23 21:59:21,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-23 21:59:21,858 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 128 [2020-10-23 21:59:21,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 21:59:21,861 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-23 21:59:21,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-23 21:59:21,864 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-23 21:59:21,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-23 21:59:21,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-23 21:59:21,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-23 21:59:23,356 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2020-10-23 21:59:23,481 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 11 [2020-10-23 21:59:23,653 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2020-10-23 21:59:23,865 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2020-10-23 21:59:24,044 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2020-10-23 21:59:24,961 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2020-10-23 21:59:25,098 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 16 [2020-10-23 21:59:25,266 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 20 [2020-10-23 21:59:25,473 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2020-10-23 21:59:26,176 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2020-10-23 21:59:26,458 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2020-10-23 21:59:26,741 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2020-10-23 21:59:27,031 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2020-10-23 21:59:27,461 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 12) the Hoare annotation is: true [2020-10-23 21:59:27,462 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 12) the Hoare annotation is: true [2020-10-23 21:59:27,462 INFO L277 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-10-23 21:59:27,462 INFO L277 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-10-23 21:59:27,462 INFO L277 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: true [2020-10-23 21:59:27,463 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: true [2020-10-23 21:59:27,463 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-23 21:59:27,463 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-23 21:59:27,463 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 12) the Hoare annotation is: true [2020-10-23 21:59:27,463 INFO L277 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-10-23 21:59:27,463 INFO L277 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-10-23 21:59:27,464 INFO L277 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-10-23 21:59:27,464 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string0.offset| |old(#t~string0.offset)|) (= |old(#length)| |#length|) (= |#t~string1.base| |old(#t~string1.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string0.base| |old(#t~string0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|) (= |#t~string1.offset| |old(#t~string1.offset)|)) [2020-10-23 21:59:27,464 INFO L277 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: true [2020-10-23 21:59:27,464 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-23 21:59:27,465 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-23 21:59:27,465 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-23 21:59:27,465 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-23 21:59:27,465 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-23 21:59:27,465 INFO L274 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-10-23 21:59:27,465 INFO L274 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-10-23 21:59:27,466 INFO L274 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2020-10-23 21:59:27,466 INFO L274 CegarLoopResult]: For program point L15-3(lines 14 16) no Hoare annotation was computed. [2020-10-23 21:59:27,468 INFO L274 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2020-10-23 21:59:27,469 INFO L270 CegarLoopResult]: At program point L60(line 60) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,469 INFO L277 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-10-23 21:59:27,469 INFO L277 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: true [2020-10-23 21:59:27,469 INFO L277 CegarLoopResult]: At program point mainEXIT(lines 24 83) the Hoare annotation is: true [2020-10-23 21:59:27,470 INFO L270 CegarLoopResult]: At program point L44(lines 44 80) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,470 INFO L270 CegarLoopResult]: At program point L44-1(line 44) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,470 INFO L270 CegarLoopResult]: At program point L44-3(line 44) the Hoare annotation is: (and (<= (+ main_~cp~0 1) main_~urilen~0) (<= (+ main_~scheme~0 1) main_~urilen~0)) [2020-10-23 21:59:27,470 INFO L270 CegarLoopResult]: At program point L69(lines 69 75) the Hoare annotation is: (let ((.cse0 (< 0 main_~scheme~0)) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse3 (<= (+ main_~scheme~0 1) main_~urilen~0)) (.cse4 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse5 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-10-23 21:59:27,471 INFO L277 CegarLoopResult]: At program point L36(lines 25 83) the Hoare annotation is: true [2020-10-23 21:59:27,471 INFO L270 CegarLoopResult]: At program point L69-1(line 69) the Hoare annotation is: (let ((.cse0 (< 0 main_~scheme~0)) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse3 (<= (+ main_~scheme~0 1) main_~urilen~0)) (.cse4 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse5 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-10-23 21:59:27,471 INFO L270 CegarLoopResult]: At program point L69-2(line 69) the Hoare annotation is: (let ((.cse0 (< 0 main_~scheme~0)) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse3 (<= (+ main_~scheme~0 1) main_~urilen~0)) (.cse4 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse5 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-10-23 21:59:27,472 INFO L270 CegarLoopResult]: At program point L69-3(lines 69 75) the Hoare annotation is: (let ((.cse0 (< 0 main_~scheme~0)) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~scheme~0 1) main_~urilen~0)) (.cse3 (<= (+ main_~c~0 1) main_~tokenlen~0)) (.cse4 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse5 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-10-23 21:59:27,472 INFO L270 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,472 INFO L277 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-10-23 21:59:27,472 INFO L270 CegarLoopResult]: At program point L61-1(lines 61 79) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,472 INFO L277 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: true [2020-10-23 21:59:27,473 INFO L270 CegarLoopResult]: At program point L61-2(line 61) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,473 INFO L277 CegarLoopResult]: At program point L61-3(line 61) the Hoare annotation is: true [2020-10-23 21:59:27,473 INFO L270 CegarLoopResult]: At program point L53(line 53) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,473 INFO L270 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,474 INFO L270 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,474 INFO L270 CegarLoopResult]: At program point L70(line 70) the Hoare annotation is: (let ((.cse0 (< 0 main_~scheme~0)) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse3 (<= (+ main_~scheme~0 1) main_~urilen~0)) (.cse4 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse5 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-10-23 21:59:27,474 INFO L270 CegarLoopResult]: At program point L37(lines 25 83) the Hoare annotation is: (< 0 (+ main_~scheme~0 1)) [2020-10-23 21:59:27,474 INFO L270 CegarLoopResult]: At program point L70-1(line 70) the Hoare annotation is: (let ((.cse0 (< 0 main_~scheme~0)) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse3 (<= (+ main_~scheme~0 1) main_~urilen~0)) (.cse4 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse5 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-10-23 21:59:27,474 INFO L270 CegarLoopResult]: At program point L70-2(line 70) the Hoare annotation is: (and (<= 1 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,475 INFO L270 CegarLoopResult]: At program point L62(line 62) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,475 INFO L277 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: true [2020-10-23 21:59:27,475 INFO L277 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: true [2020-10-23 21:59:27,475 INFO L277 CegarLoopResult]: At program point L29-2(line 29) the Hoare annotation is: true [2020-10-23 21:59:27,475 INFO L270 CegarLoopResult]: At program point L54(lines 44 80) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,476 INFO L277 CegarLoopResult]: At program point mainFINAL(lines 24 83) the Hoare annotation is: true [2020-10-23 21:59:27,476 INFO L270 CegarLoopResult]: At program point L71(line 71) the Hoare annotation is: (and (<= 1 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,476 INFO L270 CegarLoopResult]: At program point L71-1(line 71) the Hoare annotation is: (and (<= 1 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,476 INFO L270 CegarLoopResult]: At program point L63(line 63) the Hoare annotation is: (and (< 0 main_~scheme~0) (= main_~c~0 0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,477 INFO L277 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-10-23 21:59:27,477 INFO L270 CegarLoopResult]: At program point L63-1(line 63) the Hoare annotation is: (and (< 0 main_~scheme~0) (= main_~c~0 0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,477 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 24 83) the Hoare annotation is: true [2020-10-23 21:59:27,477 INFO L277 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: true [2020-10-23 21:59:27,477 INFO L277 CegarLoopResult]: At program point L30-2(line 30) the Hoare annotation is: true [2020-10-23 21:59:27,478 INFO L270 CegarLoopResult]: At program point L47-1(lines 46 52) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,478 INFO L270 CegarLoopResult]: At program point L47-2(lines 47 52) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,478 INFO L270 CegarLoopResult]: At program point L72(line 72) the Hoare annotation is: (and (<= 1 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,478 INFO L277 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-10-23 21:59:27,478 INFO L277 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: true [2020-10-23 21:59:27,478 INFO L277 CegarLoopResult]: At program point L31-2(line 31) the Hoare annotation is: true [2020-10-23 21:59:27,479 INFO L270 CegarLoopResult]: At program point L56(line 56) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,479 INFO L270 CegarLoopResult]: At program point L56-1(line 56) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,479 INFO L277 CegarLoopResult]: At program point L81(lines 25 83) the Hoare annotation is: true [2020-10-23 21:59:27,479 INFO L270 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,480 INFO L270 CegarLoopResult]: At program point L48-1(line 48) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,480 INFO L270 CegarLoopResult]: At program point L48-2(line 48) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,480 INFO L270 CegarLoopResult]: At program point L48-4(line 48) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,480 INFO L270 CegarLoopResult]: At program point L73(line 73) the Hoare annotation is: (and (<= 1 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,480 INFO L277 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-10-23 21:59:27,481 INFO L270 CegarLoopResult]: At program point L65-1(lines 64 77) the Hoare annotation is: (let ((.cse0 (< 0 main_~scheme~0)) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~scheme~0 1) main_~urilen~0)) (.cse3 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3) (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3))) [2020-10-23 21:59:27,481 INFO L277 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: true [2020-10-23 21:59:27,481 INFO L270 CegarLoopResult]: At program point L57(lines 44 80) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,481 INFO L270 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,481 INFO L270 CegarLoopResult]: At program point L49-1(line 49) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,482 INFO L270 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= (+ main_~scheme~0 1) main_~urilen~0)) [2020-10-23 21:59:27,482 INFO L277 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-10-23 21:59:27,482 INFO L277 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: true [2020-10-23 21:59:27,482 INFO L270 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,483 INFO L270 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,483 INFO L270 CegarLoopResult]: At program point L42-1(line 42) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,483 INFO L270 CegarLoopResult]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (< 0 main_~scheme~0)) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse3 (<= (+ main_~scheme~0 1) main_~urilen~0)) (.cse4 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse5 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-10-23 21:59:27,487 INFO L277 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-10-23 21:59:27,487 INFO L270 CegarLoopResult]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse0 (< 0 main_~scheme~0)) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse3 (<= (+ main_~scheme~0 1) main_~urilen~0)) (.cse4 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse5 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-10-23 21:59:27,488 INFO L277 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: true [2020-10-23 21:59:27,488 INFO L270 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,488 INFO L270 CegarLoopResult]: At program point L59-1(line 59) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,488 INFO L270 CegarLoopResult]: At program point L59-2(line 59) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,488 INFO L270 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,489 INFO L270 CegarLoopResult]: At program point L51-1(line 51) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,490 INFO L270 CegarLoopResult]: At program point L76(line 76) the Hoare annotation is: (let ((.cse0 (< 0 main_~scheme~0)) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~scheme~0 1) main_~urilen~0)) (.cse3 (<= (+ main_~c~0 1) main_~tokenlen~0)) (.cse4 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse5 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-10-23 21:59:27,491 INFO L270 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-10-23 21:59:27,491 INFO L270 CegarLoopResult]: At program point L76-1(line 76) the Hoare annotation is: (let ((.cse0 (< 0 main_~scheme~0)) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~scheme~0 1) main_~urilen~0)) (.cse3 (<= (+ main_~c~0 1) main_~tokenlen~0)) (.cse4 (< main_~cp~0 main_~urilen~0))) (or (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3 .cse4))) [2020-10-23 21:59:27,491 INFO L270 CegarLoopResult]: At program point L68(line 68) the Hoare annotation is: (let ((.cse0 (< 0 main_~scheme~0)) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse3 (<= (+ main_~scheme~0 1) main_~urilen~0)) (.cse4 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse5 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-10-23 21:59:27,491 INFO L277 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-10-23 21:59:27,492 INFO L277 CegarLoopResult]: At program point L35-1(lines 25 83) the Hoare annotation is: true [2020-10-23 21:59:27,492 INFO L270 CegarLoopResult]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-10-23 21:59:27,492 INFO L277 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2020-10-23 21:59:27,492 INFO L270 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-10-23 21:59:27,492 INFO L270 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-10-23 21:59:27,493 INFO L270 CegarLoopResult]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-10-23 21:59:27,493 INFO L270 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-10-23 21:59:27,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 09:59:27 BoogieIcfgContainer [2020-10-23 21:59:27,531 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-23 21:59:27,535 INFO L168 Benchmark]: Toolchain (without parser) took 18133.21 ms. Allocated memory was 151.0 MB in the beginning and 220.2 MB in the end (delta: 69.2 MB). Free memory was 128.5 MB in the beginning and 121.8 MB in the end (delta: 6.7 MB). Peak memory consumption was 101.6 MB. Max. memory is 8.0 GB. [2020-10-23 21:59:27,536 INFO L168 Benchmark]: CDTParser took 0.69 ms. Allocated memory is still 151.0 MB. Free memory is still 123.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 21:59:27,537 INFO L168 Benchmark]: CACSL2BoogieTranslator took 571.65 ms. Allocated memory is still 151.0 MB. Free memory was 128.0 MB in the beginning and 117.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2020-10-23 21:59:27,538 INFO L168 Benchmark]: Boogie Preprocessor took 157.47 ms. Allocated memory is still 151.0 MB. Free memory was 117.1 MB in the beginning and 115.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-23 21:59:27,539 INFO L168 Benchmark]: RCFGBuilder took 1095.94 ms. Allocated memory is still 151.0 MB. Free memory was 115.5 MB in the beginning and 123.4 MB in the end (delta: -7.9 MB). Peak memory consumption was 16.7 MB. Max. memory is 8.0 GB. [2020-10-23 21:59:27,541 INFO L168 Benchmark]: TraceAbstraction took 16283.77 ms. Allocated memory was 151.0 MB in the beginning and 220.2 MB in the end (delta: 69.2 MB). Free memory was 122.9 MB in the beginning and 121.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 95.4 MB. Max. memory is 8.0 GB. [2020-10-23 21:59:27,545 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.69 ms. Allocated memory is still 151.0 MB. Free memory is still 123.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 571.65 ms. Allocated memory is still 151.0 MB. Free memory was 128.0 MB in the beginning and 117.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 157.47 ms. Allocated memory is still 151.0 MB. Free memory was 117.1 MB in the beginning and 115.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1095.94 ms. Allocated memory is still 151.0 MB. Free memory was 115.5 MB in the beginning and 123.4 MB in the end (delta: -7.9 MB). Peak memory consumption was 16.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 16283.77 ms. Allocated memory was 151.0 MB in the beginning and 220.2 MB in the end (delta: 69.2 MB). Free memory was 122.9 MB in the beginning and 121.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 95.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((0 < scheme && 1 <= cp) && scheme + 1 <= urilen) && cp < urilen - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: ((((0 < scheme && c == 0) && 1 <= cp) && scheme + 1 <= urilen) && cp < urilen) || ((((1 <= c && 0 < scheme) && 1 <= cp) && scheme + 1 <= urilen) && cp < urilen) - ProcedureContractResult [Line: 12]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 10.4s, OverallIterations: 6, TraceHistogramMax: 14, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 543 SDtfs, 663 SDslu, 574 SDs, 0 SdLazy, 1774 SolverSat, 371 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 105 LocationsWithAnnotation, 435 PreInvPairs, 564 NumberOfFragments, 1524 HoareAnnotationTreeSize, 435 FomulaSimplifications, 1648 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 105 FomulaSimplificationsInter, 2776 FormulaSimplificationTreeSizeReductionInter, 4.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...