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/eca-rers2012/Problem10_label53_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 18:34:06,128 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 18:34:06,134 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 18:34:06,157 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 18:34:06,157 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 18:34:06,159 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 18:34:06,160 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 18:34:06,165 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 18:34:06,167 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 18:34:06,168 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 18:34:06,169 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 18:34:06,169 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 18:34:06,170 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 18:34:06,171 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 18:34:06,172 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 18:34:06,173 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 18:34:06,174 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 18:34:06,176 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 18:34:06,178 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 18:34:06,180 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 18:34:06,181 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 18:34:06,182 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 18:34:06,185 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 18:34:06,185 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 18:34:06,185 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 18:34:06,186 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 18:34:06,187 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 18:34:06,188 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 18:34:06,189 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 18:34:06,190 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 18:34:06,191 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 18:34:06,191 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 18:34:06,191 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 18:34:06,192 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 18:34:06,193 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 18:34:06,193 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 18:34:06,194 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-12 18:34:06,209 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 18:34:06,210 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 18:34:06,211 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 18:34:06,211 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 18:34:06,211 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 18:34:06,211 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 18:34:06,211 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 18:34:06,212 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 18:34:06,212 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 18:34:06,212 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 18:34:06,212 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 18:34:06,212 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 18:34:06,213 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 18:34:06,213 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 18:34:06,213 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 18:34:06,214 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 18:34:06,214 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 18:34:06,214 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 18:34:06,214 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 18:34:06,215 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 18:34:06,215 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 18:34:06,215 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 18:34:06,215 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 18:34:06,216 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 18:34:06,216 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 18:34:06,216 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 18:34:06,216 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 18:34:06,216 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 18:34:06,217 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 18:34:06,217 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 18:34:06,217 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 18:34:06,217 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 18:34:06,217 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 18:34:06,218 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 18:34:06,218 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 18:34:06,278 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 18:34:06,295 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 18:34:06,300 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 18:34:06,302 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 18:34:06,303 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 18:34:06,303 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label53_true-unreach-call.c [2018-11-12 18:34:06,374 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dcc6a275/7da8b0b71bc84962ba91127cfc25ab66/FLAG9ace481ee [2018-11-12 18:34:06,937 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 18:34:06,939 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label53_true-unreach-call.c [2018-11-12 18:34:06,956 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dcc6a275/7da8b0b71bc84962ba91127cfc25ab66/FLAG9ace481ee [2018-11-12 18:34:06,972 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dcc6a275/7da8b0b71bc84962ba91127cfc25ab66 [2018-11-12 18:34:06,984 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 18:34:06,986 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 18:34:06,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 18:34:06,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 18:34:06,991 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 18:34:06,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:34:06" (1/1) ... [2018-11-12 18:34:06,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@614e8287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:34:06, skipping insertion in model container [2018-11-12 18:34:06,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:34:06" (1/1) ... [2018-11-12 18:34:07,007 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 18:34:07,082 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 18:34:07,569 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 18:34:07,576 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 18:34:07,720 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 18:34:07,741 INFO L193 MainTranslator]: Completed translation [2018-11-12 18:34:07,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:34:07 WrapperNode [2018-11-12 18:34:07,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 18:34:07,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 18:34:07,744 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 18:34:07,744 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 18:34:07,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:34:07" (1/1) ... [2018-11-12 18:34:07,772 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:34:07" (1/1) ... [2018-11-12 18:34:07,784 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 18:34:07,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 18:34:07,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 18:34:07,785 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 18:34:07,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:34:07" (1/1) ... [2018-11-12 18:34:07,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:34:07" (1/1) ... [2018-11-12 18:34:07,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:34:07" (1/1) ... [2018-11-12 18:34:07,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:34:07" (1/1) ... [2018-11-12 18:34:07,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:34:07" (1/1) ... [2018-11-12 18:34:07,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:34:07" (1/1) ... [2018-11-12 18:34:07,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:34:07" (1/1) ... [2018-11-12 18:34:08,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 18:34:08,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 18:34:08,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 18:34:08,007 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 18:34:08,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:34:07" (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-12 18:34:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 18:34:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 18:34:08,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 18:34:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 18:34:08,078 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 18:34:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 18:34:08,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 18:34:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 18:34:08,079 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 18:34:11,448 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 18:34:11,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:34:11 BoogieIcfgContainer [2018-11-12 18:34:11,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 18:34:11,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 18:34:11,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 18:34:11,454 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 18:34:11,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:34:06" (1/3) ... [2018-11-12 18:34:11,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a69596d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:34:11, skipping insertion in model container [2018-11-12 18:34:11,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:34:07" (2/3) ... [2018-11-12 18:34:11,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a69596d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:34:11, skipping insertion in model container [2018-11-12 18:34:11,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:34:11" (3/3) ... [2018-11-12 18:34:11,458 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label53_true-unreach-call.c [2018-11-12 18:34:11,469 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 18:34:11,478 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 18:34:11,498 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 18:34:11,538 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 18:34:11,538 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 18:34:11,538 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 18:34:11,539 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 18:34:11,539 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 18:34:11,539 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 18:34:11,539 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 18:34:11,540 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 18:34:11,567 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-11-12 18:34:11,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-12 18:34:11,579 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:34:11,580 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:34:11,583 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:34:11,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:11,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1566545735, now seen corresponding path program 1 times [2018-11-12 18:34:11,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:34:11,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:11,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:34:11,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:11,650 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:34:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:34:12,070 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-11-12 18:34:12,089 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-12 18:34:12,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:34:12,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 18:34:12,092 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:34:12,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 18:34:12,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 18:34:12,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 18:34:12,118 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 4 states. [2018-11-12 18:34:14,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:34:14,687 INFO L93 Difference]: Finished difference Result 737 states and 1298 transitions. [2018-11-12 18:34:14,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 18:34:14,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-12 18:34:14,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:34:14,709 INFO L225 Difference]: With dead ends: 737 [2018-11-12 18:34:14,709 INFO L226 Difference]: Without dead ends: 515 [2018-11-12 18:34:14,717 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 18:34:14,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-11-12 18:34:14,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 356. [2018-11-12 18:34:14,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-12 18:34:14,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 579 transitions. [2018-11-12 18:34:14,797 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 579 transitions. Word has length 49 [2018-11-12 18:34:14,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:34:14,797 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 579 transitions. [2018-11-12 18:34:14,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 18:34:14,798 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 579 transitions. [2018-11-12 18:34:14,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-12 18:34:14,805 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:34:14,806 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:34:14,806 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:34:14,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:14,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1784083955, now seen corresponding path program 1 times [2018-11-12 18:34:14,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:34:14,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:14,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:34:14,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:14,809 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:34:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:34:15,102 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:34:15,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:34:15,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 18:34:15,103 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:34:15,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 18:34:15,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 18:34:15,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 18:34:15,106 INFO L87 Difference]: Start difference. First operand 356 states and 579 transitions. Second operand 6 states. [2018-11-12 18:34:18,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:34:18,010 INFO L93 Difference]: Finished difference Result 1259 states and 2162 transitions. [2018-11-12 18:34:18,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 18:34:18,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2018-11-12 18:34:18,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:34:18,020 INFO L225 Difference]: With dead ends: 1259 [2018-11-12 18:34:18,021 INFO L226 Difference]: Without dead ends: 909 [2018-11-12 18:34:18,025 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 18:34:18,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2018-11-12 18:34:18,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 895. [2018-11-12 18:34:18,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-11-12 18:34:18,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1370 transitions. [2018-11-12 18:34:18,124 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1370 transitions. Word has length 124 [2018-11-12 18:34:18,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:34:18,124 INFO L480 AbstractCegarLoop]: Abstraction has 895 states and 1370 transitions. [2018-11-12 18:34:18,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 18:34:18,125 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1370 transitions. [2018-11-12 18:34:18,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-12 18:34:18,141 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:34:18,141 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:34:18,142 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:34:18,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:18,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1601083443, now seen corresponding path program 1 times [2018-11-12 18:34:18,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:34:18,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:18,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:34:18,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:18,144 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:34:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:34:18,453 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 18:34:18,552 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 18:34:18,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:34:18,553 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:34:18,554 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 157 with the following transitions: [2018-11-12 18:34:18,556 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [293], [295], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [642], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:34:18,613 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:34:18,614 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:34:19,332 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 18:34:19,334 INFO L272 AbstractInterpreter]: Visited 111 different actions 111 times. Never merged. Never widened. Performed 1027 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1027 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Never found a fixpoint. Largest state had 24 variables. [2018-11-12 18:34:19,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:19,357 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 18:34:19,804 INFO L227 lantSequenceWeakener]: Weakened 150 states. On average, predicates are now at 73.48% of their original sizes. [2018-11-12 18:34:19,805 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 18:34:20,174 INFO L415 sIntCurrentIteration]: We unified 155 AI predicates to 155 [2018-11-12 18:34:20,174 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 18:34:20,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:34:20,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2018-11-12 18:34:20,176 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:34:20,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 18:34:20,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 18:34:20,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-12 18:34:20,177 INFO L87 Difference]: Start difference. First operand 895 states and 1370 transitions. Second operand 7 states. [2018-11-12 18:34:22,183 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:34:33,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:34:33,459 INFO L93 Difference]: Finished difference Result 1930 states and 2961 transitions. [2018-11-12 18:34:33,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 18:34:33,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 156 [2018-11-12 18:34:33,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:34:33,470 INFO L225 Difference]: With dead ends: 1930 [2018-11-12 18:34:33,471 INFO L226 Difference]: Without dead ends: 1041 [2018-11-12 18:34:33,474 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 156 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-12 18:34:33,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2018-11-12 18:34:33,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1039. [2018-11-12 18:34:33,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2018-11-12 18:34:33,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1521 transitions. [2018-11-12 18:34:33,517 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1521 transitions. Word has length 156 [2018-11-12 18:34:33,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:34:33,518 INFO L480 AbstractCegarLoop]: Abstraction has 1039 states and 1521 transitions. [2018-11-12 18:34:33,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 18:34:33,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1521 transitions. [2018-11-12 18:34:33,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-12 18:34:33,524 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:34:33,525 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:34:33,525 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:34:33,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:33,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1457972223, now seen corresponding path program 1 times [2018-11-12 18:34:33,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:34:33,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:33,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:34:33,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:33,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:34:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:34:33,904 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 18:34:34,188 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-12 18:34:34,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:34:34,189 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:34:34,189 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 228 with the following transitions: [2018-11-12 18:34:34,189 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [293], [295], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [642], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:34:34,196 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:34:34,197 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:34:34,302 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:34:34,828 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 18:34:34,828 INFO L272 AbstractInterpreter]: Visited 115 different actions 332 times. Merged at 5 different actions 9 times. Never widened. Performed 4840 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4840 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 18:34:34,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:34,867 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 18:34:35,377 INFO L227 lantSequenceWeakener]: Weakened 59 states. On average, predicates are now at 75.77% of their original sizes. [2018-11-12 18:34:35,378 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 18:34:37,047 INFO L415 sIntCurrentIteration]: We unified 226 AI predicates to 226 [2018-11-12 18:34:37,047 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 18:34:37,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:34:37,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [4] total 22 [2018-11-12 18:34:37,048 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:34:37,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-12 18:34:37,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-12 18:34:37,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-11-12 18:34:37,050 INFO L87 Difference]: Start difference. First operand 1039 states and 1521 transitions. Second operand 20 states. [2018-11-12 18:34:58,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:34:58,913 INFO L93 Difference]: Finished difference Result 2384 states and 3595 transitions. [2018-11-12 18:34:58,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-12 18:34:58,914 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 227 [2018-11-12 18:34:58,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:34:58,923 INFO L225 Difference]: With dead ends: 2384 [2018-11-12 18:34:58,923 INFO L226 Difference]: Without dead ends: 1495 [2018-11-12 18:34:58,928 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 244 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=265, Invalid=1141, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 18:34:58,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2018-11-12 18:34:58,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1486. [2018-11-12 18:34:58,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1486 states. [2018-11-12 18:34:58,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 2013 transitions. [2018-11-12 18:34:58,976 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 2013 transitions. Word has length 227 [2018-11-12 18:34:58,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:34:58,976 INFO L480 AbstractCegarLoop]: Abstraction has 1486 states and 2013 transitions. [2018-11-12 18:34:58,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-12 18:34:58,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2013 transitions. [2018-11-12 18:34:58,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-11-12 18:34:58,982 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:34:58,983 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:34:58,983 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:34:58,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:58,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1927539496, now seen corresponding path program 1 times [2018-11-12 18:34:58,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:34:58,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:58,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:34:58,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:58,985 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:34:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:34:59,289 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 18:35:00,194 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 85 proven. 6 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-12 18:35:00,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:35:00,194 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:35:00,195 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 237 with the following transitions: [2018-11-12 18:35:00,195 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [293], [295], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [642], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:35:00,202 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:35:00,204 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:35:00,313 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:35:00,987 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 18:35:00,987 INFO L272 AbstractInterpreter]: Visited 115 different actions 660 times. Merged at 5 different actions 25 times. Widened at 1 different actions 1 times. Performed 8096 root evaluator evaluations with a maximum evaluation depth of 6. Performed 8096 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 18:35:01,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:35:01,025 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 18:35:01,314 INFO L227 lantSequenceWeakener]: Weakened 233 states. On average, predicates are now at 73.27% of their original sizes. [2018-11-12 18:35:01,314 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 18:35:01,414 INFO L415 sIntCurrentIteration]: We unified 235 AI predicates to 235 [2018-11-12 18:35:01,414 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 18:35:01,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:35:01,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2018-11-12 18:35:01,415 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:35:01,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 18:35:01,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 18:35:01,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-12 18:35:01,416 INFO L87 Difference]: Start difference. First operand 1486 states and 2013 transitions. Second operand 10 states. [2018-11-12 18:35:11,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:35:11,474 INFO L93 Difference]: Finished difference Result 3243 states and 4689 transitions. [2018-11-12 18:35:11,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 18:35:11,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 236 [2018-11-12 18:35:11,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:35:11,484 INFO L225 Difference]: With dead ends: 3243 [2018-11-12 18:35:11,484 INFO L226 Difference]: Without dead ends: 2059 [2018-11-12 18:35:11,490 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 243 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-12 18:35:11,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2059 states. [2018-11-12 18:35:11,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2059 to 2047. [2018-11-12 18:35:11,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2047 states. [2018-11-12 18:35:11,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2047 states to 2047 states and 2744 transitions. [2018-11-12 18:35:11,547 INFO L78 Accepts]: Start accepts. Automaton has 2047 states and 2744 transitions. Word has length 236 [2018-11-12 18:35:11,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:35:11,547 INFO L480 AbstractCegarLoop]: Abstraction has 2047 states and 2744 transitions. [2018-11-12 18:35:11,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 18:35:11,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 2744 transitions. [2018-11-12 18:35:11,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-11-12 18:35:11,556 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:35:11,556 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:35:11,557 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:35:11,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:35:11,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1702787296, now seen corresponding path program 1 times [2018-11-12 18:35:11,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:35:11,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:35:11,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:35:11,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:35:11,558 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:35:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:35:12,148 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 18:35:12,396 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-11-12 18:35:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 189 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:35:12,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:35:12,799 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:35:12,799 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 273 with the following transitions: [2018-11-12 18:35:12,799 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [293], [295], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [642], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:35:12,803 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:35:12,803 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:35:12,906 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:35:13,005 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 18:35:13,005 INFO L272 AbstractInterpreter]: Visited 124 different actions 244 times. Merged at 5 different actions 7 times. Never widened. Performed 3607 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3607 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 18:35:13,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:35:13,014 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 18:35:13,390 INFO L227 lantSequenceWeakener]: Weakened 84 states. On average, predicates are now at 76.69% of their original sizes. [2018-11-12 18:35:13,390 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 18:35:13,783 INFO L415 sIntCurrentIteration]: We unified 271 AI predicates to 271 [2018-11-12 18:35:13,783 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 18:35:13,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:35:13,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [12] total 33 [2018-11-12 18:35:13,784 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:35:13,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-12 18:35:13,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-12 18:35:13,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2018-11-12 18:35:13,785 INFO L87 Difference]: Start difference. First operand 2047 states and 2744 transitions. Second operand 23 states. [2018-11-12 18:35:38,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:35:38,472 INFO L93 Difference]: Finished difference Result 5481 states and 7821 transitions. [2018-11-12 18:35:38,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-12 18:35:38,473 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 272 [2018-11-12 18:35:38,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:35:38,491 INFO L225 Difference]: With dead ends: 5481 [2018-11-12 18:35:38,491 INFO L226 Difference]: Without dead ends: 3736 [2018-11-12 18:35:38,501 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 296 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=417, Invalid=1839, Unknown=0, NotChecked=0, Total=2256 [2018-11-12 18:35:38,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3736 states. [2018-11-12 18:35:38,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3736 to 3473. [2018-11-12 18:35:38,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3473 states. [2018-11-12 18:35:38,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3473 states to 3473 states and 4424 transitions. [2018-11-12 18:35:38,599 INFO L78 Accepts]: Start accepts. Automaton has 3473 states and 4424 transitions. Word has length 272 [2018-11-12 18:35:38,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:35:38,600 INFO L480 AbstractCegarLoop]: Abstraction has 3473 states and 4424 transitions. [2018-11-12 18:35:38,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-12 18:35:38,600 INFO L276 IsEmpty]: Start isEmpty. Operand 3473 states and 4424 transitions. [2018-11-12 18:35:38,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-11-12 18:35:38,611 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:35:38,612 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:35:38,612 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:35:38,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:35:38,612 INFO L82 PathProgramCache]: Analyzing trace with hash -886435906, now seen corresponding path program 1 times [2018-11-12 18:35:38,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:35:38,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:35:38,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:35:38,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:35:38,614 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:35:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:35:38,930 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 18:35:39,485 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2018-11-12 18:35:39,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:35:39,486 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:35:39,486 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 304 with the following transitions: [2018-11-12 18:35:39,486 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [293], [295], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [642], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:35:39,489 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:35:39,489 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:35:39,550 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:35:39,860 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 18:35:39,860 INFO L272 AbstractInterpreter]: Visited 116 different actions 451 times. Merged at 7 different actions 20 times. Never widened. Performed 6422 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6422 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 18:35:39,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:35:39,865 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 18:35:40,178 INFO L227 lantSequenceWeakener]: Weakened 59 states. On average, predicates are now at 75.77% of their original sizes. [2018-11-12 18:35:40,178 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 18:35:40,513 INFO L415 sIntCurrentIteration]: We unified 302 AI predicates to 302 [2018-11-12 18:35:40,513 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 18:35:40,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:35:40,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [4] total 22 [2018-11-12 18:35:40,514 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:35:40,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-12 18:35:40,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-12 18:35:40,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-11-12 18:35:40,515 INFO L87 Difference]: Start difference. First operand 3473 states and 4424 transitions. Second operand 20 states. [2018-11-12 18:35:58,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:35:58,164 INFO L93 Difference]: Finished difference Result 7565 states and 9811 transitions. [2018-11-12 18:35:58,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-12 18:35:58,164 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 303 [2018-11-12 18:35:58,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:35:58,186 INFO L225 Difference]: With dead ends: 7565 [2018-11-12 18:35:58,186 INFO L226 Difference]: Without dead ends: 4692 [2018-11-12 18:35:58,195 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 323 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=296, Invalid=1344, Unknown=0, NotChecked=0, Total=1640 [2018-11-12 18:35:58,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4692 states. [2018-11-12 18:35:58,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4692 to 4295. [2018-11-12 18:35:58,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4295 states. [2018-11-12 18:35:58,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4295 states to 4295 states and 5336 transitions. [2018-11-12 18:35:58,323 INFO L78 Accepts]: Start accepts. Automaton has 4295 states and 5336 transitions. Word has length 303 [2018-11-12 18:35:58,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:35:58,324 INFO L480 AbstractCegarLoop]: Abstraction has 4295 states and 5336 transitions. [2018-11-12 18:35:58,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-12 18:35:58,324 INFO L276 IsEmpty]: Start isEmpty. Operand 4295 states and 5336 transitions. [2018-11-12 18:35:58,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-11-12 18:35:58,337 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:35:58,337 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:35:58,338 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:35:58,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:35:58,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1008510968, now seen corresponding path program 1 times [2018-11-12 18:35:58,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:35:58,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:35:58,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:35:58,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:35:58,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:35:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:35:58,719 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-12 18:35:59,119 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 202 proven. 72 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-12 18:35:59,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:35:59,120 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:35:59,120 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 310 with the following transitions: [2018-11-12 18:35:59,120 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [293], [295], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [642], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:35:59,122 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:35:59,123 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:35:59,158 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:35:59,632 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 18:35:59,632 INFO L272 AbstractInterpreter]: Visited 116 different actions 569 times. Merged at 7 different actions 33 times. Widened at 1 different actions 1 times. Performed 6210 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6210 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 5 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-12 18:35:59,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:35:59,638 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 18:36:00,341 INFO L227 lantSequenceWeakener]: Weakened 306 states. On average, predicates are now at 73.17% of their original sizes. [2018-11-12 18:36:00,342 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 18:36:00,424 INFO L415 sIntCurrentIteration]: We unified 308 AI predicates to 308 [2018-11-12 18:36:00,424 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 18:36:00,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:36:00,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2018-11-12 18:36:00,425 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:36:00,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 18:36:00,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 18:36:00,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-12 18:36:00,426 INFO L87 Difference]: Start difference. First operand 4295 states and 5336 transitions. Second operand 10 states. [2018-11-12 18:36:04,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:36:04,956 INFO L93 Difference]: Finished difference Result 9372 states and 12028 transitions. [2018-11-12 18:36:04,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 18:36:04,956 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 309 [2018-11-12 18:36:04,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:36:04,979 INFO L225 Difference]: With dead ends: 9372 [2018-11-12 18:36:04,979 INFO L226 Difference]: Without dead ends: 5975 [2018-11-12 18:36:04,990 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 316 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-12 18:36:04,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2018-11-12 18:36:05,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 5940. [2018-11-12 18:36:05,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5940 states. [2018-11-12 18:36:05,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5940 states to 5940 states and 7364 transitions. [2018-11-12 18:36:05,127 INFO L78 Accepts]: Start accepts. Automaton has 5940 states and 7364 transitions. Word has length 309 [2018-11-12 18:36:05,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:36:05,128 INFO L480 AbstractCegarLoop]: Abstraction has 5940 states and 7364 transitions. [2018-11-12 18:36:05,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 18:36:05,128 INFO L276 IsEmpty]: Start isEmpty. Operand 5940 states and 7364 transitions. [2018-11-12 18:36:05,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-11-12 18:36:05,144 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:36:05,144 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:36:05,144 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:36:05,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:36:05,145 INFO L82 PathProgramCache]: Analyzing trace with hash 719309889, now seen corresponding path program 1 times [2018-11-12 18:36:05,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:36:05,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:36:05,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:36:05,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:36:05,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:36:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:36:05,474 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 18:36:05,699 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 132 proven. 154 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-12 18:36:05,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:36:05,700 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:36:05,700 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 315 with the following transitions: [2018-11-12 18:36:05,700 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [293], [295], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [642], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:36:05,702 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:36:05,702 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:36:05,739 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:36:05,934 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 18:36:05,934 INFO L272 AbstractInterpreter]: Visited 117 different actions 349 times. Merged at 8 different actions 22 times. Never widened. Performed 3676 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3676 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-12 18:36:05,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:36:05,942 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 18:36:05,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:36:05,942 INFO L192 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-12 18:36:05,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:36:05,952 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 18:36:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:36:06,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 18:36:06,450 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 317 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-12 18:36:06,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 18:36:07,175 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 207 proven. 77 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-12 18:36:07,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 18:36:07,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-12 18:36:07,196 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 18:36:07,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 18:36:07,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 18:36:07,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-12 18:36:07,198 INFO L87 Difference]: Start difference. First operand 5940 states and 7364 transitions. Second operand 11 states. [2018-11-12 18:36:12,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:36:12,118 INFO L93 Difference]: Finished difference Result 14560 states and 19376 transitions. [2018-11-12 18:36:12,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-12 18:36:12,118 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 314 [2018-11-12 18:36:12,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:36:12,119 INFO L225 Difference]: With dead ends: 14560 [2018-11-12 18:36:12,119 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 18:36:12,159 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 635 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-11-12 18:36:12,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 18:36:12,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 18:36:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 18:36:12,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 18:36:12,160 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 314 [2018-11-12 18:36:12,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:36:12,161 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 18:36:12,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 18:36:12,161 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 18:36:12,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 18:36:12,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 18:36:12,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:36:12,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:36:12,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:36:12,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:36:12,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:36:12,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:36:12,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:36:12,710 WARN L179 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 266 DAG size of output: 134 [2018-11-12 18:36:12,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:36:12,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:36:12,842 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 118 [2018-11-12 18:36:13,431 WARN L179 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2018-11-12 18:36:13,933 WARN L179 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 47 [2018-11-12 18:36:16,126 WARN L179 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 297 DAG size of output: 136 [2018-11-12 18:36:16,319 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 55 [2018-11-12 18:36:16,498 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 55 [2018-11-12 18:36:16,501 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 18:36:16,501 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a19~0)| ~a19~0) (= |old(~a10~0)| ~a10~0)) [2018-11-12 18:36:16,502 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 18:36:16,502 INFO L425 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-11-12 18:36:16,502 INFO L425 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,502 INFO L425 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,502 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,502 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,503 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,503 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,503 INFO L425 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-11-12 18:36:16,503 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-11-12 18:36:16,503 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-12 18:36:16,503 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-12 18:36:16,503 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-12 18:36:16,503 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-12 18:36:16,503 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-12 18:36:16,504 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-12 18:36:16,504 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-11-12 18:36:16,504 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-11-12 18:36:16,504 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-11-12 18:36:16,504 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,504 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,504 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,504 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,504 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,505 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-11-12 18:36:16,505 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-11-12 18:36:16,505 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-11-12 18:36:16,505 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-11-12 18:36:16,505 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-12 18:36:16,505 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-12 18:36:16,505 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-12 18:36:16,505 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-12 18:36:16,505 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-12 18:36:16,506 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-11-12 18:36:16,506 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-11-12 18:36:16,506 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-11-12 18:36:16,506 INFO L425 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-11-12 18:36:16,506 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-11-12 18:36:16,506 INFO L425 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,506 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,506 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,506 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,507 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,507 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-11-12 18:36:16,507 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-12 18:36:16,507 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-12 18:36:16,507 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-12 18:36:16,507 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-12 18:36:16,507 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-12 18:36:16,507 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-11-12 18:36:16,507 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-11-12 18:36:16,508 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-11-12 18:36:16,508 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-11-12 18:36:16,508 INFO L425 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,508 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,508 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,508 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,508 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,508 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-11-12 18:36:16,508 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-11-12 18:36:16,509 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-11-12 18:36:16,509 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-12 18:36:16,509 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-12 18:36:16,509 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-12 18:36:16,509 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-12 18:36:16,509 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-12 18:36:16,509 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-11-12 18:36:16,509 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-11-12 18:36:16,509 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-11-12 18:36:16,510 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-11-12 18:36:16,510 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-11-12 18:36:16,510 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,510 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,510 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,510 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,510 INFO L425 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,510 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-12 18:36:16,510 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-12 18:36:16,510 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-12 18:36:16,511 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-12 18:36:16,511 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-12 18:36:16,511 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-11-12 18:36:16,511 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-11-12 18:36:16,511 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-11-12 18:36:16,511 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-11-12 18:36:16,511 INFO L425 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,511 INFO L425 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,511 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,512 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,512 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,512 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,512 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,512 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-11-12 18:36:16,512 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-11-12 18:36:16,512 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-11-12 18:36:16,512 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-11-12 18:36:16,513 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-12 18:36:16,513 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-12 18:36:16,513 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-12 18:36:16,513 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-12 18:36:16,513 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-12 18:36:16,513 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-11-12 18:36:16,513 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-11-12 18:36:16,513 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-11-12 18:36:16,513 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-11-12 18:36:16,513 INFO L425 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,514 INFO L425 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,514 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,514 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,514 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-12 18:36:16,514 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,514 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,514 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-11-12 18:36:16,514 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-11-12 18:36:16,514 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-11-12 18:36:16,514 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-12 18:36:16,515 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-12 18:36:16,515 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-12 18:36:16,515 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-12 18:36:16,515 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-12 18:36:16,515 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-12 18:36:16,515 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-11-12 18:36:16,515 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-11-12 18:36:16,515 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-11-12 18:36:16,515 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-11-12 18:36:16,515 INFO L425 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,515 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,516 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,516 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,516 INFO L425 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,516 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,516 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-11-12 18:36:16,516 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-11-12 18:36:16,516 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-11-12 18:36:16,516 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-12 18:36:16,516 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-12 18:36:16,516 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-12 18:36:16,516 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-12 18:36:16,516 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-12 18:36:16,516 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-12 18:36:16,516 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-11-12 18:36:16,516 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-11-12 18:36:16,517 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse8 (not (= 14 ~a4~0))) (.cse19 (< (+ |old(~a1~0)| 600000) 0)) (.cse11 (not (= 0 ~a12~0))) (.cse3 (not (= 9 |old(~a19~0)|)))) (let ((.cse15 (< (+ |old(~a1~0)| 45489) 0)) (.cse0 (= 3 |old(~a10~0)|)) (.cse13 (< 23 |old(~a1~0)|)) (.cse14 (not (= 0 (mod |old(~a10~0)| 2)))) (.cse1 (= |old(~a19~0)| ~a19~0)) (.cse17 (<= ~a1~0 38)) (.cse2 (= |old(~a10~0)| ~a10~0)) (.cse18 (< 38 |old(~a1~0)|)) (.cse16 (and (or .cse8 .cse11 .cse3 (not (= 23 |old(~a1~0)|)) (not (= 0 |old(~a10~0)|))) (or .cse19 (< 0 (+ |old(~a1~0)| 15)) .cse11 .cse3 (not (= 2 |old(~a10~0)|))))) (.cse4 (< 6 |calculate_output_#in~input|)) (.cse6 (< |old(~a1~0)| 23)) (.cse20 (< 8 |old(~a19~0)|)) (.cse7 (< |calculate_output_#in~input| 2)) (.cse5 (and (<= 23 ~a1~0) (<= ~a1~0 2147483647))) (.cse9 (< 2 |old(~a10~0)|)) (.cse21 (< |old(~a19~0)| 7)) (.cse10 (< 2147483647 |old(~a1~0)|)) (.cse12 (< |old(~a10~0)| 0))) (and (or .cse0 (and .cse1 .cse2)) (or (and (<= ~a19~0 |old(~a19~0)|) .cse2 (<= 9 ~a19~0)) .cse3) (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3) (or .cse4 .cse7 .cse8 .cse9 .cse13 (<= 0 (+ ~a1~0 45489)) .cse11 .cse14 .cse12 .cse3 .cse15) (or .cse7 (or (< 0 (+ |old(~a1~0)| 45480)) .cse8) (<= (+ ~a1~0 45480) 0) .cse15 (not (= 4 ~inputD~0)) .cse4 .cse16 (not (= ~inputE~0 5)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (not (= ~inputF~0 6))) (or .cse17 .cse18 .cse3) (or .cse17 .cse0 .cse18) (or .cse4 .cse7 .cse8 (and (<= 0 (+ ~a1~0 600000)) (<= ~a1~0 23)) .cse9 .cse13 .cse19 .cse11 .cse14 .cse12 .cse3) (or (and .cse1 .cse17 .cse2) .cse18 .cse20 (= 8 |old(~a19~0)|)) (or .cse4 .cse6 .cse7 .cse8 (< 10 |old(~a19~0)|) (< 1 |old(~a10~0)|) .cse21 .cse10 .cse11 .cse12 .cse5) (or .cse4 .cse16 (or (<= (+ ~a1~0 15) 0) (= ~a10~0 0)) .cse7 .cse8) (or .cse4 .cse6 .cse20 .cse7 .cse8 .cse5 .cse9 .cse21 .cse10 .cse11 .cse12)))) [2018-11-12 18:36:16,517 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-11-12 18:36:16,517 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-11-12 18:36:16,517 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-11-12 18:36:16,517 INFO L425 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,517 INFO L425 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,517 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,517 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,517 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,517 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,518 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-11-12 18:36:16,518 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-12 18:36:16,518 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-12 18:36:16,518 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-12 18:36:16,518 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-12 18:36:16,518 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-12 18:36:16,518 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-12 18:36:16,518 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-11-12 18:36:16,518 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-11-12 18:36:16,518 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-11-12 18:36:16,519 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-11-12 18:36:16,519 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-11-12 18:36:16,519 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-11-12 18:36:16,519 INFO L425 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,519 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,519 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,519 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,520 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,520 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,520 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-11-12 18:36:16,520 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-11-12 18:36:16,520 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-11-12 18:36:16,520 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-12 18:36:16,521 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-12 18:36:16,521 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-12 18:36:16,521 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-12 18:36:16,521 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-12 18:36:16,521 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-12 18:36:16,521 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-11-12 18:36:16,521 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-11-12 18:36:16,522 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-11-12 18:36:16,522 INFO L425 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,522 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,522 INFO L425 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,522 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,522 INFO L425 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,522 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:36:16,523 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-11-12 18:36:16,523 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-11-12 18:36:16,523 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-11-12 18:36:16,523 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-12 18:36:16,523 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-12 18:36:16,523 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-12 18:36:16,523 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-12 18:36:16,523 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-12 18:36:16,524 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-12 18:36:16,524 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-11-12 18:36:16,524 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 130) no Hoare annotation was computed. [2018-11-12 18:36:16,524 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-11-12 18:36:16,524 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-11-12 18:36:16,524 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 18:36:16,524 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~inputF~0 6) (= ~inputC~0 3) (= ~a19~0 9) (= ~a10~0 0) (= ~a12~0 0) (= ~inputB~0 2) (= ~a1~0 23) (= ~inputE~0 5) (= ~a4~0 14) (= ~inputD~0 4)) [2018-11-12 18:36:16,525 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 18:36:16,525 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 18:36:16,525 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (and (= |old(~a10~0)| ~a10~0) (= ~a19~0 9) (= ~a1~0 23)) (not (= ~inputE~0 5)) (not (= 3 ~inputC~0)) (not (= |old(~a1~0)| 23)) (not (= ~a4~0 14)) (not (= 2 ~inputB~0)) (not (= 0 ~a12~0)) (not (= 9 |old(~a19~0)|)) (not (= 4 ~inputD~0)) (not (= |old(~a10~0)| 0)) (not (= ~inputF~0 6))) [2018-11-12 18:36:16,525 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-11-12 18:36:16,525 INFO L421 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (or (not (= |old(~a1~0)| 23)) (and (<= ~a1~0 38) (not (= ~a19~0 8)) (<= ~a19~0 8)) (not (= 0 ~a12~0)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= ~a10~0 3)) (not (= 3 ~inputC~0)) (and (<= ~a19~0 |old(~a19~0)|) (<= 9 ~a19~0)) (not (= ~a4~0 14)) (not (= 2 ~inputB~0)) (not (= |old(~a19~0)| 9)) (not (= |old(~a10~0)| 0)) (not (= ~inputF~0 6))) [2018-11-12 18:36:16,525 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-11-12 18:36:16,526 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-11-12 18:36:16,526 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-11-12 18:36:16,526 INFO L421 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (or (not (= |old(~a1~0)| 23)) (and (<= ~a1~0 38) (not (= ~a19~0 8)) (<= ~a19~0 8)) (not (= 0 ~a12~0)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= ~a10~0 3)) (not (= 3 ~inputC~0)) (and (<= ~a19~0 |old(~a19~0)|) (<= 9 ~a19~0)) (not (= ~a4~0 14)) (not (= 2 ~inputB~0)) (not (= |old(~a19~0)| 9)) (not (= |old(~a10~0)| 0)) (not (= ~inputF~0 6))) [2018-11-12 18:36:16,526 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-11-12 18:36:16,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:36:16 BoogieIcfgContainer [2018-11-12 18:36:16,539 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 18:36:16,540 INFO L168 Benchmark]: Toolchain (without parser) took 129554.98 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -427.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-11-12 18:36:16,541 INFO L168 Benchmark]: CDTParser took 0.22 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-12 18:36:16,541 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.01 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-12 18:36:16,542 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.00 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-12 18:36:16,543 INFO L168 Benchmark]: Boogie Preprocessor took 221.30 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -819.3 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-11-12 18:36:16,544 INFO L168 Benchmark]: RCFGBuilder took 3442.84 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 106.3 MB). Peak memory consumption was 106.3 MB. Max. memory is 7.1 GB. [2018-11-12 18:36:16,544 INFO L168 Benchmark]: TraceAbstraction took 125088.55 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 242.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-11-12 18:36:16,550 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.22 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 756.01 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.00 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 221.30 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -819.3 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3442.84 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 106.3 MB). Peak memory consumption was 106.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 125088.55 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 242.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 130]: 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: 582]: Loop Invariant Derived loop invariant: (((((((((((!(\old(a1) == 23) || ((a1 <= 38 && !(a19 == 8)) && a19 <= 8)) || !(0 == a12)) || !(4 == inputD)) || !(inputE == 5)) || !(a10 == 3)) || !(3 == inputC)) || (a19 <= \old(a19) && 9 <= a19)) || !(a4 == 14)) || !(2 == inputB)) || !(\old(a19) == 9)) || !(\old(a10) == 0)) || !(inputF == 6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. SAFE Result, 125.0s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 102.7s AutomataDifference, 0.0s DeadEndRemovalTime, 4.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1487 SDtfs, 9386 SDslu, 2930 SDs, 0 SdLazy, 16724 SolverSat, 2432 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.0s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 2256 GetRequests, 2060 SyntacticMatches, 5 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1412 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5940occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.6s AbstIntTime, 7 AbstIntIterations, 6 AbstIntStrong, 0.9969079768500132 AbsIntWeakeningRatio, 0.10821643286573146 AbsIntAvgWeakeningVarsNumRemoved, 18.563794255177022 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 891 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 142 PreInvPairs, 256 NumberOfFragments, 699 HoareAnnotationTreeSize, 142 FomulaSimplifications, 21357 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 8056 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 2304 NumberOfCodeBlocks, 2304 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2607 ConstructedInterpolants, 0 QuantifiedInterpolants, 3228489 SizeOfPredicates, 1 NumberOfNonLiveVariables, 523 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 1835/2376 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...