java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-lit/cggmp2005_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 22:13:35,904 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 22:13:35,910 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 22:13:35,928 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 22:13:35,929 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 22:13:35,930 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 22:13:35,931 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 22:13:35,934 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 22:13:35,937 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 22:13:35,937 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 22:13:35,939 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 22:13:35,940 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 22:13:35,940 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 22:13:35,949 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 22:13:35,950 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 22:13:35,951 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 22:13:35,957 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 22:13:35,959 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 22:13:35,962 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 22:13:35,964 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 22:13:35,968 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 22:13:35,969 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 22:13:35,971 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 22:13:35,971 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 22:13:35,973 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 22:13:35,974 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 22:13:35,975 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 22:13:35,975 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 22:13:35,976 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 22:13:35,977 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 22:13:35,977 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 22:13:35,981 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 22:13:35,981 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 22:13:35,982 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 22:13:35,983 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 22:13:35,984 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 22:13:35,984 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 22:13:36,011 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 22:13:36,011 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 22:13:36,012 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 22:13:36,013 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 22:13:36,013 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 22:13:36,013 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 22:13:36,013 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 22:13:36,013 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 22:13:36,014 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 22:13:36,014 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 22:13:36,014 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 22:13:36,014 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 22:13:36,014 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 22:13:36,015 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 22:13:36,015 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 22:13:36,015 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 22:13:36,016 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 22:13:36,016 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 22:13:36,016 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 22:13:36,016 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 22:13:36,016 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 22:13:36,017 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 22:13:36,017 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 22:13:36,017 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 22:13:36,017 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 22:13:36,017 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:13:36,018 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 22:13:36,018 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 22:13:36,018 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 22:13:36,018 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 22:13:36,018 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 22:13:36,018 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 22:13:36,019 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 22:13:36,019 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 22:13:36,019 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 22:13:36,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 22:13:36,083 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 22:13:36,088 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 22:13:36,090 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 22:13:36,090 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 22:13:36,091 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005_true-unreach-call_true-termination.c.i [2018-11-07 22:13:36,158 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42bd6679a/1044f6f6cd86417d90f8c5b30a863cc5/FLAG1782f33a8 [2018-11-07 22:13:36,667 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 22:13:36,668 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005_true-unreach-call_true-termination.c.i [2018-11-07 22:13:36,674 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42bd6679a/1044f6f6cd86417d90f8c5b30a863cc5/FLAG1782f33a8 [2018-11-07 22:13:36,689 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42bd6679a/1044f6f6cd86417d90f8c5b30a863cc5 [2018-11-07 22:13:36,700 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 22:13:36,702 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 22:13:36,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 22:13:36,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 22:13:36,706 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 22:13:36,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:13:36" (1/1) ... [2018-11-07 22:13:36,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e890a5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:36, skipping insertion in model container [2018-11-07 22:13:36,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:13:36" (1/1) ... [2018-11-07 22:13:36,718 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 22:13:36,739 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 22:13:36,927 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:13:36,931 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 22:13:36,948 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:13:36,963 INFO L193 MainTranslator]: Completed translation [2018-11-07 22:13:36,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:36 WrapperNode [2018-11-07 22:13:36,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 22:13:36,965 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 22:13:36,965 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 22:13:36,965 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 22:13:36,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:36" (1/1) ... [2018-11-07 22:13:36,980 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:36" (1/1) ... [2018-11-07 22:13:36,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 22:13:36,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 22:13:36,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 22:13:36,988 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 22:13:37,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:36" (1/1) ... [2018-11-07 22:13:37,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:36" (1/1) ... [2018-11-07 22:13:37,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:36" (1/1) ... [2018-11-07 22:13:37,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:36" (1/1) ... [2018-11-07 22:13:37,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:36" (1/1) ... [2018-11-07 22:13:37,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:36" (1/1) ... [2018-11-07 22:13:37,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:36" (1/1) ... [2018-11-07 22:13:37,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 22:13:37,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 22:13:37,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 22:13:37,019 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 22:13:37,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:13:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 22:13:37,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 22:13:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 22:13:37,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 22:13:37,141 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 22:13:37,141 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 22:13:37,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 22:13:37,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 22:13:37,321 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 22:13:37,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:13:37 BoogieIcfgContainer [2018-11-07 22:13:37,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 22:13:37,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 22:13:37,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 22:13:37,326 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 22:13:37,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:13:36" (1/3) ... [2018-11-07 22:13:37,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d047e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:13:37, skipping insertion in model container [2018-11-07 22:13:37,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:36" (2/3) ... [2018-11-07 22:13:37,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d047e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:13:37, skipping insertion in model container [2018-11-07 22:13:37,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:13:37" (3/3) ... [2018-11-07 22:13:37,329 INFO L112 eAbstractionObserver]: Analyzing ICFG cggmp2005_true-unreach-call_true-termination.c.i [2018-11-07 22:13:37,338 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 22:13:37,345 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 22:13:37,359 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 22:13:37,390 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 22:13:37,390 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 22:13:37,390 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 22:13:37,391 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 22:13:37,391 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 22:13:37,391 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 22:13:37,391 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 22:13:37,391 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 22:13:37,411 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-07 22:13:37,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 22:13:37,417 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:37,418 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:37,421 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:37,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:37,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1871509567, now seen corresponding path program 1 times [2018-11-07 22:13:37,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:37,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:37,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:37,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:37,481 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:37,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:37,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:13:37,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 22:13:37,536 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:13:37,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 22:13:37,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 22:13:37,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 22:13:37,554 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-07 22:13:37,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:37,576 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-07 22:13:37,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 22:13:37,577 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 22:13:37,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:37,587 INFO L225 Difference]: With dead ends: 31 [2018-11-07 22:13:37,587 INFO L226 Difference]: Without dead ends: 12 [2018-11-07 22:13:37,591 INFO L604 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-11-07 22:13:37,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-07 22:13:37,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-07 22:13:37,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-07 22:13:37,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-07 22:13:37,631 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-07 22:13:37,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:37,632 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-07 22:13:37,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 22:13:37,632 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-07 22:13:37,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 22:13:37,633 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:37,633 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:37,633 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:37,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:37,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1861991801, now seen corresponding path program 1 times [2018-11-07 22:13:37,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:37,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:37,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:37,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:37,636 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:37,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:37,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:13:37,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 22:13:37,728 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:13:37,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 22:13:37,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 22:13:37,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:13:37,732 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-07 22:13:37,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:37,843 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-07 22:13:37,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 22:13:37,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-07 22:13:37,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:37,857 INFO L225 Difference]: With dead ends: 19 [2018-11-07 22:13:37,857 INFO L226 Difference]: Without dead ends: 14 [2018-11-07 22:13:37,858 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:13:37,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-07 22:13:37,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-07 22:13:37,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-07 22:13:37,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-07 22:13:37,863 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-07 22:13:37,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:37,863 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-07 22:13:37,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 22:13:37,864 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-07 22:13:37,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-07 22:13:37,864 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:37,868 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:37,868 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:37,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:37,869 INFO L82 PathProgramCache]: Analyzing trace with hash -661808769, now seen corresponding path program 1 times [2018-11-07 22:13:37,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:37,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:37,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:37,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:37,870 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:38,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:38,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:38,028 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:38,029 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-11-07 22:13:38,031 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [21], [24], [26], [32], [33], [34], [36] [2018-11-07 22:13:38,064 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:13:38,064 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:13:38,259 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:13:38,260 INFO L272 AbstractInterpreter]: Visited 12 different actions 45 times. Merged at 3 different actions 17 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2018-11-07 22:13:38,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:38,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:13:38,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:38,300 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:13:38,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:38,314 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:13:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:38,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:38,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:38,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:38,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:38,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:38,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2018-11-07 22:13:38,591 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:38,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:13:38,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:13:38,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-11-07 22:13:38,593 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 6 states. [2018-11-07 22:13:38,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:38,632 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-07 22:13:38,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 22:13:38,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-07 22:13:38,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:38,633 INFO L225 Difference]: With dead ends: 21 [2018-11-07 22:13:38,634 INFO L226 Difference]: Without dead ends: 16 [2018-11-07 22:13:38,635 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-11-07 22:13:38,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-07 22:13:38,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-07 22:13:38,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-07 22:13:38,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-07 22:13:38,639 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-11-07 22:13:38,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:38,640 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-07 22:13:38,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:13:38,640 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-07 22:13:38,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 22:13:38,641 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:38,641 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:38,641 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:38,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:38,642 INFO L82 PathProgramCache]: Analyzing trace with hash 622365701, now seen corresponding path program 2 times [2018-11-07 22:13:38,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:38,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:38,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:38,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:38,644 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:38,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:38,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:38,741 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:38,741 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:38,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:13:38,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:38,741 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:13:38,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:13:38,760 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:13:38,800 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 22:13:38,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:38,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:39,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:39,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:39,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:39,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:39,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-07 22:13:39,179 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:39,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 22:13:39,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 22:13:39,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-11-07 22:13:39,181 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 8 states. [2018-11-07 22:13:39,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:39,222 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-07 22:13:39,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 22:13:39,223 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-07 22:13:39,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:39,224 INFO L225 Difference]: With dead ends: 23 [2018-11-07 22:13:39,224 INFO L226 Difference]: Without dead ends: 18 [2018-11-07 22:13:39,225 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-11-07 22:13:39,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-07 22:13:39,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-07 22:13:39,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-07 22:13:39,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-07 22:13:39,230 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-11-07 22:13:39,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:39,230 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-07 22:13:39,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 22:13:39,230 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-07 22:13:39,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 22:13:39,231 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:39,231 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:39,232 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:39,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:39,232 INFO L82 PathProgramCache]: Analyzing trace with hash 2058417419, now seen corresponding path program 3 times [2018-11-07 22:13:39,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:39,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:39,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:39,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:39,233 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:39,324 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:39,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:39,324 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:39,324 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:39,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:13:39,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:39,326 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:13:39,336 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:13:39,336 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:13:39,349 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:13:39,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:39,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:39,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:39,598 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:39,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:39,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-07 22:13:39,620 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:39,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 22:13:39,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 22:13:39,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-11-07 22:13:39,622 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 10 states. [2018-11-07 22:13:39,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:39,648 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-07 22:13:39,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 22:13:39,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-11-07 22:13:39,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:39,650 INFO L225 Difference]: With dead ends: 25 [2018-11-07 22:13:39,650 INFO L226 Difference]: Without dead ends: 20 [2018-11-07 22:13:39,651 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-11-07 22:13:39,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-07 22:13:39,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-07 22:13:39,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-07 22:13:39,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-07 22:13:39,656 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-11-07 22:13:39,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:39,656 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-07 22:13:39,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 22:13:39,657 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-07 22:13:39,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 22:13:39,657 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:39,657 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:39,658 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:39,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:39,658 INFO L82 PathProgramCache]: Analyzing trace with hash -875350895, now seen corresponding path program 4 times [2018-11-07 22:13:39,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:39,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:39,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:39,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:39,660 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:39,868 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:39,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:39,869 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:39,869 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:39,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:13:39,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:39,870 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:13:39,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:39,886 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:13:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:39,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:40,157 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:40,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:40,293 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:40,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:40,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2018-11-07 22:13:40,313 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:40,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 22:13:40,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 22:13:40,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-07 22:13:40,314 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 9 states. [2018-11-07 22:13:40,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:40,405 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-07 22:13:40,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 22:13:40,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-11-07 22:13:40,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:40,406 INFO L225 Difference]: With dead ends: 27 [2018-11-07 22:13:40,407 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 22:13:40,408 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-07 22:13:40,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 22:13:40,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-07 22:13:40,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-07 22:13:40,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-07 22:13:40,413 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-11-07 22:13:40,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:40,413 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-07 22:13:40,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 22:13:40,413 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-07 22:13:40,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 22:13:40,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:40,414 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:40,414 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:40,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:40,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1566812823, now seen corresponding path program 5 times [2018-11-07 22:13:40,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:40,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:40,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:40,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:40,416 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:40,528 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:40,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:13:40,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 22:13:40,529 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:13:40,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 22:13:40,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 22:13:40,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:13:40,530 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 7 states. [2018-11-07 22:13:40,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:40,558 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-07 22:13:40,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:13:40,560 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-07 22:13:40,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:40,561 INFO L225 Difference]: With dead ends: 22 [2018-11-07 22:13:40,561 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 22:13:40,562 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:13:40,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 22:13:40,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 22:13:40,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 22:13:40,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 22:13:40,564 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-07 22:13:40,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:40,564 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 22:13:40,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 22:13:40,564 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 22:13:40,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 22:13:40,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 22:13:40,749 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2018-11-07 22:13:40,786 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-07 22:13:40,786 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 22:13:40,786 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 22:13:40,787 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 22:13:40,787 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 22:13:40,787 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 22:13:40,787 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 20) the Hoare annotation is: true [2018-11-07 22:13:40,787 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 20) no Hoare annotation was computed. [2018-11-07 22:13:40,787 INFO L425 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-11-07 22:13:40,787 INFO L425 ceAbstractionStarter]: For program point L14-1(lines 14 17) no Hoare annotation was computed. [2018-11-07 22:13:40,787 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 20) no Hoare annotation was computed. [2018-11-07 22:13:40,788 INFO L421 ceAbstractionStarter]: At program point L14-3(lines 14 17) the Hoare annotation is: (or (and (<= 8 main_~j~0) (<= main_~j~0 (+ main_~i~0 3)) (<= main_~i~0 5)) (and (<= 6 main_~j~0) (<= (+ main_~j~0 3) main_~i~0) (<= main_~j~0 6)) (and (<= main_~j~0 (+ main_~i~0 9)) (<= main_~i~0 1) (<= 10 main_~j~0)) (and (<= 7 main_~j~0) (<= main_~j~0 main_~i~0) (<= main_~i~0 7)) (and (<= main_~i~0 3) (<= main_~j~0 (+ main_~i~0 6)) (<= 9 main_~j~0))) [2018-11-07 22:13:40,788 INFO L421 ceAbstractionStarter]: At program point L14-4(lines 14 17) the Hoare annotation is: (and (<= 6 main_~j~0) (<= main_~j~0 6)) [2018-11-07 22:13:40,788 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-07 22:13:40,788 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-07 22:13:40,788 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-07 22:13:40,788 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-07 22:13:40,788 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-07 22:13:40,788 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-07 22:13:40,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:13:40 BoogieIcfgContainer [2018-11-07 22:13:40,802 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 22:13:40,803 INFO L168 Benchmark]: Toolchain (without parser) took 4101.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.3 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -590.0 MB). Peak memory consumption was 139.2 MB. Max. memory is 7.1 GB. [2018-11-07 22:13:40,804 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:13:40,805 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.52 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-11-07 22:13:40,806 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.33 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-11-07 22:13:40,806 INFO L168 Benchmark]: Boogie Preprocessor took 31.02 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-11-07 22:13:40,807 INFO L168 Benchmark]: RCFGBuilder took 302.93 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -782.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-07 22:13:40,808 INFO L168 Benchmark]: TraceAbstraction took 3479.83 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 182.1 MB). Peak memory consumption was 182.1 MB. Max. memory is 7.1 GB. [2018-11-07 22:13:40,813 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.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 261.52 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 22.33 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 31.02 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 302.93 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -782.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3479.83 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 182.1 MB). Peak memory consumption was 182.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (((((8 <= j && j <= i + 3) && i <= 5) || ((6 <= j && j + 3 <= i) && j <= 6)) || ((j <= i + 9 && i <= 1) && 10 <= j)) || ((7 <= j && j <= i) && i <= 7)) || ((i <= 3 && j <= i + 6) && 9 <= j) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 3.4s OverallTime, 7 OverallIterations, 6 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 86 SDtfs, 1 SDslu, 226 SDs, 0 SdLazy, 100 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 116 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 13 PreInvPairs, 19 NumberOfFragments, 71 HoareAnnotationTreeSize, 13 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 17 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 219 ConstructedInterpolants, 0 QuantifiedInterpolants, 11365 SizeOfPredicates, 8 NumberOfNonLiveVariables, 160 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 30/150 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...