java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 12:14:54,509 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 12:14:54,511 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 12:14:54,523 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 12:14:54,523 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 12:14:54,524 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 12:14:54,526 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 12:14:54,527 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 12:14:54,529 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 12:14:54,530 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 12:14:54,531 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 12:14:54,531 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 12:14:54,532 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 12:14:54,533 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 12:14:54,534 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 12:14:54,535 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 12:14:54,536 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 12:14:54,538 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 12:14:54,539 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 12:14:54,541 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 12:14:54,542 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 12:14:54,543 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 12:14:54,546 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 12:14:54,546 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 12:14:54,546 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 12:14:54,547 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 12:14:54,548 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 12:14:54,549 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 12:14:54,550 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 12:14:54,551 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 12:14:54,551 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 12:14:54,552 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 12:14:54,552 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 12:14:54,552 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 12:14:54,553 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 12:14:54,554 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 12:14:54,554 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-24 12:14:54,569 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 12:14:54,570 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 12:14:54,570 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 12:14:54,571 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 12:14:54,571 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 12:14:54,571 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 12:14:54,571 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 12:14:54,571 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 12:14:54,572 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 12:14:54,572 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 12:14:54,572 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 12:14:54,572 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 12:14:54,573 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 12:14:54,573 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 12:14:54,573 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 12:14:54,573 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 12:14:54,574 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 12:14:54,574 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 12:14:54,574 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 12:14:54,574 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 12:14:54,574 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 12:14:54,575 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 12:14:54,575 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 12:14:54,575 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 12:14:54,575 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:14:54,575 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 12:14:54,576 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 12:14:54,576 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 12:14:54,576 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 12:14:54,576 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 12:14:54,576 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 12:14:54,577 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 12:14:54,577 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 12:14:54,577 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 12:14:54,619 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 12:14:54,635 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 12:14:54,639 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 12:14:54,640 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 12:14:54,641 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 12:14:54,641 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call_true-termination.i [2018-10-24 12:14:54,698 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2af707a18/4aeed923489744c699aff224449d528b/FLAG05c3d3e99 [2018-10-24 12:14:55,100 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 12:14:55,101 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call_true-termination.i [2018-10-24 12:14:55,111 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2af707a18/4aeed923489744c699aff224449d528b/FLAG05c3d3e99 [2018-10-24 12:14:55,133 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2af707a18/4aeed923489744c699aff224449d528b [2018-10-24 12:14:55,146 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 12:14:55,148 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 12:14:55,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 12:14:55,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 12:14:55,157 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 12:14:55,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:14:55" (1/1) ... [2018-10-24 12:14:55,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f4693fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:14:55, skipping insertion in model container [2018-10-24 12:14:55,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:14:55" (1/1) ... [2018-10-24 12:14:55,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 12:14:55,209 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 12:14:55,433 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:14:55,437 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 12:14:55,464 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:14:55,479 INFO L193 MainTranslator]: Completed translation [2018-10-24 12:14:55,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:14:55 WrapperNode [2018-10-24 12:14:55,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 12:14:55,481 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 12:14:55,481 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 12:14:55,481 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 12:14:55,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:14:55" (1/1) ... [2018-10-24 12:14:55,499 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:14:55" (1/1) ... [2018-10-24 12:14:55,506 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 12:14:55,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 12:14:55,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 12:14:55,507 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 12:14:55,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:14:55" (1/1) ... [2018-10-24 12:14:55,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:14:55" (1/1) ... [2018-10-24 12:14:55,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:14:55" (1/1) ... [2018-10-24 12:14:55,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:14:55" (1/1) ... [2018-10-24 12:14:55,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:14:55" (1/1) ... [2018-10-24 12:14:55,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:14:55" (1/1) ... [2018-10-24 12:14:55,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:14:55" (1/1) ... [2018-10-24 12:14:55,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 12:14:55,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 12:14:55,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 12:14:55,537 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 12:14:55,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:14:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 12:14:55,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 12:14:55,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 12:14:55,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 12:14:55,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 12:14:55,673 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 12:14:55,673 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 12:14:55,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-24 12:14:55,674 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-24 12:14:56,210 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 12:14:56,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:14:56 BoogieIcfgContainer [2018-10-24 12:14:56,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 12:14:56,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 12:14:56,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 12:14:56,216 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 12:14:56,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:14:55" (1/3) ... [2018-10-24 12:14:56,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8b8aca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:14:56, skipping insertion in model container [2018-10-24 12:14:56,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:14:55" (2/3) ... [2018-10-24 12:14:56,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8b8aca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:14:56, skipping insertion in model container [2018-10-24 12:14:56,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:14:56" (3/3) ... [2018-10-24 12:14:56,220 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute_true-unreach-call_true-termination.i [2018-10-24 12:14:56,229 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 12:14:56,237 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 12:14:56,251 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 12:14:56,285 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 12:14:56,285 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 12:14:56,285 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 12:14:56,285 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 12:14:56,285 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 12:14:56,286 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 12:14:56,286 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 12:14:56,286 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 12:14:56,305 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-10-24 12:14:56,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-24 12:14:56,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:14:56,313 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:14:56,317 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:14:56,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:14:56,324 INFO L82 PathProgramCache]: Analyzing trace with hash 398758246, now seen corresponding path program 1 times [2018-10-24 12:14:56,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:14:56,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:14:56,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:14:56,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:14:56,376 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:14:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:14:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:14:56,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:14:56,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 12:14:56,552 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:14:56,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 12:14:56,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 12:14:56,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 12:14:56,571 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 5 states. [2018-10-24 12:14:57,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:14:57,112 INFO L93 Difference]: Finished difference Result 116 states and 211 transitions. [2018-10-24 12:14:57,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 12:14:57,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-10-24 12:14:57,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:14:57,125 INFO L225 Difference]: With dead ends: 116 [2018-10-24 12:14:57,125 INFO L226 Difference]: Without dead ends: 66 [2018-10-24 12:14:57,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 12:14:57,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-24 12:14:57,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 59. [2018-10-24 12:14:57,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-24 12:14:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-10-24 12:14:57,192 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-10-24 12:14:57,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:14:57,193 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-10-24 12:14:57,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 12:14:57,193 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-10-24 12:14:57,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-24 12:14:57,195 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:14:57,195 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-10-24 12:14:57,196 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:14:57,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:14:57,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1482520181, now seen corresponding path program 1 times [2018-10-24 12:14:57,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:14:57,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:14:57,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:14:57,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:14:57,198 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:14:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:14:57,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:14:57,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:14:57,354 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:14:57,355 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-10-24 12:14:57,356 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [19], [25], [31], [39], [122], [125], [127], [130], [132], [133], [134], [135], [137], [138], [139] [2018-10-24 12:14:57,409 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:14:57,409 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:14:57,640 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 12:14:57,643 INFO L272 AbstractInterpreter]: Visited 19 different actions 23 times. Never merged. Never widened. Never found a fixpoint. Largest state had 8 variables. [2018-10-24 12:14:57,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:14:57,688 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 12:14:57,837 INFO L232 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 61.46% of their original sizes. [2018-10-24 12:14:57,837 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 12:14:58,417 INFO L413 sIntCurrentIteration]: We have 20 unified AI predicates [2018-10-24 12:14:58,418 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 12:14:58,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:14:58,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 18 [2018-10-24 12:14:58,420 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:14:58,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 12:14:58,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 12:14:58,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-10-24 12:14:58,423 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 13 states. [2018-10-24 12:15:00,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:15:00,444 INFO L93 Difference]: Finished difference Result 91 states and 126 transitions. [2018-10-24 12:15:00,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 12:15:00,445 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-10-24 12:15:00,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:15:00,452 INFO L225 Difference]: With dead ends: 91 [2018-10-24 12:15:00,452 INFO L226 Difference]: Without dead ends: 89 [2018-10-24 12:15:00,456 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-10-24 12:15:00,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-24 12:15:00,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 73. [2018-10-24 12:15:00,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-24 12:15:00,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 99 transitions. [2018-10-24 12:15:00,493 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 99 transitions. Word has length 21 [2018-10-24 12:15:00,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:15:00,494 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 99 transitions. [2018-10-24 12:15:00,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 12:15:00,494 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 99 transitions. [2018-10-24 12:15:00,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-24 12:15:00,497 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:15:00,497 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-10-24 12:15:00,498 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:15:00,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:00,498 INFO L82 PathProgramCache]: Analyzing trace with hash 693279400, now seen corresponding path program 1 times [2018-10-24 12:15:00,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:15:00,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:00,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:15:00,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:00,500 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:15:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:15:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-24 12:15:00,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:15:00,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 12:15:00,591 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:15:00,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 12:15:00,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 12:15:00,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 12:15:00,592 INFO L87 Difference]: Start difference. First operand 73 states and 99 transitions. Second operand 3 states. [2018-10-24 12:15:00,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:15:00,711 INFO L93 Difference]: Finished difference Result 107 states and 147 transitions. [2018-10-24 12:15:00,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 12:15:00,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-10-24 12:15:00,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:15:00,716 INFO L225 Difference]: With dead ends: 107 [2018-10-24 12:15:00,716 INFO L226 Difference]: Without dead ends: 74 [2018-10-24 12:15:00,717 INFO L605 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-10-24 12:15:00,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-24 12:15:00,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-10-24 12:15:00,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-24 12:15:00,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 99 transitions. [2018-10-24 12:15:00,751 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 99 transitions. Word has length 51 [2018-10-24 12:15:00,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:15:00,751 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 99 transitions. [2018-10-24 12:15:00,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 12:15:00,752 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 99 transitions. [2018-10-24 12:15:00,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-24 12:15:00,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:15:00,754 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-10-24 12:15:00,754 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:15:00,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:00,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1023624178, now seen corresponding path program 1 times [2018-10-24 12:15:00,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:15:00,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:00,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:15:00,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:00,759 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:15:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:15:00,879 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-24 12:15:00,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:15:00,879 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:15:00,880 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-10-24 12:15:00,880 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-10-24 12:15:00,882 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:15:00,887 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:15:00,961 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 12:15:00,961 INFO L272 AbstractInterpreter]: Visited 35 different actions 59 times. Never merged. Never widened. Never found a fixpoint. Largest state had 10 variables. [2018-10-24 12:15:00,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:00,970 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 12:15:01,046 INFO L232 lantSequenceWeakener]: Weakened 34 states. On average, predicates are now at 66.08% of their original sizes. [2018-10-24 12:15:01,047 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 12:15:01,719 INFO L413 sIntCurrentIteration]: We have 51 unified AI predicates [2018-10-24 12:15:01,719 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 12:15:01,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:15:01,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [7] total 20 [2018-10-24 12:15:01,720 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:15:01,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-24 12:15:01,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-24 12:15:01,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-10-24 12:15:01,721 INFO L87 Difference]: Start difference. First operand 74 states and 99 transitions. Second operand 15 states. [2018-10-24 12:15:03,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:15:03,631 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2018-10-24 12:15:03,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-24 12:15:03,631 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-10-24 12:15:03,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:15:03,633 INFO L225 Difference]: With dead ends: 82 [2018-10-24 12:15:03,634 INFO L226 Difference]: Without dead ends: 74 [2018-10-24 12:15:03,635 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2018-10-24 12:15:03,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-24 12:15:03,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-10-24 12:15:03,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-24 12:15:03,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2018-10-24 12:15:03,656 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 52 [2018-10-24 12:15:03,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:15:03,657 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2018-10-24 12:15:03,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-24 12:15:03,657 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2018-10-24 12:15:03,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-24 12:15:03,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:15:03,660 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-10-24 12:15:03,660 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:15:03,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:03,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1445669058, now seen corresponding path program 1 times [2018-10-24 12:15:03,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:15:03,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:03,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:15:03,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:03,663 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:15:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:15:03,921 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 23 proven. 34 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-10-24 12:15:03,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:15:03,922 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:15:03,922 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 89 with the following transitions: [2018-10-24 12:15:03,923 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-10-24 12:15:03,926 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:15:03,926 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:15:03,971 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 12:15:03,971 INFO L272 AbstractInterpreter]: Visited 53 different actions 101 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-10-24 12:15:03,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:03,980 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 12:15:04,116 INFO L232 lantSequenceWeakener]: Weakened 62 states. On average, predicates are now at 60.4% of their original sizes. [2018-10-24 12:15:04,116 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 12:15:04,850 INFO L413 sIntCurrentIteration]: We have 87 unified AI predicates [2018-10-24 12:15:04,850 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 12:15:04,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:15:04,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [7] total 27 [2018-10-24 12:15:04,851 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:15:04,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-24 12:15:04,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-24 12:15:04,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2018-10-24 12:15:04,854 INFO L87 Difference]: Start difference. First operand 72 states and 95 transitions. Second operand 22 states. [2018-10-24 12:15:12,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:15:12,714 INFO L93 Difference]: Finished difference Result 103 states and 138 transitions. [2018-10-24 12:15:12,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-24 12:15:12,714 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 88 [2018-10-24 12:15:12,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:15:12,717 INFO L225 Difference]: With dead ends: 103 [2018-10-24 12:15:12,717 INFO L226 Difference]: Without dead ends: 101 [2018-10-24 12:15:12,718 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=271, Invalid=989, Unknown=0, NotChecked=0, Total=1260 [2018-10-24 12:15:12,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-24 12:15:12,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 85. [2018-10-24 12:15:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-24 12:15:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 112 transitions. [2018-10-24 12:15:12,756 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 112 transitions. Word has length 88 [2018-10-24 12:15:12,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:15:12,756 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 112 transitions. [2018-10-24 12:15:12,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-24 12:15:12,757 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 112 transitions. [2018-10-24 12:15:12,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-24 12:15:12,763 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:15:12,765 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 2, 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, 1] [2018-10-24 12:15:12,766 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:15:12,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:12,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1187961660, now seen corresponding path program 1 times [2018-10-24 12:15:12,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:15:12,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:12,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:15:12,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:12,771 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:15:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:15:13,324 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 40 proven. 52 refuted. 0 times theorem prover too weak. 563 trivial. 0 not checked. [2018-10-24 12:15:13,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:15:13,325 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:15:13,325 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 124 with the following transitions: [2018-10-24 12:15:13,327 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [19], [25], [31], [39], [42], [45], [51], [57], [60], [75], [82], [85], [91], [97], [100], [103], [111], [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], [168], [169], [170], [171], [172] [2018-10-24 12:15:13,331 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:15:13,332 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:15:13,530 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 12:15:13,531 INFO L272 AbstractInterpreter]: Visited 61 different actions 367 times. Merged at 11 different actions 66 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 15 variables. [2018-10-24 12:15:13,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:13,569 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 12:15:13,699 INFO L232 lantSequenceWeakener]: Weakened 91 states. On average, predicates are now at 60.02% of their original sizes. [2018-10-24 12:15:13,700 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 12:15:14,685 INFO L413 sIntCurrentIteration]: We have 122 unified AI predicates [2018-10-24 12:15:14,686 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 12:15:14,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:15:14,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [7] total 30 [2018-10-24 12:15:14,687 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:15:14,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-24 12:15:14,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-24 12:15:14,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2018-10-24 12:15:14,689 INFO L87 Difference]: Start difference. First operand 85 states and 112 transitions. Second operand 25 states. [2018-10-24 12:15:23,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:15:23,541 INFO L93 Difference]: Finished difference Result 123 states and 166 transitions. [2018-10-24 12:15:23,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-24 12:15:23,541 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 123 [2018-10-24 12:15:23,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:15:23,543 INFO L225 Difference]: With dead ends: 123 [2018-10-24 12:15:23,543 INFO L226 Difference]: Without dead ends: 101 [2018-10-24 12:15:23,545 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 142 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=397, Invalid=1495, Unknown=0, NotChecked=0, Total=1892 [2018-10-24 12:15:23,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-24 12:15:23,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2018-10-24 12:15:23,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-24 12:15:23,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 120 transitions. [2018-10-24 12:15:23,567 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 120 transitions. Word has length 123 [2018-10-24 12:15:23,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:15:23,567 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 120 transitions. [2018-10-24 12:15:23,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-24 12:15:23,567 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2018-10-24 12:15:23,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-24 12:15:23,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:15:23,571 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2018-10-24 12:15:23,571 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:15:23,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:23,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1694343236, now seen corresponding path program 1 times [2018-10-24 12:15:23,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:15:23,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:23,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:15:23,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:23,572 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:15:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:15:23,680 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 48 proven. 58 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2018-10-24 12:15:23,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:15:23,681 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:15:23,681 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 139 with the following transitions: [2018-10-24 12:15:23,681 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [19], [25], [31], [39], [42], [45], [51], [57], [60], [75], [82], [85], [91], [97], [100], [103], [109], [111], [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], [168], [169], [170], [171], [172] [2018-10-24 12:15:23,684 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:15:23,684 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:15:23,877 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 12:15:23,877 INFO L272 AbstractInterpreter]: Visited 62 different actions 507 times. Merged at 12 different actions 106 times. Widened at 1 different actions 5 times. Found 11 fixpoints after 2 different actions. Largest state had 15 variables. [2018-10-24 12:15:23,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:23,880 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 12:15:24,018 INFO L232 lantSequenceWeakener]: Weakened 104 states. On average, predicates are now at 58.64% of their original sizes. [2018-10-24 12:15:24,019 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 12:15:24,876 INFO L413 sIntCurrentIteration]: We have 137 unified AI predicates [2018-10-24 12:15:24,877 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 12:15:24,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:15:24,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [7] total 31 [2018-10-24 12:15:24,877 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:15:24,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-24 12:15:24,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-24 12:15:24,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2018-10-24 12:15:24,880 INFO L87 Difference]: Start difference. First operand 91 states and 120 transitions. Second operand 26 states. [2018-10-24 12:15:29,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:15:29,544 INFO L93 Difference]: Finished difference Result 95 states and 124 transitions. [2018-10-24 12:15:29,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-24 12:15:29,544 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 138 [2018-10-24 12:15:29,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:15:29,545 INFO L225 Difference]: With dead ends: 95 [2018-10-24 12:15:29,545 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 12:15:29,547 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 155 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=384, Invalid=1422, Unknown=0, NotChecked=0, Total=1806 [2018-10-24 12:15:29,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 12:15:29,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 12:15:29,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 12:15:29,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 12:15:29,547 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2018-10-24 12:15:29,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:15:29,548 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 12:15:29,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-24 12:15:29,548 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 12:15:29,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 12:15:29,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 12:15:29,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:15:29,681 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 126 [2018-10-24 12:15:29,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:15:30,027 WARN L179 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 170 [2018-10-24 12:15:30,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:15:30,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:15:30,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:15:30,265 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 161 [2018-10-24 12:15:30,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:15:30,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:15:30,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:15:30,464 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 161 [2018-10-24 12:15:30,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:15:31,941 WARN L179 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 125 DAG size of output: 24 [2018-10-24 12:15:32,208 WARN L179 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 24 [2018-10-24 12:15:32,387 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 24 [2018-10-24 12:15:33,535 WARN L179 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 170 DAG size of output: 53 [2018-10-24 12:15:34,350 WARN L179 SmtUtils]: Spent 813.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 21 [2018-10-24 12:15:35,033 WARN L179 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 32 [2018-10-24 12:15:35,742 WARN L179 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 34 [2018-10-24 12:15:36,634 WARN L179 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 34 [2018-10-24 12:15:36,898 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 24 [2018-10-24 12:15:37,164 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 24 [2018-10-24 12:15:37,423 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 24 [2018-10-24 12:15:37,756 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 32 [2018-10-24 12:15:37,763 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-24 12:15:37,763 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-24 12:15:37,763 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 12:15:37,763 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-24 12:15:37,764 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-24 12:15:37,764 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 12:15:37,764 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 69) no Hoare annotation was computed. [2018-10-24 12:15:37,764 INFO L425 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-10-24 12:15:37,764 INFO L425 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-10-24 12:15:37,765 INFO L421 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (* 2 main_~tokenlen~0)) (.cse1 (* 2 main_~scheme~0))) (and (<= (* 2 main_~urilen~0) 2000000) (<= .cse0 2000000) (<= 2 (* 2 main_~cp~0)) (<= 2 .cse0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 .cse1) (<= .cse1 2000000))) [2018-10-24 12:15:37,765 INFO L421 ceAbstractionStarter]: At program point L28-1(line 28) the Hoare annotation is: (let ((.cse0 (* 2 main_~tokenlen~0)) (.cse1 (* 2 main_~scheme~0))) (and (<= (* 2 main_~urilen~0) 2000000) (<= .cse0 2000000) (<= 2 (* 2 main_~cp~0)) (<= 2 .cse0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 .cse1) (<= .cse1 2000000))) [2018-10-24 12:15:37,765 INFO L421 ceAbstractionStarter]: At program point L53(line 53) the Hoare annotation is: (let ((.cse6 (* 2 main_~scheme~0))) (let ((.cse4 (<= 0 .cse6)) (.cse0 (<= (* 2 main_~urilen~0) 2000000)) (.cse1 (<= (+ main_~cp~0 2) main_~urilen~0)) (.cse2 (<= .cse6 2000000))) (or (let ((.cse3 (+ main_~c~0 2))) (and .cse0 .cse1 .cse2 (<= .cse3 main_~cp~0) (<= .cse3 main_~tokenlen~0) (<= (* 2 main_~tokenlen~0) 2000000) .cse4 (<= 2 (* 2 main_~c~0)))) (let ((.cse5 (+ main_~tokenlen~0 main_~c~0))) (and .cse4 (<= 4 (* 2 main_~cp~0)) (and .cse0 (<= .cse5 1000000) .cse1 (= main_~c~0 0) .cse2) (<= 2 .cse5)))))) [2018-10-24 12:15:37,766 INFO L425 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-10-24 12:15:37,766 INFO L421 ceAbstractionStarter]: At program point L53-1(line 53) the Hoare annotation is: (let ((.cse6 (* 2 main_~scheme~0))) (let ((.cse4 (<= 0 .cse6)) (.cse0 (<= (* 2 main_~urilen~0) 2000000)) (.cse1 (<= (+ main_~cp~0 2) main_~urilen~0)) (.cse2 (<= .cse6 2000000))) (or (let ((.cse3 (+ main_~c~0 2))) (and .cse0 .cse1 .cse2 (<= .cse3 main_~cp~0) (<= .cse3 main_~tokenlen~0) (<= (* 2 main_~tokenlen~0) 2000000) .cse4 (<= 2 (* 2 main_~c~0)))) (let ((.cse5 (+ main_~tokenlen~0 main_~c~0))) (and .cse4 (<= 4 (* 2 main_~cp~0)) (and .cse0 (<= .cse5 1000000) .cse1 (= main_~c~0 0) .cse2) (<= 2 .cse5)))))) [2018-10-24 12:15:37,766 INFO L425 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-10-24 12:15:37,766 INFO L425 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-10-24 12:15:37,766 INFO L425 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-10-24 12:15:37,767 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 11 69) no Hoare annotation was computed. [2018-10-24 12:15:37,767 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 69) no Hoare annotation was computed. [2018-10-24 12:15:37,767 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 66) no Hoare annotation was computed. [2018-10-24 12:15:37,767 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 69) the Hoare annotation is: true [2018-10-24 12:15:37,767 INFO L425 ceAbstractionStarter]: For program point L55(lines 55 61) no Hoare annotation was computed. [2018-10-24 12:15:37,767 INFO L425 ceAbstractionStarter]: For program point L22(lines 11 69) no Hoare annotation was computed. [2018-10-24 12:15:37,767 INFO L425 ceAbstractionStarter]: For program point L55-1(lines 55 61) no Hoare annotation was computed. [2018-10-24 12:15:37,767 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 65) no Hoare annotation was computed. [2018-10-24 12:15:37,768 INFO L421 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (let ((.cse5 (* 2 main_~scheme~0)) (.cse3 (* 2 main_~tokenlen~0))) (let ((.cse0 (* 2 main_~cp~0)) (.cse1 (<= .cse3 2000000)) (.cse2 (<= 0 .cse5)) (.cse4 (<= .cse5 2000000))) (or (and (= main_~urilen~0 (+ main_~cp~0 1)) (<= .cse0 1999998) .cse1 .cse2 (<= 0 (+ .cse3 2000000)) (<= 3 (+ main_~urilen~0 main_~cp~0)) .cse4) (and (<= (* 2 main_~urilen~0) 2000000) (<= 2 .cse0) (<= (+ main_~cp~0 2) main_~urilen~0) .cse1 .cse2 (<= 2 .cse3) .cse4)))) [2018-10-24 12:15:37,768 INFO L421 ceAbstractionStarter]: At program point L31(line 31) the Hoare annotation is: (let ((.cse0 (* 2 main_~tokenlen~0)) (.cse1 (* 2 main_~scheme~0))) (and (<= (* 2 main_~urilen~0) 2000000) (<= .cse0 2000000) (<= 2 (* 2 main_~cp~0)) (<= 2 .cse0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 .cse1) (<= .cse1 2000000))) [2018-10-24 12:15:37,768 INFO L421 ceAbstractionStarter]: At program point L31-1(line 31) the Hoare annotation is: (let ((.cse0 (* 2 main_~tokenlen~0)) (.cse1 (* 2 main_~scheme~0))) (and (<= (* 2 main_~urilen~0) 2000000) (<= .cse0 2000000) (<= 2 (* 2 main_~cp~0)) (<= 2 .cse0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 .cse1) (<= .cse1 2000000))) [2018-10-24 12:15:37,769 INFO L425 ceAbstractionStarter]: For program point L23(lines 11 69) no Hoare annotation was computed. [2018-10-24 12:15:37,769 INFO L425 ceAbstractionStarter]: For program point L40(lines 30 66) no Hoare annotation was computed. [2018-10-24 12:15:37,769 INFO L421 ceAbstractionStarter]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (+ main_~c~0 1)) (.cse1 (* 2 main_~scheme~0))) (and (<= .cse0 main_~tokenlen~0) (<= .cse0 main_~cp~0) (<= (* 2 main_~urilen~0) 2000000) (<= (* 2 main_~tokenlen~0) 2000000) (<= .cse1 2000000) (<= 0 .cse1) (<= (+ main_~cp~0 2) main_~urilen~0) (<= 2 (* 2 main_~c~0)))) [2018-10-24 12:15:37,769 INFO L421 ceAbstractionStarter]: At program point L57-1(line 57) the Hoare annotation is: (let ((.cse0 (+ main_~c~0 1)) (.cse1 (* 2 main_~scheme~0))) (and (<= .cse0 main_~tokenlen~0) (<= .cse0 main_~cp~0) (<= (* 2 main_~urilen~0) 2000000) (<= (* 2 main_~tokenlen~0) 2000000) (<= .cse1 2000000) (<= 0 .cse1) (<= (+ main_~cp~0 2) main_~urilen~0) (<= 2 (* 2 main_~c~0)))) [2018-10-24 12:15:37,770 INFO L421 ceAbstractionStarter]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (* 2 main_~scheme~0))) (and (<= main_~tokenlen~0 (+ main_~c~0 1000000)) (= main_~c~0 0) (<= 2 (* 2 main_~tokenlen~0)) (<= .cse0 2000000) (<= 0 .cse0) (<= (+ main_~cp~0 2) main_~urilen~0) (<= 2 (+ main_~c~0 main_~cp~0)) (<= (+ main_~c~0 main_~urilen~0) 1000000))) [2018-10-24 12:15:37,770 INFO L421 ceAbstractionStarter]: At program point L49-1(line 49) the Hoare annotation is: (let ((.cse0 (* 2 main_~scheme~0))) (and (<= main_~tokenlen~0 (+ main_~c~0 1000000)) (= main_~c~0 0) (<= 2 (* 2 main_~tokenlen~0)) (<= .cse0 2000000) (<= 0 .cse0) (<= (+ main_~cp~0 2) main_~urilen~0) (<= 2 (+ main_~c~0 main_~cp~0)) (<= (+ main_~c~0 main_~urilen~0) 1000000))) [2018-10-24 12:15:37,770 INFO L425 ceAbstractionStarter]: For program point L33(lines 33 38) no Hoare annotation was computed. [2018-10-24 12:15:37,770 INFO L421 ceAbstractionStarter]: At program point L33-2(lines 32 38) the Hoare annotation is: (let ((.cse0 (* 2 main_~tokenlen~0)) (.cse1 (* 2 main_~scheme~0))) (and (<= (* 2 main_~urilen~0) 2000000) (<= .cse0 2000000) (<= 2 (* 2 main_~cp~0)) (<= 2 .cse0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 .cse1) (<= .cse1 2000000))) [2018-10-24 12:15:37,771 INFO L421 ceAbstractionStarter]: At program point L33-3(lines 33 38) the Hoare annotation is: (let ((.cse5 (* 2 main_~scheme~0)) (.cse3 (* 2 main_~tokenlen~0))) (let ((.cse0 (* 2 main_~cp~0)) (.cse1 (<= .cse3 2000000)) (.cse2 (<= 0 .cse5)) (.cse4 (<= .cse5 2000000))) (or (and (= main_~urilen~0 (+ main_~cp~0 1)) (<= .cse0 1999998) .cse1 .cse2 (<= 0 (+ .cse3 2000000)) (<= 3 (+ main_~urilen~0 main_~cp~0)) .cse4) (and (<= (* 2 main_~urilen~0) 2000000) (<= 2 .cse0) (<= (+ main_~cp~0 2) main_~urilen~0) .cse1 .cse2 (<= 2 .cse3) .cse4)))) [2018-10-24 12:15:37,771 INFO L421 ceAbstractionStarter]: At program point L58(line 58) the Hoare annotation is: (let ((.cse0 (+ main_~c~0 1)) (.cse1 (* 2 main_~scheme~0))) (and (<= .cse0 main_~tokenlen~0) (<= .cse0 main_~cp~0) (<= (* 2 main_~urilen~0) 2000000) (<= (* 2 main_~tokenlen~0) 2000000) (<= .cse1 2000000) (<= 0 .cse1) (<= (+ main_~cp~0 2) main_~urilen~0) (<= 2 (* 2 main_~c~0)))) [2018-10-24 12:15:37,771 INFO L421 ceAbstractionStarter]: At program point L42(line 42) the Hoare annotation is: (let ((.cse0 (* 2 main_~tokenlen~0)) (.cse1 (* 2 main_~scheme~0))) (and (<= (* 2 main_~urilen~0) 2000000) (<= .cse0 2000000) (<= 2 (* 2 main_~cp~0)) (<= 2 .cse0) (<= 0 .cse1) (<= .cse1 2000000) (<= (+ main_~cp~0 2) main_~urilen~0))) [2018-10-24 12:15:37,771 INFO L421 ceAbstractionStarter]: At program point L42-1(line 42) the Hoare annotation is: (let ((.cse0 (* 2 main_~tokenlen~0)) (.cse1 (* 2 main_~scheme~0))) (and (<= (* 2 main_~urilen~0) 2000000) (<= .cse0 2000000) (<= 2 (* 2 main_~cp~0)) (<= 2 .cse0) (<= 0 .cse1) (<= .cse1 2000000) (<= (+ main_~cp~0 2) main_~urilen~0))) [2018-10-24 12:15:37,772 INFO L428 ceAbstractionStarter]: At program point L67(lines 11 69) the Hoare annotation is: true [2018-10-24 12:15:37,772 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-10-24 12:15:37,772 INFO L421 ceAbstractionStarter]: At program point L59(line 59) the Hoare annotation is: (let ((.cse0 (+ main_~c~0 1)) (.cse1 (* 2 main_~scheme~0))) (and (<= .cse0 main_~tokenlen~0) (<= .cse0 main_~cp~0) (<= (* 2 main_~urilen~0) 2000000) (<= (* 2 main_~tokenlen~0) 2000000) (<= .cse1 2000000) (<= 0 .cse1) (<= (+ main_~cp~0 2) main_~urilen~0) (<= 2 (* 2 main_~c~0)))) [2018-10-24 12:15:37,772 INFO L425 ceAbstractionStarter]: For program point L51(lines 51 63) no Hoare annotation was computed. [2018-10-24 12:15:37,772 INFO L425 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-10-24 12:15:37,773 INFO L421 ceAbstractionStarter]: At program point L51-2(lines 50 63) the Hoare annotation is: (let ((.cse0 (* 2 main_~cp~0)) (.cse7 (* 2 main_~scheme~0)) (.cse5 (* 2 main_~tokenlen~0))) (let ((.cse2 (<= .cse5 2000000)) (.cse3 (<= 0 .cse7)) (.cse1 (and (<= 1 (+ main_~scheme~0 main_~urilen~0)) (<= main_~tokenlen~0 (+ main_~urilen~0 999999)) (<= (* 2 main_~urilen~0) 2000000) (<= 2 .cse0) (<= (+ main_~tokenlen~0 main_~urilen~0) 2000000) (<= main_~urilen~0 (+ main_~scheme~0 1000000)) (<= (+ main_~cp~0 1) main_~urilen~0))) (.cse6 (<= .cse7 2000000))) (or (and (<= 4 .cse0) (let ((.cse4 (= main_~c~0 0))) (or (and (<= (+ main_~cp~0 2) main_~urilen~0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (<= 2 (+ main_~tokenlen~0 main_~c~0))))) (<= 2 .cse5) .cse6 (<= (+ main_~c~0 4) main_~urilen~0)) (and (<= (+ main_~c~0 2) main_~cp~0) (<= (+ main_~c~0 1) main_~tokenlen~0) .cse2 .cse3 (<= 2 (* 2 main_~c~0)) .cse1 .cse6)))) [2018-10-24 12:15:37,773 INFO L425 ceAbstractionStarter]: For program point L43(lines 30 66) no Hoare annotation was computed. [2018-10-24 12:15:37,773 INFO L421 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (* 2 main_~tokenlen~0)) (.cse1 (* 2 main_~scheme~0))) (and (<= (* 2 main_~urilen~0) 2000000) (<= .cse0 2000000) (<= 2 (* 2 main_~cp~0)) (<= 2 .cse0) (<= 0 .cse1) (<= .cse1 2000000) (<= (+ main_~cp~0 2) main_~urilen~0))) [2018-10-24 12:15:37,773 INFO L421 ceAbstractionStarter]: At program point L35-1(line 35) the Hoare annotation is: (let ((.cse0 (* 2 main_~tokenlen~0)) (.cse1 (* 2 main_~scheme~0))) (and (<= (* 2 main_~urilen~0) 2000000) (<= .cse0 2000000) (<= 2 (* 2 main_~cp~0)) (<= 2 .cse0) (<= 0 .cse1) (<= .cse1 2000000) (<= (+ main_~cp~0 2) main_~urilen~0))) [2018-10-24 12:15:37,774 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-10-24 12:15:37,774 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-10-24 12:15:37,774 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-10-24 12:15:37,774 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-10-24 12:15:37,774 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-10-24 12:15:37,774 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-10-24 12:15:37,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:15:37 BoogieIcfgContainer [2018-10-24 12:15:37,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 12:15:37,790 INFO L168 Benchmark]: Toolchain (without parser) took 42643.77 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -176.5 MB). Peak memory consumption was 968.0 MB. Max. memory is 7.1 GB. [2018-10-24 12:15:37,792 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:15:37,792 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.29 ms. Allocated memory is still 1.5 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-10-24 12:15:37,793 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.04 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:15:37,794 INFO L168 Benchmark]: Boogie Preprocessor took 29.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:15:37,794 INFO L168 Benchmark]: RCFGBuilder took 675.27 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -764.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2018-10-24 12:15:37,795 INFO L168 Benchmark]: TraceAbstraction took 41577.28 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 412.6 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 577.7 MB). Peak memory consumption was 992.9 MB. Max. memory is 7.1 GB. [2018-10-24 12:15:37,801 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 328.29 ms. Allocated memory is still 1.5 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 25.04 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 675.27 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -764.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 41577.28 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 412.6 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 577.7 MB). Peak memory consumption was 992.9 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: ((((4 <= 2 * cp && (((((cp + 2 <= urilen && (((((1 <= scheme + urilen && tokenlen <= urilen + 999999) && 2 * urilen <= 2000000) && 2 <= 2 * cp) && tokenlen + urilen <= 2000000) && urilen <= scheme + 1000000) && cp + 1 <= urilen) && 2 * tokenlen <= 2000000) && 0 <= 2 * scheme) && c == 0) || ((((((((((1 <= scheme + urilen && tokenlen <= urilen + 999999) && 2 * urilen <= 2000000) && 2 <= 2 * cp) && tokenlen + urilen <= 2000000) && urilen <= scheme + 1000000) && cp + 1 <= urilen) && 2 * tokenlen <= 2000000) && 0 <= 2 * scheme) && c == 0) && 2 <= tokenlen + c))) && 2 <= 2 * tokenlen) && 2 * scheme <= 2000000) && c + 4 <= urilen) || ((((((c + 2 <= cp && c + 1 <= tokenlen) && 2 * tokenlen <= 2000000) && 0 <= 2 * scheme) && 2 <= 2 * c) && (((((1 <= scheme + urilen && tokenlen <= urilen + 999999) && 2 * urilen <= 2000000) && 2 <= 2 * cp) && tokenlen + urilen <= 2000000) && urilen <= scheme + 1000000) && cp + 1 <= urilen) && 2 * scheme <= 2000000) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((2 * urilen <= 2000000 && 2 * tokenlen <= 2000000) && 2 <= 2 * cp) && 2 <= 2 * tokenlen) && cp + 1 <= urilen) && 0 <= 2 * scheme) && 2 * scheme <= 2000000 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 55 locations, 1 error locations. SAFE Result, 41.5s OverallTime, 7 OverallIterations, 21 TraceHistogramMax, 26.0s AutomataDifference, 0.0s DeadEndRemovalTime, 8.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 359 SDtfs, 608 SDslu, 1861 SDs, 0 SdLazy, 712 SolverSat, 1120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 490 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 5 AbstIntIterations, 5 AbstIntStrong, 0.9109655133036433 AbsIntWeakeningRatio, 0.41007194244604317 AbsIntAvgWeakeningVarsNumRemoved, 8.997601918465227 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 51 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 96 PreInvPairs, 140 NumberOfFragments, 1086 HoareAnnotationTreeSize, 96 FomulaSimplifications, 15555 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 26 FomulaSimplificationsInter, 11778 FormulaSimplificationTreeSizeReductionInter, 7.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 489 NumberOfCodeBlocks, 489 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 482 ConstructedInterpolants, 0 QuantifiedInterpolants, 62586 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 1741/1909 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...