java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 22:10:45,151 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 22:10:45,154 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 22:10:45,169 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 22:10:45,169 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 22:10:45,170 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 22:10:45,171 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 22:10:45,174 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 22:10:45,175 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 22:10:45,176 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 22:10:45,177 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 22:10:45,177 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 22:10:45,178 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 22:10:45,179 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 22:10:45,181 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 22:10:45,181 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 22:10:45,182 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 22:10:45,184 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 22:10:45,186 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 22:10:45,187 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 22:10:45,188 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 22:10:45,190 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 22:10:45,192 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 22:10:45,192 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 22:10:45,193 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 22:10:45,193 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 22:10:45,194 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 22:10:45,195 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 22:10:45,196 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 22:10:45,197 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 22:10:45,197 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 22:10:45,198 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 22:10:45,198 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 22:10:45,199 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 22:10:45,200 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 22:10:45,200 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 22:10:45,201 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 22:10:45,215 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 22:10:45,215 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 22:10:45,216 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 22:10:45,216 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 22:10:45,217 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 22:10:45,217 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 22:10:45,217 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 22:10:45,217 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 22:10:45,217 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 22:10:45,218 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 22:10:45,218 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 22:10:45,218 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 22:10:45,218 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 22:10:45,219 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 22:10:45,219 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 22:10:45,219 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 22:10:45,219 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 22:10:45,220 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 22:10:45,220 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 22:10:45,220 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 22:10:45,220 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 22:10:45,220 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 22:10:45,220 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 22:10:45,221 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 22:10:45,221 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 22:10:45,221 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:10:45,221 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 22:10:45,221 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 22:10:45,222 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 22:10:45,222 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 22:10:45,222 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 22:10:45,222 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 22:10:45,222 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 22:10:45,222 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 22:10:45,223 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 22:10:45,266 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 22:10:45,280 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 22:10:45,283 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 22:10:45,285 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 22:10:45,285 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 22:10:45,286 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call_true-termination.i [2018-11-07 22:10:45,343 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62624297b/75346cf767db4a13bcd9a3baf483623e/FLAG3e892d917 [2018-11-07 22:10:45,773 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 22:10:45,774 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call_true-termination.i [2018-11-07 22:10:45,784 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62624297b/75346cf767db4a13bcd9a3baf483623e/FLAG3e892d917 [2018-11-07 22:10:45,799 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62624297b/75346cf767db4a13bcd9a3baf483623e [2018-11-07 22:10:45,811 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 22:10:45,812 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 22:10:45,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 22:10:45,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 22:10:45,820 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 22:10:45,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:10:45" (1/1) ... [2018-11-07 22:10:45,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@94445cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:45, skipping insertion in model container [2018-11-07 22:10:45,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:10:45" (1/1) ... [2018-11-07 22:10:45,832 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 22:10:45,856 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 22:10:46,068 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:10:46,072 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 22:10:46,099 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:10:46,120 INFO L193 MainTranslator]: Completed translation [2018-11-07 22:10:46,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:46 WrapperNode [2018-11-07 22:10:46,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 22:10:46,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 22:10:46,122 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 22:10:46,122 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 22:10:46,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:46" (1/1) ... [2018-11-07 22:10:46,137 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:46" (1/1) ... [2018-11-07 22:10:46,143 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 22:10:46,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 22:10:46,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 22:10:46,144 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 22:10:46,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:46" (1/1) ... [2018-11-07 22:10:46,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:46" (1/1) ... [2018-11-07 22:10:46,155 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:46" (1/1) ... [2018-11-07 22:10:46,155 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:46" (1/1) ... [2018-11-07 22:10:46,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:46" (1/1) ... [2018-11-07 22:10:46,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:46" (1/1) ... [2018-11-07 22:10:46,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:46" (1/1) ... [2018-11-07 22:10:46,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 22:10:46,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 22:10:46,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 22:10:46,170 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 22:10:46,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:46" (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 [2018-11-07 22:10:46,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 22:10:46,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 22:10:46,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 22:10:46,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 22:10:46,300 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 22:10:46,300 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 22:10:46,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 22:10:46,300 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 22:10:46,804 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 22:10:46,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:10:46 BoogieIcfgContainer [2018-11-07 22:10:46,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 22:10:46,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 22:10:46,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 22:10:46,809 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 22:10:46,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:10:45" (1/3) ... [2018-11-07 22:10:46,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60148b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:10:46, skipping insertion in model container [2018-11-07 22:10:46,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:46" (2/3) ... [2018-11-07 22:10:46,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60148b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:10:46, skipping insertion in model container [2018-11-07 22:10:46,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:10:46" (3/3) ... [2018-11-07 22:10:46,813 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute_true-unreach-call_true-termination.i [2018-11-07 22:10:46,823 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 22:10:46,830 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 22:10:46,844 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 22:10:46,878 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 22:10:46,878 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 22:10:46,878 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 22:10:46,878 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 22:10:46,879 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 22:10:46,879 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 22:10:46,879 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 22:10:46,879 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 22:10:46,899 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-11-07 22:10:46,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 22:10:46,906 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:46,907 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:10:46,909 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:46,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:46,915 INFO L82 PathProgramCache]: Analyzing trace with hash 398758246, now seen corresponding path program 1 times [2018-11-07 22:10:46,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:46,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:46,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:46,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:46,959 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:47,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:47,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:10:47,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 22:10:47,124 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:10:47,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:10:47,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:10:47,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 22:10:47,143 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 5 states. [2018-11-07 22:10:47,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:47,663 INFO L93 Difference]: Finished difference Result 116 states and 211 transitions. [2018-11-07 22:10:47,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 22:10:47,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-07 22:10:47,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:47,676 INFO L225 Difference]: With dead ends: 116 [2018-11-07 22:10:47,676 INFO L226 Difference]: Without dead ends: 66 [2018-11-07 22:10:47,681 INFO L604 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 [2018-11-07 22:10:47,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-07 22:10:47,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 59. [2018-11-07 22:10:47,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-07 22:10:47,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-11-07 22:10:47,736 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-11-07 22:10:47,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:47,736 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-11-07 22:10:47,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:10:47,737 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-11-07 22:10:47,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 22:10:47,739 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:47,739 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:10:47,740 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:47,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:47,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1482520181, now seen corresponding path program 1 times [2018-11-07 22:10:47,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:47,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:47,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:47,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:47,743 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:48,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:48,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:48,056 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:10:48,057 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-11-07 22:10:48,059 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [19], [25], [31], [39], [122], [125], [127], [130], [132], [133], [134], [135], [137], [138], [139] [2018-11-07 22:10:48,089 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:10:48,090 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:10:48,239 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:10:48,241 INFO L272 AbstractInterpreter]: Visited 20 different actions 25 times. Never merged. Never widened. Never found a fixpoint. Largest state had 8 variables. [2018-11-07 22:10:48,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:48,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:10:48,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:48,252 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 [2018-11-07 22:10:48,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:48,270 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:10:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:48,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:10:48,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:48,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:10:48,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:48,599 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 22:10:48,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 9 [2018-11-07 22:10:48,599 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:10:48,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:10:48,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:10:48,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-07 22:10:48,601 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 6 states. [2018-11-07 22:10:49,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:49,246 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2018-11-07 22:10:49,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 22:10:49,247 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-07 22:10:49,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:49,251 INFO L225 Difference]: With dead ends: 65 [2018-11-07 22:10:49,251 INFO L226 Difference]: Without dead ends: 63 [2018-11-07 22:10:49,252 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-07 22:10:49,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-07 22:10:49,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-07 22:10:49,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-07 22:10:49,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 85 transitions. [2018-11-07 22:10:49,267 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 85 transitions. Word has length 21 [2018-11-07 22:10:49,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:49,268 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 85 transitions. [2018-11-07 22:10:49,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:10:49,268 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 85 transitions. [2018-11-07 22:10:49,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-07 22:10:49,270 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:49,270 INFO L375 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] [2018-11-07 22:10:49,271 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:49,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:49,271 INFO L82 PathProgramCache]: Analyzing trace with hash 693279400, now seen corresponding path program 1 times [2018-11-07 22:10:49,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:49,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:49,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:49,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:49,273 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:49,339 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 22:10:49,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:10:49,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 22:10:49,340 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:10:49,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 22:10:49,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 22:10:49,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:10:49,341 INFO L87 Difference]: Start difference. First operand 63 states and 85 transitions. Second operand 3 states. [2018-11-07 22:10:49,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:49,409 INFO L93 Difference]: Finished difference Result 93 states and 126 transitions. [2018-11-07 22:10:49,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 22:10:49,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-07 22:10:49,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:49,412 INFO L225 Difference]: With dead ends: 93 [2018-11-07 22:10:49,413 INFO L226 Difference]: Without dead ends: 63 [2018-11-07 22:10:49,413 INFO L604 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 [2018-11-07 22:10:49,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-07 22:10:49,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-07 22:10:49,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-07 22:10:49,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2018-11-07 22:10:49,428 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 51 [2018-11-07 22:10:49,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:49,428 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2018-11-07 22:10:49,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 22:10:49,429 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2018-11-07 22:10:49,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-07 22:10:49,431 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:49,431 INFO L375 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] [2018-11-07 22:10:49,431 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:49,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:49,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1023624178, now seen corresponding path program 1 times [2018-11-07 22:10:49,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:49,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:49,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:49,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:49,433 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:49,554 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 22:10:49,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:49,555 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:10:49,555 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-11-07 22:10:49,555 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [19], [25], [31], [39], [42], [45], [51], [57], [60], [75], [122], [125], [127], [130], [132], [133], [134], [135], [137], [138], [139], [140], [141], [142], [143], [144], [149], [150], [151], [152], [153] [2018-11-07 22:10:49,558 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:10:49,558 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:10:49,646 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:10:49,646 INFO L272 AbstractInterpreter]: Visited 36 different actions 66 times. Never merged. Never widened. Never found a fixpoint. Largest state had 10 variables. [2018-11-07 22:10:49,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:49,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:10:49,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:49,649 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:10:49,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:49,658 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:10:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:49,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:10:49,827 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 22:10:49,828 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:10:50,023 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 22:10:50,042 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 22:10:50,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 9 [2018-11-07 22:10:50,042 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:10:50,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:10:50,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:10:50,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-07 22:10:50,044 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand 6 states. [2018-11-07 22:10:50,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:50,270 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2018-11-07 22:10:50,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 22:10:50,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-11-07 22:10:50,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:50,273 INFO L225 Difference]: With dead ends: 71 [2018-11-07 22:10:50,273 INFO L226 Difference]: Without dead ends: 69 [2018-11-07 22:10:50,273 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 103 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 22:10:50,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-07 22:10:50,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-07 22:10:50,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-07 22:10:50,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2018-11-07 22:10:50,286 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 52 [2018-11-07 22:10:50,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:50,286 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2018-11-07 22:10:50,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:10:50,287 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2018-11-07 22:10:50,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-07 22:10:50,290 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:50,290 INFO L375 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] [2018-11-07 22:10:50,290 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:50,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:50,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1445669058, now seen corresponding path program 1 times [2018-11-07 22:10:50,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:50,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:50,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:50,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:50,294 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:50,419 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 23 proven. 34 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-07 22:10:50,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:50,419 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:10:50,419 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 89 with the following transitions: [2018-11-07 22:10:50,420 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [19], [25], [31], [39], [42], [45], [51], [57], [60], [75], [82], [85], [91], [97], [100], [103], [122], [125], [127], [130], [132], [133], [134], [135], [137], [138], [139], [140], [141], [142], [143], [144], [149], [150], [151], [152], [153], [154], [155], [156], [157], [158], [159], [160], [161], [162], [163], [164], [165] [2018-11-07 22:10:50,424 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:10:50,425 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:10:50,580 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:10:50,581 INFO L272 AbstractInterpreter]: Visited 54 different actions 114 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-11-07 22:10:50,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:50,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:10:50,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:50,611 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:10:50,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:50,625 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:10:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:50,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:10:50,820 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-07 22:10:50,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:10:50,900 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-07 22:10:50,921 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 22:10:50,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 9 [2018-11-07 22:10:50,922 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:10:50,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:10:50,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:10:50,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-07 22:10:50,924 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand 6 states. [2018-11-07 22:10:51,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:51,102 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2018-11-07 22:10:51,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 22:10:51,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2018-11-07 22:10:51,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:51,105 INFO L225 Difference]: With dead ends: 78 [2018-11-07 22:10:51,105 INFO L226 Difference]: Without dead ends: 76 [2018-11-07 22:10:51,105 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 173 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 22:10:51,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-07 22:10:51,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2018-11-07 22:10:51,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-07 22:10:51,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2018-11-07 22:10:51,117 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 88 [2018-11-07 22:10:51,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:51,118 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2018-11-07 22:10:51,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:10:51,119 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2018-11-07 22:10:51,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-07 22:10:51,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:51,121 INFO L375 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] [2018-11-07 22:10:51,121 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:51,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:51,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1059167203, now seen corresponding path program 1 times [2018-11-07 22:10:51,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:51,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:51,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:51,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:51,123 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:51,359 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 25 proven. 37 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-07 22:10:51,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:51,360 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:10:51,360 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 94 with the following transitions: [2018-11-07 22:10:51,360 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [19], [25], [31], [39], [42], [45], [51], [57], [60], [75], [82], [85], [91], [97], [100], [103], [122], [125], [127], [130], [132], [133], [134], [135], [137], [138], [139], [140], [141], [142], [143], [144], [149], [150], [151], [152], [153], [154], [155], [156], [157], [158], [159], [160], [161], [162], [163], [164], [165], [166], [167] [2018-11-07 22:10:51,363 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:10:51,364 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:10:51,480 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:10:51,480 INFO L272 AbstractInterpreter]: Visited 56 different actions 121 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-11-07 22:10:51,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:51,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:10:51,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:51,520 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:10:51,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:51,537 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:10:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:51,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:10:51,648 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 22:10:51,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:10:51,746 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 22:10:51,766 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 22:10:51,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 11 [2018-11-07 22:10:51,766 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:10:51,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:10:51,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:10:51,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-07 22:10:51,768 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand 6 states. [2018-11-07 22:10:51,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:51,913 INFO L93 Difference]: Finished difference Result 78 states and 99 transitions. [2018-11-07 22:10:51,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 22:10:51,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-11-07 22:10:51,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:51,915 INFO L225 Difference]: With dead ends: 78 [2018-11-07 22:10:51,915 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 22:10:51,917 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-07 22:10:51,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 22:10:51,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 22:10:51,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 22:10:51,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 22:10:51,918 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2018-11-07 22:10:51,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:51,919 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 22:10:51,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:10:51,919 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 22:10:51,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 22:10:51,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 22:10:52,575 WARN L179 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 22:10:52,580 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-07 22:10:52,580 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 22:10:52,580 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 22:10:52,580 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 22:10:52,581 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 22:10:52,581 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 22:10:52,581 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 69) no Hoare annotation was computed. [2018-11-07 22:10:52,581 INFO L425 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-07 22:10:52,581 INFO L425 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-11-07 22:10:52,581 INFO L421 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)) [2018-11-07 22:10:52,582 INFO L421 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)) [2018-11-07 22:10:52,582 INFO L421 ceAbstractionStarter]: At program point L53(line 53) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= 0 main_~c~0) (<= 0 main_~scheme~0) (<= (+ main_~cp~0 2) main_~urilen~0) (<= (+ main_~c~0 2) main_~tokenlen~0)) [2018-11-07 22:10:52,582 INFO L425 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-07 22:10:52,582 INFO L421 ceAbstractionStarter]: At program point L53-1(line 53) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= 0 main_~c~0) (<= 0 main_~scheme~0) (<= (+ main_~cp~0 2) main_~urilen~0) (<= (+ main_~c~0 2) main_~tokenlen~0)) [2018-11-07 22:10:52,582 INFO L425 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-11-07 22:10:52,582 INFO L425 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-11-07 22:10:52,582 INFO L425 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-11-07 22:10:52,583 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 11 69) no Hoare annotation was computed. [2018-11-07 22:10:52,583 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 69) no Hoare annotation was computed. [2018-11-07 22:10:52,583 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 66) no Hoare annotation was computed. [2018-11-07 22:10:52,583 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 69) the Hoare annotation is: true [2018-11-07 22:10:52,583 INFO L425 ceAbstractionStarter]: For program point L55(lines 55 61) no Hoare annotation was computed. [2018-11-07 22:10:52,583 INFO L425 ceAbstractionStarter]: For program point L22(lines 11 69) no Hoare annotation was computed. [2018-11-07 22:10:52,583 INFO L425 ceAbstractionStarter]: For program point L55-1(lines 55 61) no Hoare annotation was computed. [2018-11-07 22:10:52,584 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 65) no Hoare annotation was computed. [2018-11-07 22:10:52,584 INFO L421 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (let ((.cse0 (<= 1 main_~cp~0)) (.cse1 (<= 0 main_~scheme~0))) (or (and (= main_~urilen~0 (+ main_~cp~0 1)) .cse0 .cse1) (and .cse0 .cse1 (<= (+ main_~cp~0 2) main_~urilen~0)))) [2018-11-07 22:10:52,584 INFO L421 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)) [2018-11-07 22:10:52,584 INFO L421 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)) [2018-11-07 22:10:52,584 INFO L425 ceAbstractionStarter]: For program point L23(lines 11 69) no Hoare annotation was computed. [2018-11-07 22:10:52,585 INFO L425 ceAbstractionStarter]: For program point L40(lines 30 66) no Hoare annotation was computed. [2018-11-07 22:10:52,585 INFO L421 ceAbstractionStarter]: At program point L57(line 57) the Hoare annotation is: (and (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0) (<= 0 main_~scheme~0) (<= 1 main_~c~0) (<= (+ main_~cp~0 2) main_~urilen~0)) [2018-11-07 22:10:52,585 INFO L421 ceAbstractionStarter]: At program point L57-1(line 57) the Hoare annotation is: (and (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0) (<= 0 main_~scheme~0) (<= 1 main_~c~0) (<= (+ main_~cp~0 2) main_~urilen~0)) [2018-11-07 22:10:52,585 INFO L421 ceAbstractionStarter]: At program point L49(line 49) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= 0 main_~c~0) (<= 0 main_~scheme~0) (<= (+ main_~cp~0 2) main_~urilen~0)) [2018-11-07 22:10:52,586 INFO L421 ceAbstractionStarter]: At program point L49-1(line 49) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= 0 main_~c~0) (<= 0 main_~scheme~0) (<= (+ main_~cp~0 2) main_~urilen~0)) [2018-11-07 22:10:52,586 INFO L425 ceAbstractionStarter]: For program point L33(lines 33 38) no Hoare annotation was computed. [2018-11-07 22:10:52,586 INFO L421 ceAbstractionStarter]: At program point L33-2(lines 32 38) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 main_~scheme~0)) [2018-11-07 22:10:52,586 INFO L421 ceAbstractionStarter]: At program point L33-3(lines 33 38) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 main_~scheme~0)) [2018-11-07 22:10:52,586 INFO L421 ceAbstractionStarter]: At program point L58(line 58) the Hoare annotation is: (and (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0) (<= 0 main_~scheme~0) (<= 1 main_~c~0) (<= (+ main_~cp~0 2) main_~urilen~0)) [2018-11-07 22:10:52,587 INFO L421 ceAbstractionStarter]: At program point L42(line 42) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= 0 main_~scheme~0) (<= (+ main_~cp~0 2) main_~urilen~0)) [2018-11-07 22:10:52,587 INFO L421 ceAbstractionStarter]: At program point L42-1(line 42) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= 0 main_~scheme~0) (<= (+ main_~cp~0 2) main_~urilen~0)) [2018-11-07 22:10:52,587 INFO L428 ceAbstractionStarter]: At program point L67(lines 11 69) the Hoare annotation is: true [2018-11-07 22:10:52,587 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-07 22:10:52,587 INFO L421 ceAbstractionStarter]: At program point L59(line 59) the Hoare annotation is: (and (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0) (<= 0 main_~scheme~0) (<= 1 main_~c~0) (<= (+ main_~cp~0 2) main_~urilen~0)) [2018-11-07 22:10:52,587 INFO L425 ceAbstractionStarter]: For program point L51(lines 51 63) no Hoare annotation was computed. [2018-11-07 22:10:52,587 INFO L425 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-11-07 22:10:52,588 INFO L421 ceAbstractionStarter]: At program point L51-2(lines 50 63) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= 0 main_~c~0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 main_~scheme~0)) [2018-11-07 22:10:52,588 INFO L425 ceAbstractionStarter]: For program point L43(lines 30 66) no Hoare annotation was computed. [2018-11-07 22:10:52,588 INFO L421 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= 0 main_~scheme~0) (<= (+ main_~cp~0 2) main_~urilen~0)) [2018-11-07 22:10:52,588 INFO L421 ceAbstractionStarter]: At program point L35-1(line 35) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= 0 main_~scheme~0) (<= (+ main_~cp~0 2) main_~urilen~0)) [2018-11-07 22:10:52,588 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-07 22:10:52,588 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-07 22:10:52,589 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-07 22:10:52,589 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-07 22:10:52,589 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-07 22:10:52,589 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-07 22:10:52,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:10:52 BoogieIcfgContainer [2018-11-07 22:10:52,600 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 22:10:52,601 INFO L168 Benchmark]: Toolchain (without parser) took 6789.48 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 762.3 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -373.1 MB). Peak memory consumption was 389.3 MB. Max. memory is 7.1 GB. [2018-11-07 22:10:52,602 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:10:52,603 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.49 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 22:10:52,604 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.62 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:10:52,604 INFO L168 Benchmark]: Boogie Preprocessor took 26.47 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:10:52,605 INFO L168 Benchmark]: RCFGBuilder took 635.17 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 762.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -799.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-07 22:10:52,606 INFO L168 Benchmark]: TraceAbstraction took 5794.10 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 415.7 MB). Peak memory consumption was 415.7 MB. Max. memory is 7.1 GB. [2018-11-07 22:10:52,611 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 307.49 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 21.62 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.47 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 635.17 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 762.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -799.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5794.10 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 415.7 MB). Peak memory consumption was 415.7 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 && 0 <= c) && 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, 55 locations, 1 error locations. SAFE Result, 5.7s OverallTime, 6 OverallIterations, 14 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 404 SDtfs, 99 SDslu, 998 SDs, 0 SdLazy, 321 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 556 GetRequests, 504 SyntacticMatches, 12 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 76 PreInvPairs, 104 NumberOfFragments, 317 HoareAnnotationTreeSize, 76 FomulaSimplifications, 123 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 26 FomulaSimplificationsInter, 137 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 815 ConstructedInterpolants, 0 QuantifiedInterpolants, 86463 SizeOfPredicates, 14 NumberOfNonLiveVariables, 527 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 2077/2172 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...