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-8c3fbe1 [2018-10-22 15:59:37,674 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-22 15:59:37,676 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-22 15:59:37,689 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-22 15:59:37,692 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-22 15:59:37,693 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-22 15:59:37,698 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-22 15:59:37,700 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-22 15:59:37,703 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-22 15:59:37,704 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-22 15:59:37,708 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-22 15:59:37,708 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-22 15:59:37,709 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-22 15:59:37,716 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-22 15:59:37,718 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-22 15:59:37,719 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-22 15:59:37,719 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-22 15:59:37,725 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-22 15:59:37,727 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-22 15:59:37,733 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-22 15:59:37,736 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-22 15:59:37,737 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-22 15:59:37,742 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-22 15:59:37,742 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-22 15:59:37,742 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-22 15:59:37,743 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-22 15:59:37,744 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-22 15:59:37,747 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-22 15:59:37,748 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-22 15:59:37,752 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-22 15:59:37,752 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-22 15:59:37,753 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-22 15:59:37,753 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-22 15:59:37,753 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-22 15:59:37,754 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-22 15:59:37,755 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-22 15:59:37,755 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-22 15:59:37,770 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-22 15:59:37,770 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-22 15:59:37,771 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-22 15:59:37,771 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-22 15:59:37,771 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-22 15:59:37,772 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-22 15:59:37,772 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-22 15:59:37,772 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-22 15:59:37,772 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-22 15:59:37,772 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-22 15:59:37,773 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-22 15:59:37,773 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-22 15:59:37,773 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-22 15:59:37,774 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-22 15:59:37,774 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-22 15:59:37,774 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-22 15:59:37,774 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-22 15:59:37,774 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-22 15:59:37,775 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-22 15:59:37,775 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-22 15:59:37,775 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-22 15:59:37,775 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-22 15:59:37,776 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-22 15:59:37,776 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-22 15:59:37,776 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-22 15:59:37,776 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-22 15:59:37,776 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-22 15:59:37,777 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-22 15:59:37,777 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-22 15:59:37,777 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-22 15:59:37,777 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-22 15:59:37,777 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-22 15:59:37,777 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-22 15:59:37,778 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-22 15:59:37,839 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-22 15:59:37,856 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-22 15:59:37,862 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-22 15:59:37,863 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-22 15:59:37,864 INFO L276 PluginConnector]: CDTParser initialized [2018-10-22 15:59:37,865 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-22 15:59:37,933 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7fddc1cf0/9fbfe49d2f214b7e8dbc6c7818b7250d/FLAG50f17a022 [2018-10-22 15:59:38,462 INFO L298 CDTParser]: Found 1 translation units. [2018-10-22 15:59:38,463 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/string_true-unreach-call_true-termination.i [2018-10-22 15:59:38,470 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7fddc1cf0/9fbfe49d2f214b7e8dbc6c7818b7250d/FLAG50f17a022 [2018-10-22 15:59:38,486 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7fddc1cf0/9fbfe49d2f214b7e8dbc6c7818b7250d [2018-10-22 15:59:38,499 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-22 15:59:38,501 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-22 15:59:38,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-22 15:59:38,503 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-22 15:59:38,507 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-22 15:59:38,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 03:59:38" (1/1) ... [2018-10-22 15:59:38,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@436ba03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:59:38, skipping insertion in model container [2018-10-22 15:59:38,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 03:59:38" (1/1) ... [2018-10-22 15:59:38,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-22 15:59:38,555 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-22 15:59:38,789 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 15:59:38,795 INFO L189 MainTranslator]: Completed pre-run [2018-10-22 15:59:38,837 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 15:59:38,865 INFO L193 MainTranslator]: Completed translation [2018-10-22 15:59:38,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:59:38 WrapperNode [2018-10-22 15:59:38,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-22 15:59:38,867 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-22 15:59:38,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-22 15:59:38,868 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-22 15:59:38,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:59:38" (1/1) ... [2018-10-22 15:59:38,894 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:59:38" (1/1) ... [2018-10-22 15:59:38,933 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-22 15:59:38,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-22 15:59:38,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-22 15:59:38,934 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-22 15:59:38,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:59:38" (1/1) ... [2018-10-22 15:59:38,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:59:38" (1/1) ... [2018-10-22 15:59:38,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:59:38" (1/1) ... [2018-10-22 15:59:38,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:59:38" (1/1) ... [2018-10-22 15:59:38,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:59:38" (1/1) ... [2018-10-22 15:59:38,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:59:38" (1/1) ... [2018-10-22 15:59:38,990 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:59:38" (1/1) ... [2018-10-22 15:59:38,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-22 15:59:38,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-22 15:59:38,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-22 15:59:38,996 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-22 15:59:38,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:59:38" (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-22 15:59:39,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-22 15:59:39,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-22 15:59:39,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-22 15:59:39,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-22 15:59:39,143 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-22 15:59:39,144 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-22 15:59:39,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-22 15:59:39,144 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-22 15:59:39,705 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-22 15:59:39,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 03:59:39 BoogieIcfgContainer [2018-10-22 15:59:39,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-22 15:59:39,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-22 15:59:39,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-22 15:59:39,711 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-22 15:59:39,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 03:59:38" (1/3) ... [2018-10-22 15:59:39,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52dceced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 03:59:39, skipping insertion in model container [2018-10-22 15:59:39,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:59:38" (2/3) ... [2018-10-22 15:59:39,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52dceced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 03:59:39, skipping insertion in model container [2018-10-22 15:59:39,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 03:59:39" (3/3) ... [2018-10-22 15:59:39,715 INFO L112 eAbstractionObserver]: Analyzing ICFG string_true-unreach-call_true-termination.i [2018-10-22 15:59:39,725 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-22 15:59:39,733 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-22 15:59:39,752 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-22 15:59:39,786 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-22 15:59:39,787 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-22 15:59:39,788 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-22 15:59:39,788 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-22 15:59:39,788 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-22 15:59:39,788 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-22 15:59:39,788 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-22 15:59:39,789 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-22 15:59:39,789 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-22 15:59:39,809 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-10-22 15:59:39,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-22 15:59:39,815 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:59:39,817 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-22 15:59:39,819 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:59:39,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:59:39,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1091547452, now seen corresponding path program 1 times [2018-10-22 15:59:39,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 15:59:39,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:59:39,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:59:39,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:59:39,884 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 15:59:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:59:39,996 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-22 15:59:39,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:59:39,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-22 15:59:40,000 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 15:59:40,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-22 15:59:40,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-22 15:59:40,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-22 15:59:40,020 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-10-22 15:59:40,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:59:40,045 INFO L93 Difference]: Finished difference Result 71 states and 98 transitions. [2018-10-22 15:59:40,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-22 15:59:40,046 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-10-22 15:59:40,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:59:40,054 INFO L225 Difference]: With dead ends: 71 [2018-10-22 15:59:40,054 INFO L226 Difference]: Without dead ends: 33 [2018-10-22 15:59:40,058 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-22 15:59:40,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-22 15:59:40,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-22 15:59:40,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-22 15:59:40,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-10-22 15:59:40,098 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 22 [2018-10-22 15:59:40,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:59:40,098 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-10-22 15:59:40,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-22 15:59:40,099 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-10-22 15:59:40,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-22 15:59:40,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:59:40,100 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-22 15:59:40,101 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:59:40,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:59:40,101 INFO L82 PathProgramCache]: Analyzing trace with hash 499356089, now seen corresponding path program 1 times [2018-10-22 15:59:40,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 15:59:40,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:59:40,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:59:40,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:59:40,103 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 15:59:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:59:40,193 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-22 15:59:40,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:59:40,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-22 15:59:40,194 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 15:59:40,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-22 15:59:40,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-22 15:59:40,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-22 15:59:40,198 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 3 states. [2018-10-22 15:59:40,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:59:40,342 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2018-10-22 15:59:40,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-22 15:59:40,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-22 15:59:40,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:59:40,346 INFO L225 Difference]: With dead ends: 68 [2018-10-22 15:59:40,347 INFO L226 Difference]: Without dead ends: 44 [2018-10-22 15:59:40,349 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-22 15:59:40,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-22 15:59:40,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2018-10-22 15:59:40,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-22 15:59:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-10-22 15:59:40,358 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 29 [2018-10-22 15:59:40,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:59:40,358 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-10-22 15:59:40,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-22 15:59:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-10-22 15:59:40,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-22 15:59:40,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:59:40,360 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-22 15:59:40,360 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:59:40,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:59:40,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1017977548, now seen corresponding path program 1 times [2018-10-22 15:59:40,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 15:59:40,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:59:40,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:59:40,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:59:40,363 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 15:59:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:59:40,550 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-22 15:59:40,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:59:40,551 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 15:59:40,552 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-10-22 15:59:40,555 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-22 15:59:40,610 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 15:59:40,610 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 15:59:41,944 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 15:59:41,946 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-22 15:59:41,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:59:41,976 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 15:59:42,399 INFO L232 lantSequenceWeakener]: Weakened 33 states. On average, predicates are now at 79.83% of their original sizes. [2018-10-22 15:59:42,399 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 15:59:43,560 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 15:59:43,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 15:59:43,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-10-22 15:59:43,561 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 15:59:43,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-22 15:59:43,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-22 15:59:43,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-10-22 15:59:43,565 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 14 states. [2018-10-22 15:59:47,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:59:47,003 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2018-10-22 15:59:47,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-22 15:59:47,004 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-10-22 15:59:47,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:59:47,007 INFO L225 Difference]: With dead ends: 78 [2018-10-22 15:59:47,008 INFO L226 Difference]: Without dead ends: 62 [2018-10-22 15:59:47,009 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-10-22 15:59:47,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-22 15:59:47,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2018-10-22 15:59:47,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-22 15:59:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-10-22 15:59:47,021 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 35 [2018-10-22 15:59:47,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:59:47,021 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-10-22 15:59:47,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-22 15:59:47,022 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-10-22 15:59:47,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-22 15:59:47,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:59:47,023 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-22 15:59:47,023 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:59:47,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:59:47,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1688336305, now seen corresponding path program 1 times [2018-10-22 15:59:47,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 15:59:47,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:59:47,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:59:47,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:59:47,026 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 15:59:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:59:47,148 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-22 15:59:47,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:59:47,149 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 15:59:47,149 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-10-22 15:59:47,150 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-22 15:59:47,153 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 15:59:47,153 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 15:59:50,110 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 15:59:50,110 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-22 15:59:50,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:59:50,126 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 15:59:50,316 INFO L232 lantSequenceWeakener]: Weakened 36 states. On average, predicates are now at 79.65% of their original sizes. [2018-10-22 15:59:50,316 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 15:59:50,924 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 15:59:50,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 15:59:50,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-10-22 15:59:50,925 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 15:59:50,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-22 15:59:50,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-22 15:59:50,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-10-22 15:59:50,926 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 14 states. [2018-10-22 15:59:53,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:59:53,312 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-10-22 15:59:53,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-22 15:59:53,312 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-10-22 15:59:53,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:59:53,313 INFO L225 Difference]: With dead ends: 62 [2018-10-22 15:59:53,313 INFO L226 Difference]: Without dead ends: 0 [2018-10-22 15:59:53,314 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-10-22 15:59:53,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-22 15:59:53,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-22 15:59:53,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-22 15:59:53,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-22 15:59:53,315 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2018-10-22 15:59:53,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:59:53,316 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-22 15:59:53,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-22 15:59:53,316 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-22 15:59:53,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-22 15:59:53,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-22 15:59:54,140 WARN L179 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 26 [2018-10-22 15:59:54,637 WARN L179 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 39 [2018-10-22 15:59:54,825 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 26 [2018-10-22 15:59:55,039 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 26 [2018-10-22 15:59:55,042 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-22 15:59:55,043 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-10-22 15:59:55,043 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-22 15:59:55,043 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-22 15:59:55,043 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-22 15:59:55,043 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-22 15:59:55,043 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-22 15:59:55,043 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 14 58) no Hoare annotation was computed. [2018-10-22 15:59:55,043 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 23 24) no Hoare annotation was computed. [2018-10-22 15:59:55,043 INFO L425 ceAbstractionStarter]: For program point L23-3(lines 23 24) no Hoare annotation was computed. [2018-10-22 15:59:55,044 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-22 15:59:55,044 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 19 20) no Hoare annotation was computed. [2018-10-22 15:59:55,044 INFO L425 ceAbstractionStarter]: For program point L23-5(lines 23 24) no Hoare annotation was computed. [2018-10-22 15:59:55,044 INFO L425 ceAbstractionStarter]: For program point L19-3(lines 19 20) no Hoare annotation was computed. [2018-10-22 15:59:55,044 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-22 15:59:55,045 INFO L425 ceAbstractionStarter]: For program point L19-5(lines 19 20) no Hoare annotation was computed. [2018-10-22 15:59:55,045 INFO L425 ceAbstractionStarter]: For program point L32-1(lines 32 33) no Hoare annotation was computed. [2018-10-22 15:59:55,045 INFO L425 ceAbstractionStarter]: For program point L32-2(lines 32 33) no Hoare annotation was computed. [2018-10-22 15:59:55,045 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-22 15:59:55,045 INFO L425 ceAbstractionStarter]: For program point L28-1(lines 28 29) no Hoare annotation was computed. [2018-10-22 15:59:55,046 INFO L425 ceAbstractionStarter]: For program point L32-5(lines 15 58) no Hoare annotation was computed. [2018-10-22 15:59:55,046 INFO L425 ceAbstractionStarter]: For program point L28-2(lines 28 29) no Hoare annotation was computed. [2018-10-22 15:59:55,046 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-22 15:59:55,046 INFO L425 ceAbstractionStarter]: For program point L28-5(lines 28 29) no Hoare annotation was computed. [2018-10-22 15:59:55,046 INFO L425 ceAbstractionStarter]: For program point L41(lines 41 50) no Hoare annotation was computed. [2018-10-22 15:59:55,046 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-22 15:59:55,046 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-10-22 15:59:55,046 INFO L425 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-10-22 15:59:55,047 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 14 58) no Hoare annotation was computed. [2018-10-22 15:59:55,047 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 14 58) the Hoare annotation is: true [2018-10-22 15:59:55,047 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-22 15:59:55,047 INFO L425 ceAbstractionStarter]: For program point L55-1(line 55) no Hoare annotation was computed. [2018-10-22 15:59:55,047 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 39 51) no Hoare annotation was computed. [2018-10-22 15:59:55,047 INFO L425 ceAbstractionStarter]: For program point L39-3(lines 39 51) no Hoare annotation was computed. [2018-10-22 15:59:55,047 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2018-10-22 15:59:55,048 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-10-22 15:59:55,048 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2018-10-22 15:59:55,048 INFO L425 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-10-22 15:59:55,048 INFO L425 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-10-22 15:59:55,048 INFO L425 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2018-10-22 15:59:55,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 03:59:55 BoogieIcfgContainer [2018-10-22 15:59:55,066 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-22 15:59:55,067 INFO L168 Benchmark]: Toolchain (without parser) took 16566.95 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.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 182.7 MB. Max. memory is 7.1 GB. [2018-10-22 15:59:55,068 INFO L168 Benchmark]: CDTParser took 0.26 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-22 15:59:55,069 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.39 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-22 15:59:55,070 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.26 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-22 15:59:55,070 INFO L168 Benchmark]: Boogie Preprocessor took 61.55 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-22 15:59:55,071 INFO L168 Benchmark]: RCFGBuilder took 710.69 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -734.1 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2018-10-22 15:59:55,072 INFO L168 Benchmark]: TraceAbstraction took 15358.71 ms. Allocated memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: 492.3 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -292.2 MB). Peak memory consumption was 200.1 MB. Max. memory is 7.1 GB. [2018-10-22 15:59:55,077 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.26 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 364.39 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 66.26 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 61.55 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 710.69 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -734.1 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15358.71 ms. Allocated memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: 492.3 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -292.2 MB). Peak memory consumption was 200.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, 6.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 114 SDtfs, 265 SDslu, 299 SDs, 0 SdLazy, 59 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s 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.4s 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.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s 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...