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/loops/string_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 12:06:24,591 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 12:06:24,593 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 12:06:24,607 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 12:06:24,607 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 12:06:24,609 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 12:06:24,610 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 12:06:24,613 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 12:06:24,615 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 12:06:24,616 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 12:06:24,616 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 12:06:24,617 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 12:06:24,618 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 12:06:24,619 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 12:06:24,620 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 12:06:24,621 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 12:06:24,622 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 12:06:24,624 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 12:06:24,629 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 12:06:24,634 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 12:06:24,636 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 12:06:24,640 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 12:06:24,645 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 12:06:24,645 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 12:06:24,645 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 12:06:24,646 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 12:06:24,647 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 12:06:24,651 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 12:06:24,652 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 12:06:24,653 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 12:06:24,653 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 12:06:24,655 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 12:06:24,655 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 12:06:24,655 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 12:06:24,656 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 12:06:24,658 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 12:06:24,658 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:06:24,686 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 12:06:24,686 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 12:06:24,687 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 12:06:24,687 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 12:06:24,687 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 12:06:24,688 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 12:06:24,688 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 12:06:24,688 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 12:06:24,689 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 12:06:24,689 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 12:06:24,689 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 12:06:24,689 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 12:06:24,690 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 12:06:24,691 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 12:06:24,691 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 12:06:24,691 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 12:06:24,691 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 12:06:24,692 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 12:06:24,692 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 12:06:24,692 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 12:06:24,692 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 12:06:24,692 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 12:06:24,693 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 12:06:24,695 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 12:06:24,695 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:06:24,695 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 12:06:24,695 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 12:06:24,696 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 12:06:24,696 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 12:06:24,696 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 12:06:24,696 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 12:06:24,696 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 12:06:24,697 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 12:06:24,697 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 12:06:24,758 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 12:06:24,782 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 12:06:24,787 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 12:06:24,789 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 12:06:24,789 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 12:06:24,790 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/string_true-unreach-call_true-termination.i [2018-10-24 12:06:24,859 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8bf7def85/ad0567bc08534a0a8e5767a3cee521ee/FLAGd10fd80fc [2018-10-24 12:06:25,310 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 12:06:25,311 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/string_true-unreach-call_true-termination.i [2018-10-24 12:06:25,319 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8bf7def85/ad0567bc08534a0a8e5767a3cee521ee/FLAGd10fd80fc [2018-10-24 12:06:25,345 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8bf7def85/ad0567bc08534a0a8e5767a3cee521ee [2018-10-24 12:06:25,359 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 12:06:25,361 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 12:06:25,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 12:06:25,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 12:06:25,367 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 12:06:25,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:06:25" (1/1) ... [2018-10-24 12:06:25,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58fe24b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:06:25, skipping insertion in model container [2018-10-24 12:06:25,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:06:25" (1/1) ... [2018-10-24 12:06:25,383 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 12:06:25,408 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 12:06:25,654 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:06:25,659 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 12:06:25,693 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:06:25,719 INFO L193 MainTranslator]: Completed translation [2018-10-24 12:06:25,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:06:25 WrapperNode [2018-10-24 12:06:25,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 12:06:25,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 12:06:25,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 12:06:25,721 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 12:06:25,733 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:06:25" (1/1) ... [2018-10-24 12:06:25,744 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:06:25" (1/1) ... [2018-10-24 12:06:25,776 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 12:06:25,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 12:06:25,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 12:06:25,777 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 12:06:25,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:06:25" (1/1) ... [2018-10-24 12:06:25,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:06:25" (1/1) ... [2018-10-24 12:06:25,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:06:25" (1/1) ... [2018-10-24 12:06:25,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:06:25" (1/1) ... [2018-10-24 12:06:25,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:06:25" (1/1) ... [2018-10-24 12:06:25,809 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:06:25" (1/1) ... [2018-10-24 12:06:25,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:06:25" (1/1) ... [2018-10-24 12:06:25,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 12:06:25,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 12:06:25,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 12:06:25,816 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 12:06:25,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:06:25" (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:06:25,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 12:06:25,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 12:06:25,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 12:06:25,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 12:06:25,990 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 12:06:25,991 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 12:06:25,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-24 12:06:25,991 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-24 12:06:26,571 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 12:06:26,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:06:26 BoogieIcfgContainer [2018-10-24 12:06:26,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 12:06:26,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 12:06:26,573 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 12:06:26,577 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 12:06:26,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:06:25" (1/3) ... [2018-10-24 12:06:26,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c00570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:06:26, skipping insertion in model container [2018-10-24 12:06:26,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:06:25" (2/3) ... [2018-10-24 12:06:26,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c00570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:06:26, skipping insertion in model container [2018-10-24 12:06:26,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:06:26" (3/3) ... [2018-10-24 12:06:26,582 INFO L112 eAbstractionObserver]: Analyzing ICFG string_true-unreach-call_true-termination.i [2018-10-24 12:06:26,592 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 12:06:26,604 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 12:06:26,627 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 12:06:26,662 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 12:06:26,663 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 12:06:26,663 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 12:06:26,663 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 12:06:26,663 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 12:06:26,664 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 12:06:26,664 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 12:06:26,664 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 12:06:26,687 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-10-24 12:06:26,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-24 12:06:26,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:06:26,696 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:06:26,698 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:06:26,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:06:26,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1091547452, now seen corresponding path program 1 times [2018-10-24 12:06:26,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:06:26,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:06:26,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:06:26,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:06:26,762 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:06:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:06:26,873 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:06:26,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:06:26,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 12:06:26,877 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:06:26,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 12:06:26,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 12:06:26,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 12:06:26,901 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-10-24 12:06:26,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:06:26,930 INFO L93 Difference]: Finished difference Result 71 states and 98 transitions. [2018-10-24 12:06:26,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 12:06:26,931 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-10-24 12:06:26,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:06:26,940 INFO L225 Difference]: With dead ends: 71 [2018-10-24 12:06:26,940 INFO L226 Difference]: Without dead ends: 33 [2018-10-24 12:06:26,944 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 12:06:26,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-24 12:06:26,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-24 12:06:26,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-24 12:06:26,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-10-24 12:06:26,981 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 22 [2018-10-24 12:06:26,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:06:26,981 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-10-24 12:06:26,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 12:06:26,982 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-10-24 12:06:26,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-24 12:06:26,983 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:06:26,983 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:06:26,983 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:06:26,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:06:26,984 INFO L82 PathProgramCache]: Analyzing trace with hash 499356089, now seen corresponding path program 1 times [2018-10-24 12:06:26,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:06:26,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:06:26,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:06:26,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:06:26,986 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:06:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:06:27,087 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:06:27,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:06:27,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 12:06:27,088 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:06:27,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 12:06:27,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 12:06:27,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 12:06:27,091 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 3 states. [2018-10-24 12:06:27,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:06:27,245 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2018-10-24 12:06:27,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 12:06:27,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-24 12:06:27,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:06:27,253 INFO L225 Difference]: With dead ends: 68 [2018-10-24 12:06:27,253 INFO L226 Difference]: Without dead ends: 44 [2018-10-24 12:06:27,255 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:06:27,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-24 12:06:27,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2018-10-24 12:06:27,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-24 12:06:27,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-10-24 12:06:27,268 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 29 [2018-10-24 12:06:27,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:06:27,269 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-10-24 12:06:27,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 12:06:27,269 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-10-24 12:06:27,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-24 12:06:27,270 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:06:27,270 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 12:06:27,271 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:06:27,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:06:27,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1017977548, now seen corresponding path program 1 times [2018-10-24 12:06:27,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:06:27,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:06:27,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:06:27,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:06:27,273 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:06:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:06:27,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 12:06:27,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:06:27,464 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:06:27,466 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-10-24 12:06:27,468 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [28], [31], [33], [35], [39], [43], [47], [49], [52], [58], [62], [64], [67], [76], [80], [84], [96], [100], [103], [105], [111], [112], [113], [115] [2018-10-24 12:06:27,559 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:06:27,560 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:06:29,033 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 12:06:29,035 INFO L272 AbstractInterpreter]: Visited 32 different actions 72 times. Merged at 6 different actions 30 times. Widened at 2 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 41 variables. [2018-10-24 12:06:29,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:06:29,073 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 12:06:29,557 INFO L232 lantSequenceWeakener]: Weakened 33 states. On average, predicates are now at 79.83% of their original sizes. [2018-10-24 12:06:29,557 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 12:06:30,833 INFO L413 sIntCurrentIteration]: We have 34 unified AI predicates [2018-10-24 12:06:30,833 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 12:06:30,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:06:30,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-10-24 12:06:30,836 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:06:30,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 12:06:30,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 12:06:30,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-10-24 12:06:30,842 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 14 states. [2018-10-24 12:06:34,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:06:34,512 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2018-10-24 12:06:34,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-24 12:06:34,513 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-10-24 12:06:34,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:06:34,514 INFO L225 Difference]: With dead ends: 78 [2018-10-24 12:06:34,515 INFO L226 Difference]: Without dead ends: 62 [2018-10-24 12:06:34,516 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-10-24 12:06:34,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-24 12:06:34,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2018-10-24 12:06:34,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-24 12:06:34,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-10-24 12:06:34,528 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 35 [2018-10-24 12:06:34,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:06:34,529 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-10-24 12:06:34,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-24 12:06:34,529 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-10-24 12:06:34,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-24 12:06:34,531 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:06:34,531 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 12:06:34,531 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:06:34,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:06:34,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1688336305, now seen corresponding path program 1 times [2018-10-24 12:06:34,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:06:34,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:06:34,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:06:34,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:06:34,533 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:06:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:06:34,662 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 12:06:34,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:06:34,663 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:06:34,663 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-10-24 12:06:34,663 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [28], [31], [33], [35], [39], [43], [47], [49], [52], [58], [62], [64], [67], [69], [76], [80], [84], [96], [100], [103], [105], [111], [112], [113], [115] [2018-10-24 12:06:34,669 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:06:34,671 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:06:37,558 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 12:06:37,559 INFO L272 AbstractInterpreter]: Visited 33 different actions 438 times. Merged at 14 different actions 296 times. Widened at 4 different actions 61 times. Found 3 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-24 12:06:37,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:06:37,597 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 12:06:37,918 INFO L232 lantSequenceWeakener]: Weakened 36 states. On average, predicates are now at 79.65% of their original sizes. [2018-10-24 12:06:37,919 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 12:06:38,529 INFO L413 sIntCurrentIteration]: We have 37 unified AI predicates [2018-10-24 12:06:38,529 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 12:06:38,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:06:38,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-10-24 12:06:38,530 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:06:38,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 12:06:38,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 12:06:38,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-10-24 12:06:38,531 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 14 states. [2018-10-24 12:06:40,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:06:40,387 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-10-24 12:06:40,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 12:06:40,388 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-10-24 12:06:40,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:06:40,388 INFO L225 Difference]: With dead ends: 62 [2018-10-24 12:06:40,388 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 12:06:40,390 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-10-24 12:06:40,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 12:06:40,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 12:06:40,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 12:06:40,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 12:06:40,392 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2018-10-24 12:06:40,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:06:40,392 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 12:06:40,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-24 12:06:40,392 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 12:06:40,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 12:06:40,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 12:06:40,563 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 110 [2018-10-24 12:06:40,918 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 26 [2018-10-24 12:06:41,397 WARN L179 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 39 [2018-10-24 12:06:41,678 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 26 [2018-10-24 12:06:41,861 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-24 12:06:41,861 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-10-24 12:06:41,862 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-24 12:06:41,862 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 12:06:41,862 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-24 12:06:41,862 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-24 12:06:41,862 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 12:06:41,862 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 14 58) no Hoare annotation was computed. [2018-10-24 12:06:41,862 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 23 24) no Hoare annotation was computed. [2018-10-24 12:06:41,862 INFO L425 ceAbstractionStarter]: For program point L23-3(lines 23 24) no Hoare annotation was computed. [2018-10-24 12:06:41,863 INFO L421 ceAbstractionStarter]: At program point L23-4(lines 23 24) the Hoare annotation is: (let ((.cse0 (* 2 main_~found~0))) (and (<= 0 .cse0) (<= .cse0 2) (not (= |main_~#string_A~0.base| 0)) (<= (* 2 |main_~#string_B~0.offset|) 0) (<= 0 (+ main_~i~0 |main_~#string_B~0.offset|)) (<= 0 (* 2 |main_~#string_A~0.offset|)) (<= (* 2 main_~i~0) 10) (not (= |main_~#string_B~0.base| 0)) (<= |main_~#string_A~0.offset| |main_~#string_B~0.offset|))) [2018-10-24 12:06:41,863 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 19 20) no Hoare annotation was computed. [2018-10-24 12:06:41,863 INFO L425 ceAbstractionStarter]: For program point L23-5(lines 23 24) no Hoare annotation was computed. [2018-10-24 12:06:41,863 INFO L425 ceAbstractionStarter]: For program point L19-3(lines 19 20) no Hoare annotation was computed. [2018-10-24 12:06:41,863 INFO L421 ceAbstractionStarter]: At program point L19-4(lines 19 20) the Hoare annotation is: (let ((.cse0 (* 2 main_~found~0))) (and (<= 0 .cse0) (<= .cse0 2) (not (= |main_~#string_A~0.base| 0)) (<= (* 2 |main_~#string_B~0.offset|) 0) (<= 0 (+ main_~i~0 |main_~#string_B~0.offset|)) (<= 0 (* 2 |main_~#string_A~0.offset|)) (<= (* 2 main_~i~0) 10) (not (= |main_~#string_B~0.base| 0)) (<= |main_~#string_A~0.offset| |main_~#string_B~0.offset|))) [2018-10-24 12:06:41,863 INFO L425 ceAbstractionStarter]: For program point L19-5(lines 19 20) no Hoare annotation was computed. [2018-10-24 12:06:41,864 INFO L425 ceAbstractionStarter]: For program point L32-1(lines 32 33) no Hoare annotation was computed. [2018-10-24 12:06:41,864 INFO L425 ceAbstractionStarter]: For program point L32-2(lines 32 33) no Hoare annotation was computed. [2018-10-24 12:06:41,864 INFO L421 ceAbstractionStarter]: At program point L32-4(lines 32 33) the Hoare annotation is: (let ((.cse0 (* 2 main_~found~0))) (and (<= 0 .cse0) (<= .cse0 2) (not (= |main_~#string_A~0.base| 0)) (<= (* 2 |main_~#string_B~0.offset|) 0) (<= 0 (+ main_~i~0 |main_~#string_B~0.offset|)) (<= 0 (* 2 |main_~#string_A~0.offset|)) (<= (* 2 main_~i~0) 10) (not (= |main_~#string_B~0.base| 0)) (<= |main_~#string_A~0.offset| |main_~#string_B~0.offset|))) [2018-10-24 12:06:41,864 INFO L425 ceAbstractionStarter]: For program point L28-1(lines 28 29) no Hoare annotation was computed. [2018-10-24 12:06:41,865 INFO L425 ceAbstractionStarter]: For program point L32-5(lines 15 58) no Hoare annotation was computed. [2018-10-24 12:06:41,865 INFO L425 ceAbstractionStarter]: For program point L28-2(lines 28 29) no Hoare annotation was computed. [2018-10-24 12:06:41,865 INFO L421 ceAbstractionStarter]: At program point L28-4(lines 28 29) the Hoare annotation is: (let ((.cse0 (* 2 main_~found~0))) (and (<= 0 .cse0) (<= .cse0 2) (not (= |main_~#string_A~0.base| 0)) (<= (* 2 |main_~#string_B~0.offset|) 0) (<= 0 (+ main_~i~0 |main_~#string_B~0.offset|)) (<= 0 (* 2 |main_~#string_A~0.offset|)) (<= (* 2 main_~i~0) 10) (not (= |main_~#string_B~0.base| 0)) (<= |main_~#string_A~0.offset| |main_~#string_B~0.offset|))) [2018-10-24 12:06:41,865 INFO L425 ceAbstractionStarter]: For program point L28-5(lines 28 29) no Hoare annotation was computed. [2018-10-24 12:06:41,865 INFO L425 ceAbstractionStarter]: For program point L41(lines 41 50) no Hoare annotation was computed. [2018-10-24 12:06:41,866 INFO L421 ceAbstractionStarter]: At program point L41-2(lines 39 51) the Hoare annotation is: (let ((.cse2 (not (= |main_~#string_A~0.base| 0))) (.cse1 (not (= |main_~#string_B~0.base| 0)))) (or (let ((.cse0 (* 2 main_~found~0))) (and (<= 0 .cse0) .cse1 (<= .cse0 2) .cse2 (<= (* 2 |main_~#string_B~0.offset|) 0) (<= 0 (* 2 |main_~#string_A~0.offset|)) (<= |main_~#string_A~0.offset| |main_~#string_B~0.offset|))) (and .cse2 .cse1 (<= main_~nc_A~0 |main_~#string_A~0.offset|) (<= (+ |main_~#string_B~0.offset| |main_~#string_A~0.offset|) 0) (<= main_~nc_A~0 main_~j~0) (<= 0 (+ main_~i~0 main_~nc_A~0)) (<= (+ main_~j~0 main_~nc_B~0) 0) (<= 0 (* 2 main_~nc_B~0)) (<= 0 (+ main_~i~0 |main_~#string_B~0.offset|)) (= main_~i~0 0)))) [2018-10-24 12:06:41,866 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-10-24 12:06:41,866 INFO L425 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-10-24 12:06:41,866 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 14 58) no Hoare annotation was computed. [2018-10-24 12:06:41,866 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 14 58) the Hoare annotation is: true [2018-10-24 12:06:41,866 INFO L421 ceAbstractionStarter]: At program point L55(line 55) the Hoare annotation is: (let ((.cse0 (* 2 main_~found~0))) (and (<= 0 .cse0) (<= .cse0 2) (not (= |main_~#string_A~0.base| 0)) (<= (* 2 |main_~#string_B~0.offset|) 0) (<= 0 (* 2 |main_~#string_A~0.offset|)) (not (= |main_~#string_B~0.base| 0)) (<= |main_~#string_A~0.offset| |main_~#string_B~0.offset|))) [2018-10-24 12:06:41,867 INFO L425 ceAbstractionStarter]: For program point L55-1(line 55) no Hoare annotation was computed. [2018-10-24 12:06:41,867 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 39 51) no Hoare annotation was computed. [2018-10-24 12:06:41,867 INFO L425 ceAbstractionStarter]: For program point L39-3(lines 39 51) no Hoare annotation was computed. [2018-10-24 12:06:41,867 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2018-10-24 12:06:41,867 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2018-10-24 12:06:41,867 INFO L425 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-10-24 12:06:41,867 INFO L425 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-10-24 12:06:41,870 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-10-24 12:06:41,870 INFO L425 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2018-10-24 12:06:41,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:06:41 BoogieIcfgContainer [2018-10-24 12:06:41,889 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 12:06:41,890 INFO L168 Benchmark]: Toolchain (without parser) took 16529.92 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 134.9 MB. Max. memory is 7.1 GB. [2018-10-24 12:06:41,892 INFO L168 Benchmark]: CDTParser took 0.24 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:06:41,892 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.64 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:06:41,893 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.92 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:06:41,894 INFO L168 Benchmark]: Boogie Preprocessor took 38.30 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:06:41,894 INFO L168 Benchmark]: RCFGBuilder took 756.51 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -744.1 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. [2018-10-24 12:06:41,895 INFO L168 Benchmark]: TraceAbstraction took 15315.78 ms. Allocated memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: 490.2 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -340.1 MB). Peak memory consumption was 150.1 MB. Max. memory is 7.1 GB. [2018-10-24 12:06:41,901 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.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 357.64 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 55.92 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 38.30 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 756.51 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -744.1 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15315.78 ms. Allocated memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: 490.2 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -340.1 MB). Peak memory consumption was 150.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: 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: 32]: Loop Invariant Derived loop invariant: (((((((0 <= 2 * found && 2 * found <= 2) && !(string_A == 0)) && 2 * string_B <= 0) && 0 <= i + string_B) && 0 <= 2 * string_A) && 2 * i <= 10) && !(string_B == 0)) && string_A <= string_B - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((((((0 <= 2 * found && !(string_B == 0)) && 2 * found <= 2) && !(string_A == 0)) && 2 * string_B <= 0) && 0 <= 2 * string_A) && string_A <= string_B) || (((((((((!(string_A == 0) && !(string_B == 0)) && nc_A <= string_A) && string_B + string_A <= 0) && nc_A <= j) && 0 <= i + nc_A) && j + nc_B <= 0) && 0 <= 2 * nc_B) && 0 <= i + string_B) && i == 0) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((((0 <= 2 * found && 2 * found <= 2) && !(string_A == 0)) && 2 * string_B <= 0) && 0 <= i + string_B) && 0 <= 2 * string_A) && 2 * i <= 10) && !(string_B == 0)) && string_A <= string_B - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((((0 <= 2 * found && 2 * found <= 2) && !(string_A == 0)) && 2 * string_B <= 0) && 0 <= i + string_B) && 0 <= 2 * string_A) && 2 * i <= 10) && !(string_B == 0)) && string_A <= string_B - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((((((0 <= 2 * found && 2 * found <= 2) && !(string_A == 0)) && 2 * string_B <= 0) && 0 <= i + string_B) && 0 <= 2 * string_A) && 2 * i <= 10) && !(string_B == 0)) && string_A <= string_B - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 1 error locations. SAFE Result, 15.2s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 114 SDtfs, 265 SDslu, 299 SDs, 0 SdLazy, 59 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 89 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.5s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.9540265986160864 AbsIntWeakeningRatio, 1.6619718309859155 AbsIntAvgWeakeningVarsNumRemoved, 278.6056338028169 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 19 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 18 PreInvPairs, 36 NumberOfFragments, 281 HoareAnnotationTreeSize, 18 FomulaSimplifications, 3654 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 11 FomulaSimplificationsInter, 1054 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 4572 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 7/11 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...