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/Problem14_label36_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 19:05:55,254 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 19:05:55,256 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 19:05:55,270 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 19:05:55,270 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 19:05:55,271 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 19:05:55,273 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 19:05:55,274 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 19:05:55,276 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 19:05:55,277 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 19:05:55,280 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 19:05:55,280 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 19:05:55,281 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 19:05:55,282 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 19:05:55,283 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 19:05:55,284 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 19:05:55,285 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 19:05:55,287 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 19:05:55,293 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 19:05:55,297 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 19:05:55,299 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 19:05:55,302 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 19:05:55,308 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 19:05:55,308 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 19:05:55,308 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 19:05:55,309 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 19:05:55,312 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 19:05:55,313 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 19:05:55,314 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 19:05:55,318 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 19:05:55,318 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 19:05:55,319 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 19:05:55,319 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 19:05:55,320 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 19:05:55,320 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 19:05:55,322 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 19:05:55,323 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 19:05:55,345 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 19:05:55,346 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 19:05:55,347 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 19:05:55,347 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 19:05:55,347 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 19:05:55,347 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 19:05:55,347 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 19:05:55,348 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 19:05:55,348 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 19:05:55,348 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 19:05:55,348 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 19:05:55,348 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 19:05:55,349 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 19:05:55,349 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 19:05:55,350 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 19:05:55,350 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 19:05:55,350 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 19:05:55,350 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 19:05:55,350 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 19:05:55,351 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 19:05:55,351 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 19:05:55,351 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 19:05:55,351 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 19:05:55,351 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 19:05:55,352 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 19:05:55,352 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 19:05:55,352 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 19:05:55,352 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 19:05:55,352 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 19:05:55,353 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 19:05:55,353 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 19:05:55,353 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 19:05:55,353 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 19:05:55,353 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 19:05:55,354 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 19:05:55,418 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 19:05:55,432 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 19:05:55,436 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 19:05:55,438 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 19:05:55,438 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 19:05:55,439 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label36_true-unreach-call_false-termination.c [2018-11-12 19:05:55,509 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0972cc137/d0f246d462504d0785e4a89a5e562b78/FLAG1ce346c0a [2018-11-12 19:05:56,075 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 19:05:56,076 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label36_true-unreach-call_false-termination.c [2018-11-12 19:05:56,102 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0972cc137/d0f246d462504d0785e4a89a5e562b78/FLAG1ce346c0a [2018-11-12 19:05:56,119 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0972cc137/d0f246d462504d0785e4a89a5e562b78 [2018-11-12 19:05:56,130 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 19:05:56,133 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 19:05:56,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 19:05:56,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 19:05:56,138 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 19:05:56,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:05:56" (1/1) ... [2018-11-12 19:05:56,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46f35d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:05:56, skipping insertion in model container [2018-11-12 19:05:56,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:05:56" (1/1) ... [2018-11-12 19:05:56,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 19:05:56,212 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 19:05:56,741 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 19:05:56,746 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 19:05:56,917 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 19:05:56,937 INFO L193 MainTranslator]: Completed translation [2018-11-12 19:05:56,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:05:56 WrapperNode [2018-11-12 19:05:56,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 19:05:56,940 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 19:05:56,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 19:05:56,940 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 19:05:56,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:05:56" (1/1) ... [2018-11-12 19:05:56,972 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:05:56" (1/1) ... [2018-11-12 19:05:57,092 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 19:05:57,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 19:05:57,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 19:05:57,093 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 19:05:57,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:05:56" (1/1) ... [2018-11-12 19:05:57,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:05:56" (1/1) ... [2018-11-12 19:05:57,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:05:56" (1/1) ... [2018-11-12 19:05:57,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:05:56" (1/1) ... [2018-11-12 19:05:57,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:05:56" (1/1) ... [2018-11-12 19:05:57,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:05:56" (1/1) ... [2018-11-12 19:05:57,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:05:56" (1/1) ... [2018-11-12 19:05:57,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 19:05:57,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 19:05:57,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 19:05:57,230 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 19:05:57,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:05:56" (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 19:05:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 19:05:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 19:05:57,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 19:05:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 19:05:57,298 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 19:05:57,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 19:05:57,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 19:05:57,299 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 19:05:57,299 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 19:06:00,852 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 19:06:00,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:06:00 BoogieIcfgContainer [2018-11-12 19:06:00,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 19:06:00,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 19:06:00,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 19:06:00,858 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 19:06:00,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:05:56" (1/3) ... [2018-11-12 19:06:00,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e329588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:06:00, skipping insertion in model container [2018-11-12 19:06:00,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:05:56" (2/3) ... [2018-11-12 19:06:00,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e329588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:06:00, skipping insertion in model container [2018-11-12 19:06:00,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:06:00" (3/3) ... [2018-11-12 19:06:00,863 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label36_true-unreach-call_false-termination.c [2018-11-12 19:06:00,874 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 19:06:00,884 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 19:06:00,903 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 19:06:00,945 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 19:06:00,946 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 19:06:00,946 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 19:06:00,946 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 19:06:00,946 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 19:06:00,946 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 19:06:00,947 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 19:06:00,947 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 19:06:00,978 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-11-12 19:06:00,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-12 19:06:00,994 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:06:00,996 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, 1, 1, 1, 1, 1, 1] [2018-11-12 19:06:01,000 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:06:01,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:06:01,008 INFO L82 PathProgramCache]: Analyzing trace with hash -601836047, now seen corresponding path program 1 times [2018-11-12 19:06:01,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:06:01,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:01,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:06:01,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:01,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:06:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:06:01,575 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 19:06:01,665 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 19:06:01,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:06:01,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 19:06:01,669 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:06:01,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 19:06:01,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 19:06:01,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 19:06:01,697 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-11-12 19:06:03,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:06:03,682 INFO L93 Difference]: Finished difference Result 691 states and 1226 transitions. [2018-11-12 19:06:03,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 19:06:03,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-11-12 19:06:03,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:06:03,707 INFO L225 Difference]: With dead ends: 691 [2018-11-12 19:06:03,707 INFO L226 Difference]: Without dead ends: 434 [2018-11-12 19:06:03,715 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 19:06:03,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-12 19:06:03,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-11-12 19:06:03,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-12 19:06:03,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 765 transitions. [2018-11-12 19:06:03,808 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 765 transitions. Word has length 55 [2018-11-12 19:06:03,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:06:03,809 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 765 transitions. [2018-11-12 19:06:03,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 19:06:03,809 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 765 transitions. [2018-11-12 19:06:03,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-12 19:06:03,818 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:06:03,818 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, 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] [2018-11-12 19:06:03,819 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:06:03,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:06:03,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1606390417, now seen corresponding path program 1 times [2018-11-12 19:06:03,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:06:03,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:03,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:06:03,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:03,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:06:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:06:04,181 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 19:06:04,237 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:06:04,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:06:04,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 19:06:04,238 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:06:04,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 19:06:04,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 19:06:04,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 19:06:04,241 INFO L87 Difference]: Start difference. First operand 434 states and 765 transitions. Second operand 6 states. [2018-11-12 19:06:06,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:06:06,402 INFO L93 Difference]: Finished difference Result 1062 states and 1897 transitions. [2018-11-12 19:06:06,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 19:06:06,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2018-11-12 19:06:06,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:06:06,409 INFO L225 Difference]: With dead ends: 1062 [2018-11-12 19:06:06,409 INFO L226 Difference]: Without dead ends: 634 [2018-11-12 19:06:06,412 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 19:06:06,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-11-12 19:06:06,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 625. [2018-11-12 19:06:06,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2018-11-12 19:06:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 1019 transitions. [2018-11-12 19:06:06,461 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 1019 transitions. Word has length 130 [2018-11-12 19:06:06,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:06:06,462 INFO L480 AbstractCegarLoop]: Abstraction has 625 states and 1019 transitions. [2018-11-12 19:06:06,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 19:06:06,463 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 1019 transitions. [2018-11-12 19:06:06,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-12 19:06:06,466 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:06:06,467 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, 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] [2018-11-12 19:06:06,467 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:06:06,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:06:06,467 INFO L82 PathProgramCache]: Analyzing trace with hash 946019240, now seen corresponding path program 1 times [2018-11-12 19:06:06,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:06:06,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:06,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:06:06,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:06,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:06:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:06:06,703 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:06:06,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:06:06,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 19:06:06,704 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:06:06,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 19:06:06,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 19:06:06,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 19:06:06,706 INFO L87 Difference]: Start difference. First operand 625 states and 1019 transitions. Second operand 4 states. [2018-11-12 19:06:11,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:06:11,617 INFO L93 Difference]: Finished difference Result 2350 states and 4005 transitions. [2018-11-12 19:06:11,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 19:06:11,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-11-12 19:06:11,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:06:11,638 INFO L225 Difference]: With dead ends: 2350 [2018-11-12 19:06:11,638 INFO L226 Difference]: Without dead ends: 1731 [2018-11-12 19:06:11,644 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 19:06:11,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2018-11-12 19:06:11,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1731. [2018-11-12 19:06:11,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2018-11-12 19:06:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2670 transitions. [2018-11-12 19:06:11,729 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2670 transitions. Word has length 139 [2018-11-12 19:06:11,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:06:11,730 INFO L480 AbstractCegarLoop]: Abstraction has 1731 states and 2670 transitions. [2018-11-12 19:06:11,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 19:06:11,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2670 transitions. [2018-11-12 19:06:11,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-11-12 19:06:11,746 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:06:11,748 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, 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, 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 19:06:11,748 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:06:11,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:06:11,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1544356755, now seen corresponding path program 1 times [2018-11-12 19:06:11,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:06:11,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:11,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:06:11,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:11,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:06:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:06:12,855 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2018-11-12 19:06:13,012 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 19:06:13,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:06:13,012 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:06:13,013 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 264 with the following transitions: [2018-11-12 19:06:13,016 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], [297], [305], [313], [321], [329], [337], [341], [343], [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], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:06:13,075 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:06:13,076 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:06:13,831 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:06:13,846 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:06:13,848 INFO L272 AbstractInterpreter]: Visited 118 different actions 118 times. Never merged. Never widened. Performed 1025 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1025 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 24 variables. [2018-11-12 19:06:13,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:06:13,892 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:06:14,600 INFO L227 lantSequenceWeakener]: Weakened 254 states. On average, predicates are now at 77.92% of their original sizes. [2018-11-12 19:06:14,600 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:06:14,950 INFO L415 sIntCurrentIteration]: We unified 262 AI predicates to 262 [2018-11-12 19:06:14,950 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:06:14,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:06:14,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2018-11-12 19:06:14,951 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:06:14,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 19:06:14,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 19:06:14,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-12 19:06:14,953 INFO L87 Difference]: Start difference. First operand 1731 states and 2670 transitions. Second operand 7 states. [2018-11-12 19:06:27,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:06:27,166 INFO L93 Difference]: Finished difference Result 3641 states and 5626 transitions. [2018-11-12 19:06:27,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 19:06:27,167 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 263 [2018-11-12 19:06:27,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:06:27,179 INFO L225 Difference]: With dead ends: 3641 [2018-11-12 19:06:27,179 INFO L226 Difference]: Without dead ends: 1916 [2018-11-12 19:06:27,188 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 263 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-12 19:06:27,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2018-11-12 19:06:27,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1914. [2018-11-12 19:06:27,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2018-11-12 19:06:27,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2861 transitions. [2018-11-12 19:06:27,241 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2861 transitions. Word has length 263 [2018-11-12 19:06:27,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:06:27,242 INFO L480 AbstractCegarLoop]: Abstraction has 1914 states and 2861 transitions. [2018-11-12 19:06:27,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 19:06:27,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2861 transitions. [2018-11-12 19:06:27,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-11-12 19:06:27,255 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:06:27,255 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, 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, 3, 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] [2018-11-12 19:06:27,256 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:06:27,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:06:27,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1780119455, now seen corresponding path program 1 times [2018-11-12 19:06:27,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:06:27,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:27,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:06:27,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:27,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:06:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:06:27,768 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 19:06:28,626 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 232 proven. 172 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:06:28,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:06:28,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:06:28,626 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 349 with the following transitions: [2018-11-12 19:06:28,627 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], [297], [305], [313], [321], [329], [337], [341], [343], [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], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:06:28,633 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:06:28,634 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:06:28,842 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:06:29,017 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:06:29,018 INFO L272 AbstractInterpreter]: Visited 122 different actions 237 times. Merged at 4 different actions 4 times. Never widened. Performed 2381 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2381 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 19:06:29,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:06:29,058 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:06:29,815 INFO L227 lantSequenceWeakener]: Weakened 99 states. On average, predicates are now at 78.05% of their original sizes. [2018-11-12 19:06:29,815 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:06:31,628 INFO L415 sIntCurrentIteration]: We unified 347 AI predicates to 347 [2018-11-12 19:06:31,628 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:06:31,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:06:31,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [12] total 30 [2018-11-12 19:06:31,629 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:06:31,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-12 19:06:31,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-12 19:06:31,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-11-12 19:06:31,631 INFO L87 Difference]: Start difference. First operand 1914 states and 2861 transitions. Second operand 20 states. [2018-11-12 19:06:54,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:06:54,564 INFO L93 Difference]: Finished difference Result 4850 states and 7321 transitions. [2018-11-12 19:06:54,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 19:06:54,564 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 348 [2018-11-12 19:06:54,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:06:54,582 INFO L225 Difference]: With dead ends: 4850 [2018-11-12 19:06:54,583 INFO L226 Difference]: Without dead ends: 3125 [2018-11-12 19:06:54,593 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 357 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2018-11-12 19:06:54,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2018-11-12 19:06:54,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 2983. [2018-11-12 19:06:54,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2983 states. [2018-11-12 19:06:54,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 3990 transitions. [2018-11-12 19:06:54,674 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 3990 transitions. Word has length 348 [2018-11-12 19:06:54,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:06:54,675 INFO L480 AbstractCegarLoop]: Abstraction has 2983 states and 3990 transitions. [2018-11-12 19:06:54,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-12 19:06:54,675 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 3990 transitions. [2018-11-12 19:06:54,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-11-12 19:06:54,689 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:06:54,689 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:06:54,690 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:06:54,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:06:54,690 INFO L82 PathProgramCache]: Analyzing trace with hash -490485645, now seen corresponding path program 1 times [2018-11-12 19:06:54,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:06:54,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:54,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:06:54,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:54,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:06:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:06:55,188 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 19:06:55,376 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-12 19:06:55,603 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 19:06:55,988 WARN L179 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-12 19:06:56,499 WARN L179 SmtUtils]: Spent 394.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-12 19:06:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 157 proven. 283 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:06:57,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:06:57,769 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:06:57,770 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 375 with the following transitions: [2018-11-12 19:06:57,770 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], [297], [305], [313], [321], [329], [337], [341], [343], [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], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:06:57,775 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:06:57,776 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:06:57,883 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:06:58,012 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:06:58,012 INFO L272 AbstractInterpreter]: Visited 122 different actions 240 times. Merged at 5 different actions 7 times. Never widened. Performed 3117 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3117 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 19:06:58,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:06:58,040 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:06:58,585 INFO L227 lantSequenceWeakener]: Weakened 148 states. On average, predicates are now at 78.74% of their original sizes. [2018-11-12 19:06:58,585 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:06:59,496 INFO L415 sIntCurrentIteration]: We unified 373 AI predicates to 373 [2018-11-12 19:06:59,496 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:06:59,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:06:59,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [15] total 34 [2018-11-12 19:06:59,497 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:06:59,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 19:06:59,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 19:06:59,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-11-12 19:06:59,500 INFO L87 Difference]: Start difference. First operand 2983 states and 3990 transitions. Second operand 21 states. [2018-11-12 19:07:21,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:07:21,848 INFO L93 Difference]: Finished difference Result 5079 states and 7110 transitions. [2018-11-12 19:07:21,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 19:07:21,848 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 374 [2018-11-12 19:07:21,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:07:21,864 INFO L225 Difference]: With dead ends: 5079 [2018-11-12 19:07:21,864 INFO L226 Difference]: Without dead ends: 3354 [2018-11-12 19:07:21,872 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 390 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=268, Invalid=1138, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 19:07:21,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3354 states. [2018-11-12 19:07:21,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3354 to 3168. [2018-11-12 19:07:21,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3168 states. [2018-11-12 19:07:21,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3168 states to 3168 states and 4181 transitions. [2018-11-12 19:07:21,949 INFO L78 Accepts]: Start accepts. Automaton has 3168 states and 4181 transitions. Word has length 374 [2018-11-12 19:07:21,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:07:21,949 INFO L480 AbstractCegarLoop]: Abstraction has 3168 states and 4181 transitions. [2018-11-12 19:07:21,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 19:07:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 3168 states and 4181 transitions. [2018-11-12 19:07:21,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-11-12 19:07:21,965 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:07:21,965 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:07:21,965 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:07:21,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:07:21,966 INFO L82 PathProgramCache]: Analyzing trace with hash 938240039, now seen corresponding path program 1 times [2018-11-12 19:07:21,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:07:21,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:07:21,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:07:21,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:07:21,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:07:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:07:22,446 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 19:07:22,645 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-12 19:07:22,878 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 19:07:23,535 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 260 proven. 182 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:07:23,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:07:23,535 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:07:23,536 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 385 with the following transitions: [2018-11-12 19:07:23,536 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], [297], [305], [313], [321], [329], [337], [341], [343], [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], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [698], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:07:23,540 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:07:23,540 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:07:23,660 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:07:23,866 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:07:23,867 INFO L272 AbstractInterpreter]: Visited 130 different actions 256 times. Merged at 5 different actions 7 times. Never widened. Performed 4326 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4326 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 19:07:23,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:07:23,875 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:07:24,489 INFO L227 lantSequenceWeakener]: Weakened 95 states. On average, predicates are now at 78.09% of their original sizes. [2018-11-12 19:07:24,490 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:07:24,886 INFO L415 sIntCurrentIteration]: We unified 383 AI predicates to 383 [2018-11-12 19:07:24,886 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:07:24,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:07:24,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [12] total 29 [2018-11-12 19:07:24,887 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:07:24,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 19:07:24,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 19:07:24,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-11-12 19:07:24,889 INFO L87 Difference]: Start difference. First operand 3168 states and 4181 transitions. Second operand 19 states. [2018-11-12 19:07:43,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:07:43,279 INFO L93 Difference]: Finished difference Result 5929 states and 8455 transitions. [2018-11-12 19:07:43,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 19:07:43,281 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 384 [2018-11-12 19:07:43,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:07:43,300 INFO L225 Difference]: With dead ends: 5929 [2018-11-12 19:07:43,300 INFO L226 Difference]: Without dead ends: 4204 [2018-11-12 19:07:43,310 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 392 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2018-11-12 19:07:43,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4204 states. [2018-11-12 19:07:43,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4204 to 3691. [2018-11-12 19:07:43,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3691 states. [2018-11-12 19:07:43,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3691 states to 3691 states and 4729 transitions. [2018-11-12 19:07:43,405 INFO L78 Accepts]: Start accepts. Automaton has 3691 states and 4729 transitions. Word has length 384 [2018-11-12 19:07:43,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:07:43,406 INFO L480 AbstractCegarLoop]: Abstraction has 3691 states and 4729 transitions. [2018-11-12 19:07:43,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 19:07:43,406 INFO L276 IsEmpty]: Start isEmpty. Operand 3691 states and 4729 transitions. [2018-11-12 19:07:43,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-11-12 19:07:43,430 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:07:43,431 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, 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, 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, 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 19:07:43,431 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:07:43,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:07:43,431 INFO L82 PathProgramCache]: Analyzing trace with hash -718601408, now seen corresponding path program 1 times [2018-11-12 19:07:43,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:07:43,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:07:43,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:07:43,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:07:43,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:07:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:07:44,367 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 244 proven. 198 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:07:44,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:07:44,368 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:07:44,368 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 410 with the following transitions: [2018-11-12 19:07:44,368 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], [297], [305], [313], [321], [329], [337], [341], [343], [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], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [798], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:07:44,371 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:07:44,371 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:07:44,450 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:07:44,681 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:07:44,681 INFO L272 AbstractInterpreter]: Visited 155 different actions 303 times. Merged at 4 different actions 4 times. Never widened. Performed 3176 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3176 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 19:07:44,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:07:44,723 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:07:45,842 INFO L227 lantSequenceWeakener]: Weakened 99 states. On average, predicates are now at 78.05% of their original sizes. [2018-11-12 19:07:45,842 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:07:46,255 INFO L415 sIntCurrentIteration]: We unified 408 AI predicates to 408 [2018-11-12 19:07:46,255 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:07:46,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:07:46,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [13] total 31 [2018-11-12 19:07:46,256 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:07:46,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-12 19:07:46,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-12 19:07:46,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-11-12 19:07:46,258 INFO L87 Difference]: Start difference. First operand 3691 states and 4729 transitions. Second operand 20 states. [2018-11-12 19:08:08,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:08:08,583 INFO L93 Difference]: Finished difference Result 6449 states and 9002 transitions. [2018-11-12 19:08:08,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 19:08:08,583 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 409 [2018-11-12 19:08:08,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:08:08,601 INFO L225 Difference]: With dead ends: 6449 [2018-11-12 19:08:08,601 INFO L226 Difference]: Without dead ends: 4724 [2018-11-12 19:08:08,610 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 418 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2018-11-12 19:08:08,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4724 states. [2018-11-12 19:08:08,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4724 to 4210. [2018-11-12 19:08:08,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4210 states. [2018-11-12 19:08:08,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4210 states to 4210 states and 5275 transitions. [2018-11-12 19:08:08,710 INFO L78 Accepts]: Start accepts. Automaton has 4210 states and 5275 transitions. Word has length 409 [2018-11-12 19:08:08,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:08:08,711 INFO L480 AbstractCegarLoop]: Abstraction has 4210 states and 5275 transitions. [2018-11-12 19:08:08,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-12 19:08:08,711 INFO L276 IsEmpty]: Start isEmpty. Operand 4210 states and 5275 transitions. [2018-11-12 19:08:08,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-11-12 19:08:08,731 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:08:08,732 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, 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, 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, 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 19:08:08,732 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:08:08,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:08:08,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1148210221, now seen corresponding path program 1 times [2018-11-12 19:08:08,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:08:08,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:08:08,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:08:08,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:08:08,734 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:08:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:08:09,192 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 19:08:09,854 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 231 proven. 211 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:08:09,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:08:09,854 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:08:09,854 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 423 with the following transitions: [2018-11-12 19:08:09,855 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], [297], [305], [313], [321], [329], [337], [341], [343], [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], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [850], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:08:09,858 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:08:09,858 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:08:09,929 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:08:10,165 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:08:10,165 INFO L272 AbstractInterpreter]: Visited 168 different actions 329 times. Merged at 4 different actions 4 times. Never widened. Performed 4630 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4630 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 19:08:10,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:08:10,172 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:08:11,433 INFO L227 lantSequenceWeakener]: Weakened 95 states. On average, predicates are now at 78.09% of their original sizes. [2018-11-12 19:08:11,434 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:08:12,302 INFO L415 sIntCurrentIteration]: We unified 421 AI predicates to 421 [2018-11-12 19:08:12,302 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:08:12,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:08:12,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [12] total 29 [2018-11-12 19:08:12,303 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:08:12,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 19:08:12,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 19:08:12,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-11-12 19:08:12,305 INFO L87 Difference]: Start difference. First operand 4210 states and 5275 transitions. Second operand 19 states. [2018-11-12 19:08:37,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:08:37,567 INFO L93 Difference]: Finished difference Result 7050 states and 9671 transitions. [2018-11-12 19:08:37,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 19:08:37,567 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 422 [2018-11-12 19:08:37,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:08:37,588 INFO L225 Difference]: With dead ends: 7050 [2018-11-12 19:08:37,588 INFO L226 Difference]: Without dead ends: 5325 [2018-11-12 19:08:37,604 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 431 GetRequests, 398 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2018-11-12 19:08:37,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5325 states. [2018-11-12 19:08:37,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5325 to 4819. [2018-11-12 19:08:37,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4819 states. [2018-11-12 19:08:37,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4819 states to 4819 states and 5915 transitions. [2018-11-12 19:08:37,721 INFO L78 Accepts]: Start accepts. Automaton has 4819 states and 5915 transitions. Word has length 422 [2018-11-12 19:08:37,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:08:37,721 INFO L480 AbstractCegarLoop]: Abstraction has 4819 states and 5915 transitions. [2018-11-12 19:08:37,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 19:08:37,722 INFO L276 IsEmpty]: Start isEmpty. Operand 4819 states and 5915 transitions. [2018-11-12 19:08:37,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-11-12 19:08:37,738 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:08:37,738 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, 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, 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, 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 19:08:37,739 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:08:37,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:08:37,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1299578539, now seen corresponding path program 1 times [2018-11-12 19:08:37,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:08:37,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:08:37,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:08:37,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:08:37,740 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:08:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:08:39,192 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 219 proven. 223 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:08:39,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:08:39,192 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:08:39,193 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 435 with the following transitions: [2018-11-12 19:08:39,193 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], [297], [305], [313], [321], [329], [337], [341], [343], [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], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [895], [898], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:08:39,195 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:08:39,196 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:08:39,268 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:08:39,455 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:08:39,456 INFO L272 AbstractInterpreter]: Visited 180 different actions 353 times. Merged at 4 different actions 4 times. Never widened. Performed 3742 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3742 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 19:08:39,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:08:39,462 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:08:39,943 INFO L227 lantSequenceWeakener]: Weakened 99 states. On average, predicates are now at 78.05% of their original sizes. [2018-11-12 19:08:39,944 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:08:40,380 INFO L415 sIntCurrentIteration]: We unified 433 AI predicates to 433 [2018-11-12 19:08:40,380 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:08:40,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:08:40,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [14] total 32 [2018-11-12 19:08:40,380 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:08:40,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-12 19:08:40,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-12 19:08:40,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-11-12 19:08:40,382 INFO L87 Difference]: Start difference. First operand 4819 states and 5915 transitions. Second operand 20 states. [2018-11-12 19:08:59,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:08:59,327 INFO L93 Difference]: Finished difference Result 7577 states and 10188 transitions. [2018-11-12 19:08:59,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 19:08:59,327 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 434 [2018-11-12 19:08:59,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:08:59,343 INFO L225 Difference]: With dead ends: 7577 [2018-11-12 19:08:59,343 INFO L226 Difference]: Without dead ends: 5852 [2018-11-12 19:08:59,352 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 443 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2018-11-12 19:08:59,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5852 states. [2018-11-12 19:08:59,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5852 to 5336. [2018-11-12 19:08:59,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5336 states. [2018-11-12 19:08:59,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5336 states to 5336 states and 6459 transitions. [2018-11-12 19:08:59,451 INFO L78 Accepts]: Start accepts. Automaton has 5336 states and 6459 transitions. Word has length 434 [2018-11-12 19:08:59,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:08:59,452 INFO L480 AbstractCegarLoop]: Abstraction has 5336 states and 6459 transitions. [2018-11-12 19:08:59,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-12 19:08:59,452 INFO L276 IsEmpty]: Start isEmpty. Operand 5336 states and 6459 transitions. [2018-11-12 19:08:59,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-11-12 19:08:59,470 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:08:59,470 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-11-12 19:08:59,471 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:08:59,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:08:59,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1413159681, now seen corresponding path program 1 times [2018-11-12 19:08:59,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:08:59,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:08:59,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:08:59,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:08:59,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:08:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:09:00,494 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 285 proven. 202 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2018-11-12 19:09:00,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:09:00,495 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:09:00,495 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 460 with the following transitions: [2018-11-12 19:09:00,495 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], [297], [305], [313], [321], [329], [337], [341], [343], [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], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:09:00,497 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:09:00,497 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:09:00,571 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:09:00,791 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:09:00,791 INFO L272 AbstractInterpreter]: Visited 123 different actions 363 times. Merged at 7 different actions 16 times. Never widened. Performed 4377 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4377 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 19:09:00,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:09:00,799 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:09:01,626 INFO L227 lantSequenceWeakener]: Weakened 104 states. On average, predicates are now at 77.62% of their original sizes. [2018-11-12 19:09:01,626 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:09:02,075 INFO L415 sIntCurrentIteration]: We unified 458 AI predicates to 458 [2018-11-12 19:09:02,075 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:09:02,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:09:02,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [6] total 21 [2018-11-12 19:09:02,076 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:09:02,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 19:09:02,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 19:09:02,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-11-12 19:09:02,077 INFO L87 Difference]: Start difference. First operand 5336 states and 6459 transitions. Second operand 17 states. [2018-11-12 19:09:28,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:09:28,343 INFO L93 Difference]: Finished difference Result 10354 states and 12966 transitions. [2018-11-12 19:09:28,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 19:09:28,343 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 459 [2018-11-12 19:09:28,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:09:28,359 INFO L225 Difference]: With dead ends: 10354 [2018-11-12 19:09:28,359 INFO L226 Difference]: Without dead ends: 5584 [2018-11-12 19:09:28,373 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 470 GetRequests, 440 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2018-11-12 19:09:28,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5584 states. [2018-11-12 19:09:28,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5584 to 5551. [2018-11-12 19:09:28,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5551 states. [2018-11-12 19:09:28,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5551 states to 5551 states and 6712 transitions. [2018-11-12 19:09:28,478 INFO L78 Accepts]: Start accepts. Automaton has 5551 states and 6712 transitions. Word has length 459 [2018-11-12 19:09:28,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:09:28,479 INFO L480 AbstractCegarLoop]: Abstraction has 5551 states and 6712 transitions. [2018-11-12 19:09:28,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 19:09:28,479 INFO L276 IsEmpty]: Start isEmpty. Operand 5551 states and 6712 transitions. [2018-11-12 19:09:28,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2018-11-12 19:09:28,998 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:09:28,998 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:09:28,999 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:09:28,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:09:28,999 INFO L82 PathProgramCache]: Analyzing trace with hash 2044324798, now seen corresponding path program 1 times [2018-11-12 19:09:28,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:09:29,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:09:29,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:09:29,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:09:29,001 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:09:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:09:29,344 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2018-11-12 19:09:29,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:09:29,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 19:09:29,344 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:09:29,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 19:09:29,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 19:09:29,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 19:09:29,346 INFO L87 Difference]: Start difference. First operand 5551 states and 6712 transitions. Second operand 3 states. [2018-11-12 19:09:30,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:09:30,535 INFO L93 Difference]: Finished difference Result 8563 states and 11475 transitions. [2018-11-12 19:09:30,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 19:09:30,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 484 [2018-11-12 19:09:30,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:09:30,537 INFO L225 Difference]: With dead ends: 8563 [2018-11-12 19:09:30,537 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 19:09:30,561 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 19:09:30,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 19:09:30,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 19:09:30,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 19:09:30,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 19:09:30,562 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 484 [2018-11-12 19:09:30,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:09:30,563 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 19:09:30,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 19:09:30,563 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 19:09:30,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 19:09:30,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 19:09:31,516 WARN L179 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2018-11-12 19:09:32,437 WARN L179 SmtUtils]: Spent 917.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2018-11-12 19:09:34,317 WARN L179 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 220 DAG size of output: 107 [2018-11-12 19:09:35,100 WARN L179 SmtUtils]: Spent 702.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 51 [2018-11-12 19:09:35,103 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 19:09:35,103 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |old(~a15~0)| ~a15~0) [2018-11-12 19:09:35,104 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 19:09:35,104 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-11-12 19:09:35,104 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-11-12 19:09:35,104 INFO L425 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,104 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,104 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,104 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-11-12 19:09:35,104 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-12 19:09:35,105 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-12 19:09:35,105 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-12 19:09:35,105 INFO L425 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-11-12 19:09:35,105 INFO L425 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-11-12 19:09:35,105 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-11-12 19:09:35,105 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-11-12 19:09:35,105 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,105 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,105 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,106 INFO L425 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-11-12 19:09:35,106 INFO L425 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-11-12 19:09:35,106 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-12 19:09:35,106 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-12 19:09:35,106 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-12 19:09:35,106 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-11-12 19:09:35,106 INFO L425 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-11-12 19:09:35,106 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-11-12 19:09:35,107 INFO L425 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,107 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,107 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,107 INFO L425 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-11-12 19:09:35,107 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-12 19:09:35,107 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-12 19:09:35,107 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-12 19:09:35,107 INFO L425 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-11-12 19:09:35,107 INFO L425 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-11-12 19:09:35,108 INFO L425 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-11-12 19:09:35,108 INFO L425 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-11-12 19:09:35,109 INFO L425 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-11-12 19:09:35,109 INFO L425 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,109 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,109 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,109 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-11-12 19:09:35,109 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-12 19:09:35,109 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-12 19:09:35,109 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-12 19:09:35,109 INFO L425 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-11-12 19:09:35,113 INFO L425 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-11-12 19:09:35,113 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-11-12 19:09:35,113 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,113 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,113 INFO L425 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,113 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-11-12 19:09:35,113 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-12 19:09:35,113 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-12 19:09:35,114 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-12 19:09:35,114 INFO L425 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-11-12 19:09:35,114 INFO L425 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-11-12 19:09:35,114 INFO L425 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-11-12 19:09:35,114 INFO L425 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-11-12 19:09:35,114 INFO L425 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-11-12 19:09:35,114 INFO L425 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,114 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,114 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,115 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,115 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-11-12 19:09:35,115 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-12 19:09:35,115 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-12 19:09:35,115 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-12 19:09:35,115 INFO L425 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-11-12 19:09:35,115 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-11-12 19:09:35,115 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-11-12 19:09:35,116 INFO L425 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-11-12 19:09:35,116 INFO L425 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,116 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,116 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,116 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-12 19:09:35,116 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-12 19:09:35,116 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-12 19:09:35,116 INFO L425 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-11-12 19:09:35,116 INFO L425 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-11-12 19:09:35,117 INFO L425 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-11-12 19:09:35,117 INFO L425 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-11-12 19:09:35,117 INFO L425 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-11-12 19:09:35,117 INFO L425 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,117 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,117 INFO L425 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,117 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-11-12 19:09:35,117 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-11-12 19:09:35,117 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-12 19:09:35,118 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-12 19:09:35,119 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-12 19:09:35,119 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-11-12 19:09:35,121 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 872) the Hoare annotation is: (let ((.cse0 (= |old(~a15~0)| ~a15~0)) (.cse3 (< 7 |old(~a21~0)|)) (.cse5 (<= ~a21~0 7)) (.cse4 (let ((.cse9 (< |old(~a15~0)| 5)) (.cse10 (< 10 |old(~a21~0)|)) (.cse11 (not (= 1 |old(~a24~0)|))) (.cse12 (not (= 0 (+ |old(~a12~0)| 49))))) (and (or .cse9 .cse10 .cse11 .cse12 (< |old(~a21~0)| 7) (< 8 |old(~a15~0)|)) (or (< |old(~a21~0)| 6) .cse9 .cse10 .cse11 .cse12 (< 7 |old(~a15~0)|))))) (.cse1 (= 6 |old(~a15~0)|)) (.cse2 (= 8 |old(~a21~0)|))) (and (or .cse0 .cse1) (or .cse2 (not (= 8 ~a21~0))) (or (< 80 |old(~a12~0)|) (and (<= ~a12~0 80) .cse0)) (or .cse2 .cse0) (or (and (or .cse3 (< |old(~a15~0)| 6)) (not (= 7 |old(~a21~0)|))) .cse4 .cse1 (or (= ~a21~0 7) (and .cse5 (<= 6 ~a15~0)))) (or (not (= 4 ~inputD~0)) .cse3 (< |calculate_output_#in~input| 1) (< 6 |calculate_output_#in~input|) (not (= ~inputE~0 5)) .cse4 .cse5 .cse1 (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (not (= ~inputF~0 6))) (or (let ((.cse6 (= (+ ~a12~0 49) 0)) (.cse7 (= ~a24~0 1)) (.cse8 (<= ~a21~0 10))) (or (and (<= 7 ~a21~0) .cse6 .cse7 .cse8) (and (<= ~a15~0 7) (<= 6 ~a21~0) .cse6 .cse7 .cse8))) .cse4 .cse1 .cse2) (or (not (= 10 |old(~a21~0)|)) (= 10 ~a21~0)))) [2018-11-12 19:09:35,121 INFO L425 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-11-12 19:09:35,121 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-11-12 19:09:35,121 INFO L425 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,122 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,122 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,122 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-12 19:09:35,122 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-12 19:09:35,122 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-12 19:09:35,122 INFO L425 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-11-12 19:09:35,122 INFO L425 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-11-12 19:09:35,122 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-11-12 19:09:35,123 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-11-12 19:09:35,123 INFO L425 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-11-12 19:09:35,123 INFO L425 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,123 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,123 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,123 INFO L425 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-11-12 19:09:35,123 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-11-12 19:09:35,123 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-12 19:09:35,123 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-12 19:09:35,124 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-12 19:09:35,124 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-11-12 19:09:35,124 INFO L425 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-11-12 19:09:35,124 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-11-12 19:09:35,124 INFO L425 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,124 INFO L425 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,124 INFO L425 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,124 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-11-12 19:09:35,124 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-12 19:09:35,125 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-12 19:09:35,125 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-12 19:09:35,125 INFO L425 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-11-12 19:09:35,125 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-11-12 19:09:35,125 INFO L425 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-11-12 19:09:35,125 INFO L425 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-11-12 19:09:35,125 INFO L425 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,125 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,125 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,126 INFO L425 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-11-12 19:09:35,126 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-12 19:09:35,126 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-12 19:09:35,126 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-12 19:09:35,126 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-11-12 19:09:35,126 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-11-12 19:09:35,126 INFO L425 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-11-12 19:09:35,126 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-11-12 19:09:35,126 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,127 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,127 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-11-12 19:09:35,127 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-12 19:09:35,127 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-12 19:09:35,127 INFO L425 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-11-12 19:09:35,127 INFO L425 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-11-12 19:09:35,127 INFO L425 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-11-12 19:09:35,127 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-11-12 19:09:35,127 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-11-12 19:09:35,128 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,128 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,128 INFO L425 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-11-12 19:09:35,128 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-12 19:09:35,128 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-12 19:09:35,128 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-11-12 19:09:35,128 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-11-12 19:09:35,128 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-11-12 19:09:35,129 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,129 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,129 INFO L425 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-11-12 19:09:35,129 INFO L425 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-11-12 19:09:35,129 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-12 19:09:35,129 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-12 19:09:35,129 INFO L425 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-11-12 19:09:35,129 INFO L425 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-11-12 19:09:35,129 INFO L425 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-11-12 19:09:35,130 INFO L425 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-11-12 19:09:35,130 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,130 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,130 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-11-12 19:09:35,130 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-11-12 19:09:35,130 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-12 19:09:35,130 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-12 19:09:35,130 INFO L425 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-11-12 19:09:35,130 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-11-12 19:09:35,130 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-11-12 19:09:35,131 INFO L425 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,131 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,131 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,131 INFO L425 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-11-12 19:09:35,131 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-11-12 19:09:35,131 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-12 19:09:35,131 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-12 19:09:35,131 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 148) no Hoare annotation was computed. [2018-11-12 19:09:35,132 INFO L425 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-11-12 19:09:35,132 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-11-12 19:09:35,132 INFO L425 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,132 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,132 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-12 19:09:35,132 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,132 INFO L425 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-11-12 19:09:35,132 INFO L425 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-11-12 19:09:35,132 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-11-12 19:09:35,133 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-12 19:09:35,133 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-12 19:09:35,133 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-12 19:09:35,133 INFO L425 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-11-12 19:09:35,133 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-11-12 19:09:35,133 INFO L425 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-11-12 19:09:35,133 INFO L425 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-11-12 19:09:35,133 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,133 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,133 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,134 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-11-12 19:09:35,134 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-12 19:09:35,134 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-12 19:09:35,134 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-12 19:09:35,134 INFO L425 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-11-12 19:09:35,134 INFO L425 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-11-12 19:09:35,134 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-11-12 19:09:35,134 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-11-12 19:09:35,134 INFO L425 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,135 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,135 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,135 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-11-12 19:09:35,135 INFO L425 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-11-12 19:09:35,135 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-12 19:09:35,135 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-12 19:09:35,135 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-12 19:09:35,135 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-11-12 19:09:35,135 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-11-12 19:09:35,136 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-11-12 19:09:35,136 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,136 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,136 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,136 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-11-12 19:09:35,136 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-12 19:09:35,136 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-12 19:09:35,136 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-12 19:09:35,136 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-11-12 19:09:35,136 INFO L425 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-11-12 19:09:35,137 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-11-12 19:09:35,137 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-11-12 19:09:35,137 INFO L425 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-11-12 19:09:35,137 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,137 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,137 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:09:35,137 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-11-12 19:09:35,137 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-12 19:09:35,137 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-12 19:09:35,138 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-12 19:09:35,138 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-11-12 19:09:35,138 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 19:09:35,138 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~inputF~0 6) (= ~inputA~0 1) (= ~inputC~0 3) (= ~a15~0 8) (= (+ ~a12~0 49) 0) (= ~inputB~0 2) (= ~a24~0 1) (= ~inputE~0 5) (= ~a21~0 7) (= ~inputD~0 4)) [2018-11-12 19:09:35,138 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 19:09:35,138 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 19:09:35,138 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 874 890) the Hoare annotation is: (or (not (= |old(~a15~0)| 8)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (and (= (+ ~a12~0 49) 0) (= ~a21~0 7) (= |old(~a15~0)| ~a15~0) (= ~a24~0 1)) (not (= 1 |old(~a24~0)|)) (not (= |old(~a21~0)| 7)) (not (= 0 (+ |old(~a12~0)| 49))) (not (= ~inputF~0 6))) [2018-11-12 19:09:35,139 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 874 890) no Hoare annotation was computed. [2018-11-12 19:09:35,139 INFO L421 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (or (not (= |old(~a15~0)| 8)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (not (= 8 ~a21~0)) (<= ~a12~0 80) (not (= 2 ~inputB~0)) (not (= 1 |old(~a24~0)|)) (not (= |old(~a21~0)| 7)) (not (= 0 (+ |old(~a12~0)| 49))) (not (= ~inputF~0 6)) (not (= ~a15~0 6))) [2018-11-12 19:09:35,139 INFO L425 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2018-11-12 19:09:35,139 INFO L425 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-11-12 19:09:35,139 INFO L425 ceAbstractionStarter]: For program point L880-1(lines 880 889) no Hoare annotation was computed. [2018-11-12 19:09:35,139 INFO L421 ceAbstractionStarter]: At program point L880-3(lines 880 889) the Hoare annotation is: (or (not (= |old(~a15~0)| 8)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (not (= 8 ~a21~0)) (<= ~a12~0 80) (not (= 2 ~inputB~0)) (not (= 1 |old(~a24~0)|)) (not (= |old(~a21~0)| 7)) (not (= 0 (+ |old(~a12~0)| 49))) (not (= ~inputF~0 6)) (not (= ~a15~0 6))) [2018-11-12 19:09:35,140 INFO L425 ceAbstractionStarter]: For program point L880-4(lines 874 890) no Hoare annotation was computed. [2018-11-12 19:09:35,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:09:35 BoogieIcfgContainer [2018-11-12 19:09:35,171 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 19:09:35,172 INFO L168 Benchmark]: Toolchain (without parser) took 219040.60 ms. Allocated memory was 1.5 GB in the beginning and 4.4 GB in the end (delta: 2.9 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-11-12 19:09:35,173 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 19:09:35,173 INFO L168 Benchmark]: CACSL2BoogieTranslator took 804.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-11-12 19:09:35,174 INFO L168 Benchmark]: Boogie Procedure Inliner took 152.85 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 691.5 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -788.9 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2018-11-12 19:09:35,175 INFO L168 Benchmark]: Boogie Preprocessor took 136.95 ms. Allocated memory is still 2.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 19:09:35,175 INFO L168 Benchmark]: RCFGBuilder took 3623.71 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 137.2 MB). Peak memory consumption was 137.2 MB. Max. memory is 7.1 GB. [2018-11-12 19:09:35,178 INFO L168 Benchmark]: TraceAbstraction took 214316.14 ms. Allocated memory was 2.2 GB in the beginning and 4.4 GB in the end (delta: 2.2 GB). Free memory was 2.0 GB in the beginning and 2.9 GB in the end (delta: -865.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-11-12 19:09:35,186 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 804.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 152.85 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 691.5 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -788.9 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 136.95 ms. Allocated memory is still 2.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3623.71 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 137.2 MB). Peak memory consumption was 137.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 214316.14 ms. Allocated memory was 2.2 GB in the beginning and 4.4 GB in the end (delta: 2.2 GB). Free memory was 2.0 GB in the beginning and 2.9 GB in the end (delta: -865.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 148]: 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: 880]: Loop Invariant Derived loop invariant: (((((((((((!(\old(a15) == 8) || !(4 == inputD)) || !(inputE == 5)) || !(inputA == 1)) || !(3 == inputC)) || !(8 == a21)) || a12 <= 80) || !(2 == inputB)) || !(1 == \old(a24))) || !(\old(a21) == 7)) || !(0 == \old(a12) + 49)) || !(inputF == 6)) || !(a15 == 6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. SAFE Result, 214.2s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 179.2s AutomataDifference, 0.0s DeadEndRemovalTime, 4.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 2416 SDtfs, 26387 SDslu, 1908 SDs, 0 SdLazy, 29713 SolverSat, 4390 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 61.9s Time, PredicateUnifierStatistics: 16 DeclaredPredicates, 3189 GetRequests, 2960 SyntacticMatches, 12 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1391 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5551occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.1s AbstIntTime, 8 AbstIntIterations, 8 AbstIntStrong, 0.9974575862208875 AbsIntWeakeningRatio, 0.08298217179902755 AbsIntAvgWeakeningVarsNumRemoved, 13.414910858995137 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 2421 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 130 PreInvPairs, 184 NumberOfFragments, 524 HoareAnnotationTreeSize, 130 FomulaSimplifications, 12092 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 3727 FormulaSimplificationTreeSizeReductionInter, 4.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 3901 NumberOfCodeBlocks, 3901 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 3889 ConstructedInterpolants, 0 QuantifiedInterpolants, 13108573 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 3012/4485 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...