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.epf -i ../../../trunk/examples/svcomp/loop-invgen/nested9_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 16:43:50,872 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 16:43:50,874 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 16:43:50,886 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 16:43:50,886 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 16:43:50,887 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 16:43:50,889 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 16:43:50,891 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 16:43:50,893 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 16:43:50,894 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 16:43:50,895 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 16:43:50,895 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 16:43:50,896 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 16:43:50,897 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 16:43:50,898 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 16:43:50,899 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 16:43:50,900 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 16:43:50,902 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 16:43:50,904 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 16:43:50,906 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 16:43:50,907 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 16:43:50,908 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 16:43:50,911 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 16:43:50,911 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 16:43:50,912 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 16:43:50,913 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 16:43:50,914 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 16:43:50,915 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 16:43:50,915 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 16:43:50,917 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 16:43:50,917 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 16:43:50,918 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 16:43:50,918 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 16:43:50,918 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 16:43:50,920 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 16:43:50,920 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 16:43:50,921 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.epf [2018-11-07 16:43:50,936 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 16:43:50,937 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 16:43:50,938 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 16:43:50,938 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 16:43:50,938 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 16:43:50,938 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 16:43:50,939 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 16:43:50,939 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 16:43:50,939 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 16:43:50,939 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 16:43:50,940 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 16:43:50,940 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 16:43:50,941 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 16:43:50,941 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 16:43:50,941 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 16:43:50,941 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 16:43:50,942 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 16:43:50,942 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 16:43:50,942 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 16:43:50,942 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 16:43:50,942 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 16:43:50,943 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 16:43:50,943 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 16:43:50,943 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 16:43:50,943 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:43:50,943 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 16:43:50,944 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 16:43:50,944 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 16:43:50,944 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 16:43:50,944 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 16:43:50,944 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 16:43:50,945 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 16:43:50,945 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 16:43:50,945 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 16:43:50,986 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 16:43:51,003 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 16:43:51,007 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 16:43:51,008 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 16:43:51,008 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 16:43:51,009 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested9_true-unreach-call_true-termination.i [2018-11-07 16:43:51,068 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4db39899c/ab58dc41fa5d479eb9ef5dc1f43ea99a/FLAGc311d7076 [2018-11-07 16:43:51,484 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 16:43:51,485 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested9_true-unreach-call_true-termination.i [2018-11-07 16:43:51,491 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4db39899c/ab58dc41fa5d479eb9ef5dc1f43ea99a/FLAGc311d7076 [2018-11-07 16:43:51,506 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4db39899c/ab58dc41fa5d479eb9ef5dc1f43ea99a [2018-11-07 16:43:51,517 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 16:43:51,518 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 16:43:51,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 16:43:51,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 16:43:51,523 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 16:43:51,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:43:51" (1/1) ... [2018-11-07 16:43:51,526 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@534f45d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:51, skipping insertion in model container [2018-11-07 16:43:51,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:43:51" (1/1) ... [2018-11-07 16:43:51,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 16:43:51,563 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 16:43:51,804 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:43:51,808 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 16:43:51,827 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:43:51,842 INFO L193 MainTranslator]: Completed translation [2018-11-07 16:43:51,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:51 WrapperNode [2018-11-07 16:43:51,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 16:43:51,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 16:43:51,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 16:43:51,844 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 16:43:51,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:51" (1/1) ... [2018-11-07 16:43:51,858 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:51" (1/1) ... [2018-11-07 16:43:51,863 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 16:43:51,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 16:43:51,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 16:43:51,864 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 16:43:51,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:51" (1/1) ... [2018-11-07 16:43:51,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:51" (1/1) ... [2018-11-07 16:43:51,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:51" (1/1) ... [2018-11-07 16:43:51,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:51" (1/1) ... [2018-11-07 16:43:51,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:51" (1/1) ... [2018-11-07 16:43:51,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:51" (1/1) ... [2018-11-07 16:43:51,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:51" (1/1) ... [2018-11-07 16:43:51,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 16:43:51,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 16:43:51,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 16:43:51,885 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 16:43:51,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:51" (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 16:43:52,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 16:43:52,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 16:43:52,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 16:43:52,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 16:43:52,019 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 16:43:52,019 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 16:43:52,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 16:43:52,019 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 16:43:52,449 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 16:43:52,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:43:52 BoogieIcfgContainer [2018-11-07 16:43:52,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 16:43:52,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 16:43:52,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 16:43:52,454 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 16:43:52,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:43:51" (1/3) ... [2018-11-07 16:43:52,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cab956d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:43:52, skipping insertion in model container [2018-11-07 16:43:52,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:51" (2/3) ... [2018-11-07 16:43:52,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cab956d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:43:52, skipping insertion in model container [2018-11-07 16:43:52,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:43:52" (3/3) ... [2018-11-07 16:43:52,457 INFO L112 eAbstractionObserver]: Analyzing ICFG nested9_true-unreach-call_true-termination.i [2018-11-07 16:43:52,467 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 16:43:52,475 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 16:43:52,492 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 16:43:52,528 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 16:43:52,528 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 16:43:52,529 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 16:43:52,529 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 16:43:52,529 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 16:43:52,529 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 16:43:52,529 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 16:43:52,529 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 16:43:52,554 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-07 16:43:52,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 16:43:52,561 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:52,562 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] [2018-11-07 16:43:52,567 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:52,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:52,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1899131806, now seen corresponding path program 1 times [2018-11-07 16:43:52,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:52,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:52,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:52,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:52,621 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:52,765 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 16:43:52,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:43:52,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 16:43:52,769 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:43:52,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 16:43:52,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 16:43:52,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 16:43:52,793 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 4 states. [2018-11-07 16:43:53,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:53,131 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2018-11-07 16:43:53,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 16:43:53,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-07 16:43:53,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:53,141 INFO L225 Difference]: With dead ends: 61 [2018-11-07 16:43:53,141 INFO L226 Difference]: Without dead ends: 32 [2018-11-07 16:43:53,144 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 16:43:53,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-07 16:43:53,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-07 16:43:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-07 16:43:53,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-07 16:43:53,180 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 21 [2018-11-07 16:43:53,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:53,181 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-07 16:43:53,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 16:43:53,181 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-07 16:43:53,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-07 16:43:53,182 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:53,183 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:53,184 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:53,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:53,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1651874812, now seen corresponding path program 1 times [2018-11-07 16:43:53,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:53,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:53,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:53,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:53,186 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:53,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:43:53,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:53,461 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:53,461 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-11-07 16:43:53,463 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [17], [20], [24], [28], [33], [37], [40], [42], [46], [51], [62], [68], [71], [73], [79], [80], [81], [83] [2018-11-07 16:43:53,498 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:43:53,499 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:43:53,646 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:43:53,648 INFO L272 AbstractInterpreter]: Visited 23 different actions 28 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 12 variables. [2018-11-07 16:43:53,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:53,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:43:53,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:53,657 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 16:43:53,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:53,669 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:43:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:53,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:53,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:43:53,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:54,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:43:54,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-07 16:43:54,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 16 [2018-11-07 16:43:54,491 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:43:54,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 16:43:54,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 16:43:54,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:43:54,493 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 8 states. [2018-11-07 16:43:54,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:54,721 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-07 16:43:54,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 16:43:54,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-07 16:43:54,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:54,724 INFO L225 Difference]: With dead ends: 46 [2018-11-07 16:43:54,724 INFO L226 Difference]: Without dead ends: 44 [2018-11-07 16:43:54,726 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-11-07 16:43:54,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-07 16:43:54,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2018-11-07 16:43:54,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-07 16:43:54,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-11-07 16:43:54,734 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 26 [2018-11-07 16:43:54,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:54,735 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-11-07 16:43:54,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 16:43:54,735 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-11-07 16:43:54,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-07 16:43:54,737 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:54,737 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:54,737 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:54,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:54,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1162553418, now seen corresponding path program 1 times [2018-11-07 16:43:54,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:54,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:54,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:54,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:54,740 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:54,994 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:43:54,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:54,994 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:54,995 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-11-07 16:43:54,995 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [17], [20], [24], [28], [33], [37], [40], [42], [46], [51], [54], [62], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84] [2018-11-07 16:43:54,999 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:43:54,999 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:43:55,129 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:43:55,129 INFO L272 AbstractInterpreter]: Visited 27 different actions 34 times. Merged at 6 different actions 6 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 13 variables. [2018-11-07 16:43:55,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:55,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:43:55,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:55,171 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 16:43:55,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:55,189 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:43:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:55,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:55,350 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:43:55,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:55,449 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:43:55,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:43:55,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2018-11-07 16:43:55,476 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:43:55,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 16:43:55,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 16:43:55,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:43:55,478 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 10 states. [2018-11-07 16:43:55,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:55,877 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2018-11-07 16:43:55,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 16:43:55,878 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-11-07 16:43:55,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:55,881 INFO L225 Difference]: With dead ends: 82 [2018-11-07 16:43:55,881 INFO L226 Difference]: Without dead ends: 59 [2018-11-07 16:43:55,882 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-11-07 16:43:55,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-07 16:43:55,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2018-11-07 16:43:55,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-07 16:43:55,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-11-07 16:43:55,897 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 34 [2018-11-07 16:43:55,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:55,897 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-11-07 16:43:55,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 16:43:55,898 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-07 16:43:55,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-07 16:43:55,900 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:55,900 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:55,901 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:55,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:55,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1325122332, now seen corresponding path program 1 times [2018-11-07 16:43:55,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:55,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:55,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:55,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:55,903 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:56,005 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 16:43:56,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:56,006 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:56,006 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-11-07 16:43:56,006 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [17], [20], [24], [28], [33], [37], [40], [42], [46], [49], [51], [54], [58], [62], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84] [2018-11-07 16:43:56,009 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:43:56,009 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:43:56,323 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:43:56,323 INFO L272 AbstractInterpreter]: Visited 29 different actions 187 times. Merged at 12 different actions 91 times. Widened at 5 different actions 17 times. Found 20 fixpoints after 6 different actions. Largest state had 14 variables. [2018-11-07 16:43:56,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:56,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:43:56,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:56,347 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 16:43:56,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:56,358 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:43:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:56,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:56,601 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 16:43:56,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:56,657 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 16:43:56,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-07 16:43:56,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 11 [2018-11-07 16:43:56,678 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:43:56,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:43:56,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:43:56,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-07 16:43:56,679 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 6 states. [2018-11-07 16:43:56,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:56,799 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2018-11-07 16:43:56,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 16:43:56,800 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-07 16:43:56,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:56,801 INFO L225 Difference]: With dead ends: 86 [2018-11-07 16:43:56,802 INFO L226 Difference]: Without dead ends: 54 [2018-11-07 16:43:56,803 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:43:56,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-07 16:43:56,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-07 16:43:56,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-07 16:43:56,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-11-07 16:43:56,813 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 44 [2018-11-07 16:43:56,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:56,813 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-07 16:43:56,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:43:56,814 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-11-07 16:43:56,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-07 16:43:56,815 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:56,815 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:56,815 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:56,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:56,816 INFO L82 PathProgramCache]: Analyzing trace with hash -908739042, now seen corresponding path program 2 times [2018-11-07 16:43:56,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:56,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:56,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:56,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:56,818 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:57,019 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 16:43:57,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:57,020 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:57,020 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:43:57,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:43:57,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:57,021 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 16:43:57,034 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:43:57,034 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:43:57,055 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-07 16:43:57,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:43:57,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:57,199 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 16:43:57,200 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:57,293 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 16:43:57,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:43:57,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 19 [2018-11-07 16:43:57,313 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:43:57,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 16:43:57,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 16:43:57,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-11-07 16:43:57,316 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 16 states. [2018-11-07 16:43:58,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:58,348 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2018-11-07 16:43:58,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 16:43:58,348 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-11-07 16:43:58,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:58,350 INFO L225 Difference]: With dead ends: 105 [2018-11-07 16:43:58,350 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 16:43:58,352 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 16:43:58,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 16:43:58,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 16:43:58,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 16:43:58,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 16:43:58,353 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2018-11-07 16:43:58,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:58,354 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 16:43:58,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 16:43:58,354 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 16:43:58,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 16:43:58,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 16:43:58,557 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-11-07 16:43:58,728 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2018-11-07 16:43:59,006 WARN L179 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2018-11-07 16:43:59,037 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 16:43:59,038 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-07 16:43:59,038 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 16:43:59,038 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 16:43:59,038 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 16:43:59,039 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 16:43:59,039 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 16:43:59,039 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 11 26) no Hoare annotation was computed. [2018-11-07 16:43:59,039 INFO L421 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (let ((.cse2 (* 3 main_~i~0))) (let ((.cse0 (< main_~i~0 main_~n~0)) (.cse1 (<= (+ main_~k~0 2) .cse2))) (or (and (exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= main_~i~0 main_~k~0))) .cse0 (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~i~0))) (<= main_~i~0 1) .cse1) (and (<= 2 main_~i~0) (< main_~j~0 .cse2) .cse0 (<= (* 2 main_~i~0) main_~j~0) .cse1)))) [2018-11-07 16:43:59,039 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 22 23) no Hoare annotation was computed. [2018-11-07 16:43:59,040 INFO L425 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-07 16:43:59,040 INFO L425 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2018-11-07 16:43:59,040 INFO L428 ceAbstractionStarter]: At program point L24(lines 11 26) the Hoare annotation is: true [2018-11-07 16:43:59,040 INFO L425 ceAbstractionStarter]: For program point L20-1(lines 20 23) no Hoare annotation was computed. [2018-11-07 16:43:59,040 INFO L425 ceAbstractionStarter]: For program point L20-3(lines 20 23) no Hoare annotation was computed. [2018-11-07 16:43:59,040 INFO L425 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-11-07 16:43:59,040 INFO L421 ceAbstractionStarter]: At program point L20-4(lines 20 23) the Hoare annotation is: (or (and (<= 1 main_~i~0) (<= main_~j~0 (* 2 main_~i~0))) (<= 2 main_~i~0) (and (<= 0 main_~i~0) (<= main_~i~0 0))) [2018-11-07 16:43:59,040 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 21 23) no Hoare annotation was computed. [2018-11-07 16:43:59,040 INFO L425 ceAbstractionStarter]: For program point L21-3(lines 21 23) no Hoare annotation was computed. [2018-11-07 16:43:59,041 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-07 16:43:59,041 INFO L421 ceAbstractionStarter]: At program point L21-4(lines 21 23) the Hoare annotation is: (let ((.cse4 (* 2 main_~i~0))) (let ((.cse0 (<= 1 main_~i~0)) (.cse3 (<= main_~j~0 .cse4)) (.cse1 (< main_~i~0 main_~n~0)) (.cse2 (<= .cse4 main_~j~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= main_~j~0 (+ main_~k~0 1)) .cse2) (and (<= (* 3 main_~i~0) main_~j~0) (<= 0 main_~i~0) .cse1 .cse3) (and (<= 2 main_~i~0) .cse1 .cse2)))) [2018-11-07 16:43:59,041 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 11 26) no Hoare annotation was computed. [2018-11-07 16:43:59,041 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 11 26) the Hoare annotation is: true [2018-11-07 16:43:59,041 INFO L425 ceAbstractionStarter]: For program point L22-1(lines 22 23) no Hoare annotation was computed. [2018-11-07 16:43:59,041 INFO L421 ceAbstractionStarter]: At program point L22-3(lines 22 23) the Hoare annotation is: (let ((.cse1 (* 3 main_~i~0)) (.cse0 (< main_~i~0 main_~n~0)) (.cse2 (<= (* 2 main_~i~0) main_~j~0))) (or (and (exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= main_~i~0 main_~k~0))) .cse0 (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~i~0))) (<= main_~i~0 1) (<= (+ main_~k~0 2) .cse1)) (and (<= 2 main_~i~0) (< main_~j~0 .cse1) .cse0 .cse2) (and (<= 1 main_~i~0) (exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= (+ main_~i~0 1) main_~k~0))) .cse0 .cse2))) [2018-11-07 16:43:59,042 INFO L425 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-11-07 16:43:59,042 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-07 16:43:59,042 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-07 16:43:59,042 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-07 16:43:59,042 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-07 16:43:59,042 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-07 16:43:59,042 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-07 16:43:59,053 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,054 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,055 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,055 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,055 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,055 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,055 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,056 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,056 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,057 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,057 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,057 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,057 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,058 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,058 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,058 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,059 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,059 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:43:59 BoogieIcfgContainer [2018-11-07 16:43:59,062 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 16:43:59,063 INFO L168 Benchmark]: Toolchain (without parser) took 7545.27 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -361.1 MB). Peak memory consumption was 386.0 MB. Max. memory is 7.1 GB. [2018-11-07 16:43:59,064 INFO L168 Benchmark]: CDTParser took 0.15 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 16:43:59,065 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.50 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 16:43:59,066 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.96 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 16:43:59,066 INFO L168 Benchmark]: Boogie Preprocessor took 20.99 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 16:43:59,067 INFO L168 Benchmark]: RCFGBuilder took 564.55 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.1 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-07 16:43:59,068 INFO L168 Benchmark]: TraceAbstraction took 6611.39 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 412.4 MB). Peak memory consumption was 412.4 MB. Max. memory is 7.1 GB. [2018-11-07 16:43:59,073 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.15 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 323.50 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 19.96 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 20.99 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 564.55 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.1 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6611.39 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 412.4 MB). Peak memory consumption was 412.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] * 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: 21]: Loop Invariant Derived loop invariant: (((((1 <= i && i < n) && 2 * i <= j) && j <= 2 * i) || (((1 <= i && i < n) && j <= k + 1) && 2 * i <= j)) || (((3 * i <= j && 0 <= i) && i < n) && j <= 2 * i)) || ((2 <= i && i < n) && 2 * i <= j) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant [2018-11-07 16:43:59,084 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,084 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,085 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,085 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,085 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,085 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,086 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,086 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,086 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,087 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,087 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,087 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,087 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,087 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,088 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,088 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,088 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 16:43:59,088 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] Derived loop invariant: ((((((\exists main_~i~0 : int :: (j <= 2 * main_~i~0 && main_~i~0 <= 1) && main_~i~0 <= k) && i < n) && (\exists main_~i~0 : int :: (1 <= main_~i~0 && 2 * main_~i~0 <= j) && k <= main_~i~0)) && i <= 1) && k + 2 <= 3 * i) || (((2 <= i && j < 3 * i) && i < n) && 2 * i <= j)) || (((1 <= i && (\exists main_~i~0 : int :: (j <= 2 * main_~i~0 && main_~i~0 <= 1) && main_~i~0 + 1 <= k)) && i < n) && 2 * i <= j) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((1 <= i && j <= 2 * i) || 2 <= i) || (0 <= i && i <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 1 error locations. SAFE Result, 6.5s OverallTime, 5 OverallIterations, 4 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 136 SDtfs, 131 SDslu, 548 SDs, 0 SdLazy, 499 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 370 GetRequests, 289 SyntacticMatches, 8 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 22 PreInvPairs, 45 NumberOfFragments, 240 HoareAnnotationTreeSize, 22 FomulaSimplifications, 503 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 85 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 333 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 476 ConstructedInterpolants, 15 QuantifiedInterpolants, 49236 SizeOfPredicates, 16 NumberOfNonLiveVariables, 282 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 204/252 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...