java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 11:58:40,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 11:58:40,388 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 11:58:40,405 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 11:58:40,405 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 11:58:40,407 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 11:58:40,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 11:58:40,421 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 11:58:40,422 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 11:58:40,424 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 11:58:40,426 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 11:58:40,429 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 11:58:40,429 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 11:58:40,432 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 11:58:40,434 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 11:58:40,437 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 11:58:40,437 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 11:58:40,440 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 11:58:40,442 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 11:58:40,445 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 11:58:40,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 11:58:40,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 11:58:40,453 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 11:58:40,454 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 11:58:40,456 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 11:58:40,456 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 11:58:40,457 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 11:58:40,459 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 11:58:40,460 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 11:58:40,461 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 11:58:40,461 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 11:58:40,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 11:58:40,464 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 11:58:40,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 11:58:40,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 11:58:40,467 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 11:58:40,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 11:58:40,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 11:58:40,468 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 11:58:40,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 11:58:40,469 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 11:58:40,471 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 [2019-09-05 11:58:40,494 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 11:58:40,495 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 11:58:40,497 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 11:58:40,497 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 11:58:40,497 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 11:58:40,498 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 11:58:40,498 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 11:58:40,498 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 11:58:40,498 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 11:58:40,498 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 11:58:40,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 11:58:40,500 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 11:58:40,500 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 11:58:40,500 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 11:58:40,501 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 11:58:40,501 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 11:58:40,501 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 11:58:40,501 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 11:58:40,501 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 11:58:40,502 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 11:58:40,502 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 11:58:40,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:58:40,502 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 11:58:40,502 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 11:58:40,503 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 11:58:40,503 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 11:58:40,503 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 11:58:40,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 11:58:40,504 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 11:58:40,554 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 11:58:40,571 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 11:58:40,574 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 11:58:40,576 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 11:58:40,576 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 11:58:40,577 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2019-09-05 11:58:40,634 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e82e2acd/95bf6d9db646430c93167c22f46ed3f4/FLAG83059194a [2019-09-05 11:58:41,061 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 11:58:41,062 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2019-09-05 11:58:41,071 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e82e2acd/95bf6d9db646430c93167c22f46ed3f4/FLAG83059194a [2019-09-05 11:58:41,438 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e82e2acd/95bf6d9db646430c93167c22f46ed3f4 [2019-09-05 11:58:41,448 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 11:58:41,449 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 11:58:41,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 11:58:41,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 11:58:41,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 11:58:41,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:58:41" (1/1) ... [2019-09-05 11:58:41,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48f43b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:41, skipping insertion in model container [2019-09-05 11:58:41,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:58:41" (1/1) ... [2019-09-05 11:58:41,463 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 11:58:41,481 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 11:58:41,668 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:58:41,671 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 11:58:41,696 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:58:41,710 INFO L192 MainTranslator]: Completed translation [2019-09-05 11:58:41,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:41 WrapperNode [2019-09-05 11:58:41,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 11:58:41,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 11:58:41,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 11:58:41,712 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 11:58:41,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:41" (1/1) ... [2019-09-05 11:58:41,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:41" (1/1) ... [2019-09-05 11:58:41,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:41" (1/1) ... [2019-09-05 11:58:41,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:41" (1/1) ... [2019-09-05 11:58:41,845 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:41" (1/1) ... [2019-09-05 11:58:41,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:41" (1/1) ... [2019-09-05 11:58:41,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:41" (1/1) ... [2019-09-05 11:58:41,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 11:58:41,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 11:58:41,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 11:58:41,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 11:58:41,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:41" (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 [2019-09-05 11:58:41,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 11:58:41,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 11:58:41,906 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 11:58:41,906 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 11:58:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 11:58:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 11:58:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 11:58:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 11:58:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 11:58:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 11:58:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 11:58:42,246 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 11:58:42,246 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-05 11:58:42,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:58:42 BoogieIcfgContainer [2019-09-05 11:58:42,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 11:58:42,249 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 11:58:42,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 11:58:42,253 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 11:58:42,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 11:58:41" (1/3) ... [2019-09-05 11:58:42,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3259ad88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:58:42, skipping insertion in model container [2019-09-05 11:58:42,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:41" (2/3) ... [2019-09-05 11:58:42,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3259ad88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:58:42, skipping insertion in model container [2019-09-05 11:58:42,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:58:42" (3/3) ... [2019-09-05 11:58:42,256 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2019-09-05 11:58:42,265 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 11:58:42,273 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 11:58:42,289 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 11:58:42,319 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 11:58:42,320 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 11:58:42,320 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 11:58:42,320 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 11:58:42,320 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 11:58:42,320 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 11:58:42,321 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 11:58:42,321 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 11:58:42,321 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 11:58:42,340 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-09-05 11:58:42,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 11:58:42,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:42,345 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:58:42,347 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:42,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:42,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1277279000, now seen corresponding path program 1 times [2019-09-05 11:58:42,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:42,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:42,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:42,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:42,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:42,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:58:42,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:42,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:58:42,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:58:42,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:58:42,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:58:42,550 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 5 states. [2019-09-05 11:58:42,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:42,833 INFO L93 Difference]: Finished difference Result 111 states and 206 transitions. [2019-09-05 11:58:42,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:58:42,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-05 11:58:42,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:42,853 INFO L225 Difference]: With dead ends: 111 [2019-09-05 11:58:42,854 INFO L226 Difference]: Without dead ends: 63 [2019-09-05 11:58:42,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:58:42,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-05 11:58:42,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2019-09-05 11:58:42,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-05 11:58:42,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2019-09-05 11:58:42,917 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 16 [2019-09-05 11:58:42,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:42,918 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2019-09-05 11:58:42,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:58:42,918 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2019-09-05 11:58:42,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-05 11:58:42,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:42,920 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:58:42,921 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:42,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:42,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1256946511, now seen corresponding path program 1 times [2019-09-05 11:58:42,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:42,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:42,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:42,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:42,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:42,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:58:42,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:42,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 11:58:42,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:58:42,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:58:42,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:58:42,997 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand 6 states. [2019-09-05 11:58:43,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:43,188 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2019-09-05 11:58:43,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:58:43,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-09-05 11:58:43,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:43,194 INFO L225 Difference]: With dead ends: 62 [2019-09-05 11:58:43,195 INFO L226 Difference]: Without dead ends: 60 [2019-09-05 11:58:43,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:58:43,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-05 11:58:43,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-09-05 11:58:43,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-05 11:58:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 82 transitions. [2019-09-05 11:58:43,211 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 82 transitions. Word has length 21 [2019-09-05 11:58:43,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:43,212 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 82 transitions. [2019-09-05 11:58:43,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:58:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2019-09-05 11:58:43,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-05 11:58:43,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:43,214 INFO L399 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] [2019-09-05 11:58:43,215 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:43,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:43,215 INFO L82 PathProgramCache]: Analyzing trace with hash -2038837229, now seen corresponding path program 1 times [2019-09-05 11:58:43,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:43,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:43,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:43,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:43,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:43,281 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-05 11:58:43,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:43,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 11:58:43,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 11:58:43,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 11:58:43,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:58:43,283 INFO L87 Difference]: Start difference. First operand 60 states and 82 transitions. Second operand 3 states. [2019-09-05 11:58:43,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:43,340 INFO L93 Difference]: Finished difference Result 89 states and 122 transitions. [2019-09-05 11:58:43,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 11:58:43,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-09-05 11:58:43,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:43,346 INFO L225 Difference]: With dead ends: 89 [2019-09-05 11:58:43,346 INFO L226 Difference]: Without dead ends: 60 [2019-09-05 11:58:43,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:58:43,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-05 11:58:43,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-09-05 11:58:43,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-05 11:58:43,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2019-09-05 11:58:43,376 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 50 [2019-09-05 11:58:43,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:43,378 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2019-09-05 11:58:43,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 11:58:43,378 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2019-09-05 11:58:43,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-05 11:58:43,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:43,381 INFO L399 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] [2019-09-05 11:58:43,383 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:43,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:43,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1689114790, now seen corresponding path program 1 times [2019-09-05 11:58:43,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:43,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:43,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:43,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:43,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:43,508 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-05 11:58:43,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:43,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 11:58:43,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:58:43,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:58:43,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:58:43,510 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand 6 states. [2019-09-05 11:58:43,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:43,658 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2019-09-05 11:58:43,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:58:43,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-09-05 11:58:43,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:43,660 INFO L225 Difference]: With dead ends: 67 [2019-09-05 11:58:43,660 INFO L226 Difference]: Without dead ends: 65 [2019-09-05 11:58:43,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:58:43,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-05 11:58:43,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-09-05 11:58:43,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-05 11:58:43,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2019-09-05 11:58:43,678 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 51 [2019-09-05 11:58:43,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:43,679 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2019-09-05 11:58:43,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:58:43,681 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2019-09-05 11:58:43,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-05 11:58:43,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:43,685 INFO L399 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] [2019-09-05 11:58:43,685 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:43,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:43,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1728052911, now seen corresponding path program 1 times [2019-09-05 11:58:43,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:43,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:43,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:43,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:43,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:43,864 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-05 11:58:43,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:43,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-05 11:58:43,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 11:58:43,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 11:58:43,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:58:43,868 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand 7 states. [2019-09-05 11:58:43,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:43,984 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2019-09-05 11:58:43,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:58:43,984 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-09-05 11:58:43,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:43,988 INFO L225 Difference]: With dead ends: 83 [2019-09-05 11:58:43,988 INFO L226 Difference]: Without dead ends: 81 [2019-09-05 11:58:43,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:58:43,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-05 11:58:44,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2019-09-05 11:58:44,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-05 11:58:44,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 97 transitions. [2019-09-05 11:58:44,013 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 97 transitions. Word has length 86 [2019-09-05 11:58:44,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:44,014 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 97 transitions. [2019-09-05 11:58:44,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 11:58:44,015 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2019-09-05 11:58:44,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-05 11:58:44,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:44,023 INFO L399 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] [2019-09-05 11:58:44,024 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:44,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:44,024 INFO L82 PathProgramCache]: Analyzing trace with hash -733340726, now seen corresponding path program 1 times [2019-09-05 11:58:44,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:44,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:44,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:44,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:44,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:44,167 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-05 11:58:44,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:44,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 11:58:44,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:58:44,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:58:44,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:58:44,170 INFO L87 Difference]: Start difference. First operand 75 states and 97 transitions. Second operand 6 states. [2019-09-05 11:58:44,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:44,258 INFO L93 Difference]: Finished difference Result 81 states and 102 transitions. [2019-09-05 11:58:44,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:58:44,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-09-05 11:58:44,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:44,260 INFO L225 Difference]: With dead ends: 81 [2019-09-05 11:58:44,260 INFO L226 Difference]: Without dead ends: 79 [2019-09-05 11:58:44,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:58:44,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-05 11:58:44,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-09-05 11:58:44,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-05 11:58:44,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2019-09-05 11:58:44,273 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 91 [2019-09-05 11:58:44,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:44,274 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2019-09-05 11:58:44,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:58:44,274 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2019-09-05 11:58:44,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-05 11:58:44,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:44,276 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 18, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:58:44,277 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:44,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:44,277 INFO L82 PathProgramCache]: Analyzing trace with hash 259979376, now seen corresponding path program 1 times [2019-09-05 11:58:44,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:44,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:44,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:44,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:44,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 37 proven. 5 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-05 11:58:44,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:58:44,433 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:58:44,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:44,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 11:58:44,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:58:44,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:58:44,578 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-09-05 11:58:44,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-05 11:58:44,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2019-09-05 11:58:44,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 11:58:44,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 11:58:44,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:58:44,592 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand 9 states. [2019-09-05 11:58:44,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:44,697 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2019-09-05 11:58:44,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 11:58:44,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-05 11:58:44,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:44,698 INFO L225 Difference]: With dead ends: 82 [2019-09-05 11:58:44,698 INFO L226 Difference]: Without dead ends: 0 [2019-09-05 11:58:44,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:58:44,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-05 11:58:44,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-05 11:58:44,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-05 11:58:44,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-05 11:58:44,700 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2019-09-05 11:58:44,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:44,701 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-05 11:58:44,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 11:58:44,701 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-05 11:58:44,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-05 11:58:44,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-05 11:58:45,113 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-05 11:58:45,114 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-05 11:58:45,114 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-05 11:58:45,114 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-05 11:58:45,115 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-05 11:58:45,115 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-05 11:58:45,115 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 69) no Hoare annotation was computed. [2019-09-05 11:58:45,115 INFO L443 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-09-05 11:58:45,115 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-09-05 11:58:45,115 INFO L439 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 main_~scheme~0)) [2019-09-05 11:58:45,116 INFO L439 ceAbstractionStarter]: At program point L28-1(line 28) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 main_~scheme~0)) [2019-09-05 11:58:45,116 INFO L439 ceAbstractionStarter]: At program point L53(line 53) the Hoare annotation is: (let ((.cse5 (+ main_~cp~0 1))) (let ((.cse0 (<= 1 main_~cp~0)) (.cse1 (<= .cse5 main_~urilen~0)) (.cse2 (<= 0 main_~scheme~0)) (.cse3 (not (= .cse5 main_~urilen~0))) (.cse4 (<= (+ main_~c~0 2) main_~tokenlen~0))) (or (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (<= 1 main_~c~0) .cse4)))) [2019-09-05 11:58:45,116 INFO L443 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-09-05 11:58:45,116 INFO L439 ceAbstractionStarter]: At program point L53-1(line 53) the Hoare annotation is: (let ((.cse5 (+ main_~cp~0 1))) (let ((.cse0 (<= 1 main_~cp~0)) (.cse1 (<= .cse5 main_~urilen~0)) (.cse2 (<= 0 main_~scheme~0)) (.cse3 (not (= .cse5 main_~urilen~0))) (.cse4 (<= (+ main_~c~0 2) main_~tokenlen~0))) (or (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (<= 1 main_~c~0) .cse4)))) [2019-09-05 11:58:45,117 INFO L443 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2019-09-05 11:58:45,117 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-09-05 11:58:45,117 INFO L443 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2019-09-05 11:58:45,117 INFO L443 ceAbstractionStarter]: For program point L21-1(lines 11 69) no Hoare annotation was computed. [2019-09-05 11:58:45,119 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 69) no Hoare annotation was computed. [2019-09-05 11:58:45,119 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 66) no Hoare annotation was computed. [2019-09-05 11:58:45,119 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 69) the Hoare annotation is: true [2019-09-05 11:58:45,120 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 61) no Hoare annotation was computed. [2019-09-05 11:58:45,120 INFO L443 ceAbstractionStarter]: For program point L22(lines 11 69) no Hoare annotation was computed. [2019-09-05 11:58:45,120 INFO L443 ceAbstractionStarter]: For program point L55-1(lines 55 61) no Hoare annotation was computed. [2019-09-05 11:58:45,120 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 65) no Hoare annotation was computed. [2019-09-05 11:58:45,120 INFO L439 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 main_~scheme~0)) [2019-09-05 11:58:45,120 INFO L439 ceAbstractionStarter]: At program point L31(line 31) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 main_~scheme~0)) [2019-09-05 11:58:45,121 INFO L439 ceAbstractionStarter]: At program point L31-1(line 31) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 main_~scheme~0)) [2019-09-05 11:58:45,121 INFO L443 ceAbstractionStarter]: For program point L23(lines 11 69) no Hoare annotation was computed. [2019-09-05 11:58:45,121 INFO L443 ceAbstractionStarter]: For program point L40(lines 30 66) no Hoare annotation was computed. [2019-09-05 11:58:45,121 INFO L439 ceAbstractionStarter]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (+ main_~cp~0 1))) (and (<= 1 main_~cp~0) (<= .cse0 main_~urilen~0) (<= 0 main_~scheme~0) (not (= .cse0 main_~urilen~0)) (<= 1 main_~c~0) (< main_~c~0 main_~tokenlen~0))) [2019-09-05 11:58:45,121 INFO L439 ceAbstractionStarter]: At program point L57-1(line 57) the Hoare annotation is: (let ((.cse0 (+ main_~cp~0 1))) (and (<= 1 main_~cp~0) (<= .cse0 main_~urilen~0) (<= 0 main_~scheme~0) (<= 1 main_~c~0) (not (= .cse0 main_~urilen~0)) (< main_~c~0 main_~tokenlen~0))) [2019-09-05 11:58:45,122 INFO L439 ceAbstractionStarter]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (+ main_~cp~0 1))) (and (<= 1 main_~cp~0) (= main_~c~0 0) (<= .cse0 main_~urilen~0) (<= 0 main_~scheme~0) (not (= .cse0 main_~urilen~0)))) [2019-09-05 11:58:45,122 INFO L439 ceAbstractionStarter]: At program point L49-1(line 49) the Hoare annotation is: (let ((.cse0 (+ main_~cp~0 1))) (and (<= 1 main_~cp~0) (= main_~c~0 0) (<= .cse0 main_~urilen~0) (<= 0 main_~scheme~0) (not (= .cse0 main_~urilen~0)))) [2019-09-05 11:58:45,122 INFO L439 ceAbstractionStarter]: At program point L33-1(lines 32 38) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 main_~scheme~0)) [2019-09-05 11:58:45,124 INFO L439 ceAbstractionStarter]: At program point L33-2(lines 33 38) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 main_~scheme~0)) [2019-09-05 11:58:45,124 INFO L439 ceAbstractionStarter]: At program point L58(line 58) the Hoare annotation is: (let ((.cse0 (+ main_~cp~0 1))) (and (<= 1 main_~cp~0) (<= .cse0 main_~urilen~0) (<= 0 main_~scheme~0) (<= 1 main_~c~0) (not (= .cse0 main_~urilen~0)) (< main_~c~0 main_~tokenlen~0))) [2019-09-05 11:58:45,124 INFO L439 ceAbstractionStarter]: At program point L42(line 42) the Hoare annotation is: (let ((.cse0 (+ main_~cp~0 1))) (and (<= 1 main_~cp~0) (<= .cse0 main_~urilen~0) (<= 0 main_~scheme~0) (not (= .cse0 main_~urilen~0)))) [2019-09-05 11:58:45,124 INFO L439 ceAbstractionStarter]: At program point L42-1(line 42) the Hoare annotation is: (let ((.cse0 (+ main_~cp~0 1))) (and (<= 1 main_~cp~0) (<= .cse0 main_~urilen~0) (<= 0 main_~scheme~0) (not (= .cse0 main_~urilen~0)))) [2019-09-05 11:58:45,125 INFO L446 ceAbstractionStarter]: At program point L67(lines 11 69) the Hoare annotation is: true [2019-09-05 11:58:45,125 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-09-05 11:58:45,125 INFO L439 ceAbstractionStarter]: At program point L59(line 59) the Hoare annotation is: (let ((.cse0 (+ main_~cp~0 1))) (and (<= 1 main_~cp~0) (<= .cse0 main_~urilen~0) (<= 0 main_~scheme~0) (<= 1 main_~c~0) (not (= .cse0 main_~urilen~0)) (< main_~c~0 main_~tokenlen~0))) [2019-09-05 11:58:45,125 INFO L443 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2019-09-05 11:58:45,126 INFO L439 ceAbstractionStarter]: At program point L51-1(lines 50 63) the Hoare annotation is: (let ((.cse0 (<= 1 main_~cp~0)) (.cse1 (<= (+ main_~cp~0 1) main_~urilen~0)) (.cse2 (<= 0 main_~scheme~0))) (or (and .cse0 .cse1 .cse2 (<= 1 main_~c~0) (< main_~c~0 main_~tokenlen~0)) (and .cse0 (= main_~c~0 0) .cse1 .cse2))) [2019-09-05 11:58:45,126 INFO L443 ceAbstractionStarter]: For program point L43(lines 30 66) no Hoare annotation was computed. [2019-09-05 11:58:45,127 INFO L439 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (+ main_~cp~0 1))) (and (<= 1 main_~cp~0) (<= .cse0 main_~urilen~0) (<= 0 main_~scheme~0) (not (= .cse0 main_~urilen~0)))) [2019-09-05 11:58:45,127 INFO L439 ceAbstractionStarter]: At program point L35-1(line 35) the Hoare annotation is: (let ((.cse0 (+ main_~cp~0 1))) (and (<= 1 main_~cp~0) (<= .cse0 main_~urilen~0) (<= 0 main_~scheme~0) (not (= .cse0 main_~urilen~0)))) [2019-09-05 11:58:45,127 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-09-05 11:58:45,127 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-09-05 11:58:45,127 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-09-05 11:58:45,128 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-09-05 11:58:45,128 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-09-05 11:58:45,128 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-09-05 11:58:45,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 11:58:45 BoogieIcfgContainer [2019-09-05 11:58:45,152 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 11:58:45,156 INFO L168 Benchmark]: Toolchain (without parser) took 3704.75 ms. Allocated memory was 132.1 MB in the beginning and 263.2 MB in the end (delta: 131.1 MB). Free memory was 88.6 MB in the beginning and 120.7 MB in the end (delta: -32.1 MB). Peak memory consumption was 99.0 MB. Max. memory is 7.1 GB. [2019-09-05 11:58:45,158 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 132.1 MB. Free memory was 106.5 MB in the beginning and 106.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-05 11:58:45,161 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.24 ms. Allocated memory is still 132.1 MB. Free memory was 88.4 MB in the beginning and 78.0 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2019-09-05 11:58:45,162 INFO L168 Benchmark]: Boogie Preprocessor took 143.54 ms. Allocated memory was 132.1 MB in the beginning and 200.3 MB in the end (delta: 68.2 MB). Free memory was 78.0 MB in the beginning and 176.1 MB in the end (delta: -98.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2019-09-05 11:58:45,163 INFO L168 Benchmark]: RCFGBuilder took 392.78 ms. Allocated memory is still 200.3 MB. Free memory was 176.1 MB in the beginning and 158.5 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 7.1 GB. [2019-09-05 11:58:45,165 INFO L168 Benchmark]: TraceAbstraction took 2903.29 ms. Allocated memory was 200.3 MB in the beginning and 263.2 MB in the end (delta: 62.9 MB). Free memory was 157.9 MB in the beginning and 120.7 MB in the end (delta: 37.2 MB). Peak memory consumption was 100.2 MB. Max. memory is 7.1 GB. [2019-09-05 11:58:45,175 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47 ms. Allocated memory is still 132.1 MB. Free memory was 106.5 MB in the beginning and 106.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 261.24 ms. Allocated memory is still 132.1 MB. Free memory was 88.4 MB in the beginning and 78.0 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 143.54 ms. Allocated memory was 132.1 MB in the beginning and 200.3 MB in the end (delta: 68.2 MB). Free memory was 78.0 MB in the beginning and 176.1 MB in the end (delta: -98.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 392.78 ms. Allocated memory is still 200.3 MB. Free memory was 176.1 MB in the beginning and 158.5 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2903.29 ms. Allocated memory was 200.3 MB in the beginning and 263.2 MB in the end (delta: 62.9 MB). Free memory was 157.9 MB in the beginning and 120.7 MB in the end (delta: 37.2 MB). Peak memory consumption was 100.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 50]: Loop Invariant Derived loop invariant: ((((1 <= cp && cp + 1 <= urilen) && 0 <= scheme) && 1 <= c) && c < tokenlen) || (((1 <= cp && c == 0) && cp + 1 <= urilen) && 0 <= scheme) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (1 <= cp && cp + 1 <= urilen) && 0 <= scheme - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 53 locations, 1 error locations. SAFE Result, 2.8s OverallTime, 7 OverallIterations, 19 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 462 SDtfs, 113 SDslu, 1245 SDs, 0 SdLazy, 403 SolverSat, 98 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 131 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 77 PreInvPairs, 105 NumberOfFragments, 440 HoareAnnotationTreeSize, 77 FomulaSimplifications, 337 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 26 FomulaSimplificationsInter, 39 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 555 NumberOfCodeBlocks, 555 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 547 ConstructedInterpolants, 0 QuantifiedInterpolants, 67811 SizeOfPredicates, 2 NumberOfNonLiveVariables, 240 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 2075/2080 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...