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_label21_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 19:03:58,600 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 19:03:58,603 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 19:03:58,620 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 19:03:58,620 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 19:03:58,622 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 19:03:58,623 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 19:03:58,627 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 19:03:58,629 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 19:03:58,630 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 19:03:58,631 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 19:03:58,631 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 19:03:58,632 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 19:03:58,633 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 19:03:58,634 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 19:03:58,635 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 19:03:58,636 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 19:03:58,638 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 19:03:58,640 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 19:03:58,642 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 19:03:58,643 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 19:03:58,644 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 19:03:58,646 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 19:03:58,646 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 19:03:58,648 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 19:03:58,649 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 19:03:58,651 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 19:03:58,652 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 19:03:58,655 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 19:03:58,656 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 19:03:58,656 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 19:03:58,657 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 19:03:58,657 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 19:03:58,657 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 19:03:58,661 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 19:03:58,661 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 19:03:58,662 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:03:58,695 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 19:03:58,695 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 19:03:58,697 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 19:03:58,697 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 19:03:58,697 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 19:03:58,697 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 19:03:58,698 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 19:03:58,698 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 19:03:58,698 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 19:03:58,698 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 19:03:58,698 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 19:03:58,699 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 19:03:58,699 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 19:03:58,700 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 19:03:58,700 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 19:03:58,700 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 19:03:58,701 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 19:03:58,701 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 19:03:58,701 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 19:03:58,701 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 19:03:58,701 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 19:03:58,703 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 19:03:58,704 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 19:03:58,704 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 19:03:58,704 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 19:03:58,704 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 19:03:58,704 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 19:03:58,705 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 19:03:58,705 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 19:03:58,705 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 19:03:58,705 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 19:03:58,705 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 19:03:58,706 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 19:03:58,706 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 19:03:58,706 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 19:03:58,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 19:03:58,792 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 19:03:58,795 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 19:03:58,796 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 19:03:58,796 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 19:03:58,797 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label21_true-unreach-call_false-termination.c [2018-11-12 19:03:58,865 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c71c7dd23/f6a952f47d764c65bb388a1a42e377e4/FLAG37f38c749 [2018-11-12 19:03:59,461 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 19:03:59,463 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label21_true-unreach-call_false-termination.c [2018-11-12 19:03:59,480 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c71c7dd23/f6a952f47d764c65bb388a1a42e377e4/FLAG37f38c749 [2018-11-12 19:03:59,502 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c71c7dd23/f6a952f47d764c65bb388a1a42e377e4 [2018-11-12 19:03:59,514 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 19:03:59,518 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 19:03:59,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 19:03:59,519 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 19:03:59,523 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 19:03:59,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:03:59" (1/1) ... [2018-11-12 19:03:59,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4111f80c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:03:59, skipping insertion in model container [2018-11-12 19:03:59,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:03:59" (1/1) ... [2018-11-12 19:03:59,537 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 19:03:59,598 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 19:04:00,117 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 19:04:00,123 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 19:04:00,262 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 19:04:00,286 INFO L193 MainTranslator]: Completed translation [2018-11-12 19:04:00,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:04:00 WrapperNode [2018-11-12 19:04:00,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 19:04:00,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 19:04:00,288 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 19:04:00,289 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 19:04:00,298 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:04:00" (1/1) ... [2018-11-12 19:04:00,432 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:04:00" (1/1) ... [2018-11-12 19:04:00,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 19:04:00,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 19:04:00,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 19:04:00,451 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 19:04:00,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:04:00" (1/1) ... [2018-11-12 19:04:00,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:04:00" (1/1) ... [2018-11-12 19:04:00,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:04:00" (1/1) ... [2018-11-12 19:04:00,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:04:00" (1/1) ... [2018-11-12 19:04:00,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:04:00" (1/1) ... [2018-11-12 19:04:00,526 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:04:00" (1/1) ... [2018-11-12 19:04:00,533 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:04:00" (1/1) ... [2018-11-12 19:04:00,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 19:04:00,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 19:04:00,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 19:04:00,547 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 19:04:00,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:04:00" (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:04:00,627 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 19:04:00,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 19:04:00,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 19:04:00,628 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 19:04:00,628 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 19:04:00,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 19:04:00,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 19:04:00,629 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 19:04:00,629 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 19:04:04,254 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 19:04:04,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:04:04 BoogieIcfgContainer [2018-11-12 19:04:04,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 19:04:04,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 19:04:04,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 19:04:04,260 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 19:04:04,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:03:59" (1/3) ... [2018-11-12 19:04:04,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b36233d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:04:04, skipping insertion in model container [2018-11-12 19:04:04,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:04:00" (2/3) ... [2018-11-12 19:04:04,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b36233d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:04:04, skipping insertion in model container [2018-11-12 19:04:04,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:04:04" (3/3) ... [2018-11-12 19:04:04,265 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label21_true-unreach-call_false-termination.c [2018-11-12 19:04:04,274 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 19:04:04,282 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 19:04:04,298 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 19:04:04,338 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 19:04:04,338 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 19:04:04,338 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 19:04:04,339 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 19:04:04,339 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 19:04:04,339 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 19:04:04,339 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 19:04:04,339 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 19:04:04,376 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-11-12 19:04:04,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-12 19:04:04,389 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:04:04,391 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] [2018-11-12 19:04:04,396 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:04:04,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:04:04,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1101027815, now seen corresponding path program 1 times [2018-11-12 19:04:04,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:04:04,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:04,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:04:04,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:04,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:04:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:04:04,864 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 19:04:04,981 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:04:04,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:04:04,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 19:04:04,984 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:04:04,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 19:04:05,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 19:04:05,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 19:04:05,012 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-11-12 19:04:06,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:04:06,642 INFO L93 Difference]: Finished difference Result 691 states and 1226 transitions. [2018-11-12 19:04:06,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 19:04:06,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-12 19:04:06,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:04:06,664 INFO L225 Difference]: With dead ends: 691 [2018-11-12 19:04:06,664 INFO L226 Difference]: Without dead ends: 434 [2018-11-12 19:04:06,673 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:04:06,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-12 19:04:06,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-11-12 19:04:06,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-12 19:04:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 767 transitions. [2018-11-12 19:04:06,762 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 767 transitions. Word has length 41 [2018-11-12 19:04:06,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:04:06,763 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 767 transitions. [2018-11-12 19:04:06,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 19:04:06,763 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 767 transitions. [2018-11-12 19:04:06,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-12 19:04:06,770 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:04:06,770 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:06,771 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:04:06,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:04:06,771 INFO L82 PathProgramCache]: Analyzing trace with hash 212852571, now seen corresponding path program 1 times [2018-11-12 19:04:06,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:04:06,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:06,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:04:06,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:06,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:04:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:04:07,233 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:04:07,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:04:07,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 19:04:07,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:04:07,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 19:04:07,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 19:04:07,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 19:04:07,237 INFO L87 Difference]: Start difference. First operand 434 states and 767 transitions. Second operand 5 states. [2018-11-12 19:04:10,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:04:10,846 INFO L93 Difference]: Finished difference Result 1416 states and 2580 transitions. [2018-11-12 19:04:10,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 19:04:10,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2018-11-12 19:04:10,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:04:10,857 INFO L225 Difference]: With dead ends: 1416 [2018-11-12 19:04:10,857 INFO L226 Difference]: Without dead ends: 988 [2018-11-12 19:04:10,862 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-12 19:04:10,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-11-12 19:04:10,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 973. [2018-11-12 19:04:10,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2018-11-12 19:04:10,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1540 transitions. [2018-11-12 19:04:10,921 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1540 transitions. Word has length 118 [2018-11-12 19:04:10,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:04:10,922 INFO L480 AbstractCegarLoop]: Abstraction has 973 states and 1540 transitions. [2018-11-12 19:04:10,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 19:04:10,922 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1540 transitions. [2018-11-12 19:04:10,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-12 19:04:10,929 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:04:10,929 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:10,930 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:04:10,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:04:10,930 INFO L82 PathProgramCache]: Analyzing trace with hash -2137480229, now seen corresponding path program 1 times [2018-11-12 19:04:10,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:04:10,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:10,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:04:10,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:10,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:04:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:04:11,265 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:04:11,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:04:11,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 19:04:11,265 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:04:11,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 19:04:11,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 19:04:11,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 19:04:11,267 INFO L87 Difference]: Start difference. First operand 973 states and 1540 transitions. Second operand 6 states. [2018-11-12 19:04:14,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:04:14,838 INFO L93 Difference]: Finished difference Result 2347 states and 3916 transitions. [2018-11-12 19:04:14,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 19:04:14,840 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 182 [2018-11-12 19:04:14,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:04:14,860 INFO L225 Difference]: With dead ends: 2347 [2018-11-12 19:04:14,860 INFO L226 Difference]: Without dead ends: 1380 [2018-11-12 19:04:14,864 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 19:04:14,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2018-11-12 19:04:14,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1352. [2018-11-12 19:04:14,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-11-12 19:04:14,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2126 transitions. [2018-11-12 19:04:14,953 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2126 transitions. Word has length 182 [2018-11-12 19:04:14,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:04:14,954 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 2126 transitions. [2018-11-12 19:04:14,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 19:04:14,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2126 transitions. [2018-11-12 19:04:14,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-12 19:04:14,963 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:04:14,963 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, 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] [2018-11-12 19:04:14,963 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:04:14,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:04:14,964 INFO L82 PathProgramCache]: Analyzing trace with hash -448591016, now seen corresponding path program 1 times [2018-11-12 19:04:14,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:04:14,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:14,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:04:14,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:14,965 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:04:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:04:15,360 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 140 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:04:15,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:04:15,360 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:04:15,361 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 193 with the following transitions: [2018-11-12 19:04:15,363 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], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:04:15,416 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:04:15,417 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:04:15,952 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:04:15,970 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:04:15,972 INFO L272 AbstractInterpreter]: Visited 82 different actions 82 times. Never merged. Never widened. Performed 642 root evaluator evaluations with a maximum evaluation depth of 6. Performed 642 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:04:16,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:04:16,014 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:04:16,612 INFO L227 lantSequenceWeakener]: Weakened 183 states. On average, predicates are now at 77.83% of their original sizes. [2018-11-12 19:04:16,613 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:04:16,723 INFO L415 sIntCurrentIteration]: We unified 191 AI predicates to 191 [2018-11-12 19:04:16,723 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:04:16,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:04:16,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-12 19:04:16,725 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:04:16,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 19:04:16,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 19:04:16,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-12 19:04:16,726 INFO L87 Difference]: Start difference. First operand 1352 states and 2126 transitions. Second operand 7 states. [2018-11-12 19:04:32,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:04:32,451 INFO L93 Difference]: Finished difference Result 2883 states and 4473 transitions. [2018-11-12 19:04:32,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 19:04:32,451 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 192 [2018-11-12 19:04:32,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:04:32,459 INFO L225 Difference]: With dead ends: 2883 [2018-11-12 19:04:32,460 INFO L226 Difference]: Without dead ends: 1537 [2018-11-12 19:04:32,465 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 192 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-12 19:04:32,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2018-11-12 19:04:32,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1535. [2018-11-12 19:04:32,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2018-11-12 19:04:32,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2316 transitions. [2018-11-12 19:04:32,509 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2316 transitions. Word has length 192 [2018-11-12 19:04:32,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:04:32,509 INFO L480 AbstractCegarLoop]: Abstraction has 1535 states and 2316 transitions. [2018-11-12 19:04:32,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 19:04:32,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2316 transitions. [2018-11-12 19:04:32,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-11-12 19:04:32,518 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:04:32,518 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:04:32,518 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:04:32,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:04:32,519 INFO L82 PathProgramCache]: Analyzing trace with hash 475311430, now seen corresponding path program 1 times [2018-11-12 19:04:32,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:04:32,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:32,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:04:32,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:32,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:04:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:04:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 254 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-12 19:04:33,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:04:33,257 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:04:33,257 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 278 with the following transitions: [2018-11-12 19:04:33,258 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], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [554], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:04:33,265 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:04:33,265 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:04:33,334 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:04:33,566 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:04:33,567 INFO L272 AbstractInterpreter]: Visited 94 different actions 181 times. Merged at 4 different actions 4 times. Never widened. Performed 1969 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1969 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:04:33,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:04:33,604 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:04:34,277 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 77.8% of their original sizes. [2018-11-12 19:04:34,278 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:04:37,242 INFO L415 sIntCurrentIteration]: We unified 276 AI predicates to 276 [2018-11-12 19:04:37,243 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:04:37,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:04:37,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [7] total 23 [2018-11-12 19:04:37,244 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:04:37,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 19:04:37,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 19:04:37,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-11-12 19:04:37,245 INFO L87 Difference]: Start difference. First operand 1535 states and 2316 transitions. Second operand 18 states. [2018-11-12 19:05:03,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:05:03,247 INFO L93 Difference]: Finished difference Result 4032 states and 5799 transitions. [2018-11-12 19:05:03,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 19:05:03,247 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 277 [2018-11-12 19:05:03,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:05:03,259 INFO L225 Difference]: With dead ends: 4032 [2018-11-12 19:05:03,259 INFO L226 Difference]: Without dead ends: 2686 [2018-11-12 19:05:03,265 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 284 GetRequests, 256 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2018-11-12 19:05:03,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2018-11-12 19:05:03,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2292. [2018-11-12 19:05:03,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2292 states. [2018-11-12 19:05:03,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2292 states to 2292 states and 3121 transitions. [2018-11-12 19:05:03,329 INFO L78 Accepts]: Start accepts. Automaton has 2292 states and 3121 transitions. Word has length 277 [2018-11-12 19:05:03,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:05:03,329 INFO L480 AbstractCegarLoop]: Abstraction has 2292 states and 3121 transitions. [2018-11-12 19:05:03,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 19:05:03,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2292 states and 3121 transitions. [2018-11-12 19:05:03,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-11-12 19:05:03,337 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:05:03,337 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:03,338 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:05:03,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:05:03,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1118573838, now seen corresponding path program 1 times [2018-11-12 19:05:03,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:05:03,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:03,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:05:03,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:03,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:05:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:05:04,549 WARN L179 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-12 19:05:05,260 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 256 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:05:05,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:05:05,260 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:05:05,260 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 304 with the following transitions: [2018-11-12 19:05:05,261 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], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:05:05,265 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:05:05,266 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:05:05,305 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:05:05,432 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:05:05,433 INFO L272 AbstractInterpreter]: Visited 120 different actions 234 times. Merged at 5 different actions 5 times. Never widened. Performed 2134 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2134 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:05:05,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:05:05,450 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:05:05,759 INFO L227 lantSequenceWeakener]: Weakened 189 states. On average, predicates are now at 78.14% of their original sizes. [2018-11-12 19:05:05,760 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:05:06,249 INFO L415 sIntCurrentIteration]: We unified 302 AI predicates to 302 [2018-11-12 19:05:06,249 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:05:06,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:05:06,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [14] total 30 [2018-11-12 19:05:06,250 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:05:06,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 19:05:06,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 19:05:06,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-11-12 19:05:06,252 INFO L87 Difference]: Start difference. First operand 2292 states and 3121 transitions. Second operand 18 states. [2018-11-12 19:05:15,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:05:15,805 INFO L93 Difference]: Finished difference Result 4011 states and 5701 transitions. [2018-11-12 19:05:15,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 19:05:15,805 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 303 [2018-11-12 19:05:15,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:05:15,818 INFO L225 Difference]: With dead ends: 4011 [2018-11-12 19:05:15,819 INFO L226 Difference]: Without dead ends: 2665 [2018-11-12 19:05:15,826 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 322 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=269, Invalid=1137, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 19:05:15,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2665 states. [2018-11-12 19:05:15,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2665 to 2660. [2018-11-12 19:05:15,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2018-11-12 19:05:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 3518 transitions. [2018-11-12 19:05:15,893 INFO L78 Accepts]: Start accepts. Automaton has 2660 states and 3518 transitions. Word has length 303 [2018-11-12 19:05:15,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:05:15,894 INFO L480 AbstractCegarLoop]: Abstraction has 2660 states and 3518 transitions. [2018-11-12 19:05:15,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 19:05:15,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2660 states and 3518 transitions. [2018-11-12 19:05:15,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-11-12 19:05:15,902 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:05:15,903 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:15,903 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:05:15,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:05:15,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1867617726, now seen corresponding path program 1 times [2018-11-12 19:05:15,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:05:15,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:15,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:05:15,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:15,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:05:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:05:16,943 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 19:05:17,142 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-12 19:05:17,651 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 179 proven. 143 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:05:17,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:05:17,651 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:05:17,652 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 314 with the following transitions: [2018-11-12 19:05:17,652 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], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [698], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:05:17,656 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:05:17,657 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:05:17,718 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:05:17,899 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:05:17,899 INFO L272 AbstractInterpreter]: Visited 130 different actions 256 times. Merged at 5 different actions 7 times. Never widened. Performed 4350 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4350 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:05:17,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:05:17,904 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:05:18,316 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 77.8% of their original sizes. [2018-11-12 19:05:18,317 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:05:18,826 INFO L415 sIntCurrentIteration]: We unified 312 AI predicates to 312 [2018-11-12 19:05:18,826 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:05:18,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:05:18,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [13] total 29 [2018-11-12 19:05:18,826 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:05:18,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 19:05:18,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 19:05:18,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-11-12 19:05:18,828 INFO L87 Difference]: Start difference. First operand 2660 states and 3518 transitions. Second operand 18 states. [2018-11-12 19:05:39,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:05:39,442 INFO L93 Difference]: Finished difference Result 4982 states and 6815 transitions. [2018-11-12 19:05:39,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-12 19:05:39,442 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 313 [2018-11-12 19:05:39,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:05:39,456 INFO L225 Difference]: With dead ends: 4982 [2018-11-12 19:05:39,456 INFO L226 Difference]: Without dead ends: 3636 [2018-11-12 19:05:39,462 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 319 GetRequests, 292 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2018-11-12 19:05:39,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3636 states. [2018-11-12 19:05:39,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3636 to 3052. [2018-11-12 19:05:39,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3052 states. [2018-11-12 19:05:39,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3052 states to 3052 states and 3934 transitions. [2018-11-12 19:05:39,536 INFO L78 Accepts]: Start accepts. Automaton has 3052 states and 3934 transitions. Word has length 313 [2018-11-12 19:05:39,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:05:39,536 INFO L480 AbstractCegarLoop]: Abstraction has 3052 states and 3934 transitions. [2018-11-12 19:05:39,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 19:05:39,536 INFO L276 IsEmpty]: Start isEmpty. Operand 3052 states and 3934 transitions. [2018-11-12 19:05:39,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-11-12 19:05:39,546 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:05:39,546 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:39,547 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:05:39,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:05:39,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1810298629, now seen corresponding path program 1 times [2018-11-12 19:05:39,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:05:39,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:39,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:05:39,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:39,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:05:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:05:40,034 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 19:05:40,427 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 19:05:40,823 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 179 proven. 143 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:05:40,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:05:40,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:05:40,823 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 339 with the following transitions: [2018-11-12 19:05:40,824 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], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [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:05:40,831 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:05:40,832 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:05:40,874 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:05:41,239 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:05:41,239 INFO L272 AbstractInterpreter]: Visited 155 different actions 303 times. Merged at 4 different actions 4 times. Never widened. Performed 4208 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4208 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:05:41,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:05:41,280 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:05:41,877 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 77.84% of their original sizes. [2018-11-12 19:05:41,877 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:05:42,482 INFO L415 sIntCurrentIteration]: We unified 337 AI predicates to 337 [2018-11-12 19:05:42,483 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:05:42,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:05:42,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [13] total 28 [2018-11-12 19:05:42,483 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:05:42,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 19:05:42,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 19:05:42,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-11-12 19:05:42,485 INFO L87 Difference]: Start difference. First operand 3052 states and 3934 transitions. Second operand 17 states. [2018-11-12 19:06:00,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:06:00,812 INFO L93 Difference]: Finished difference Result 5371 states and 7230 transitions. [2018-11-12 19:06:00,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 19:06:00,812 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 338 [2018-11-12 19:06:00,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:06:00,824 INFO L225 Difference]: With dead ends: 5371 [2018-11-12 19:06:00,824 INFO L226 Difference]: Without dead ends: 4025 [2018-11-12 19:06:00,829 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 345 GetRequests, 316 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2018-11-12 19:06:00,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4025 states. [2018-11-12 19:06:00,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4025 to 3440. [2018-11-12 19:06:00,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3440 states. [2018-11-12 19:06:00,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3440 states to 3440 states and 4348 transitions. [2018-11-12 19:06:00,914 INFO L78 Accepts]: Start accepts. Automaton has 3440 states and 4348 transitions. Word has length 338 [2018-11-12 19:06:00,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:06:00,915 INFO L480 AbstractCegarLoop]: Abstraction has 3440 states and 4348 transitions. [2018-11-12 19:06:00,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 19:06:00,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3440 states and 4348 transitions. [2018-11-12 19:06:00,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-11-12 19:06:00,926 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:06:00,926 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:06:00,927 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:06:00,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:06:00,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1902382058, now seen corresponding path program 1 times [2018-11-12 19:06:00,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:06:00,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:00,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:06:00,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:00,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:06:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:06:01,692 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 257 proven. 2 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-12 19:06:01,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:06:01,693 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:06:01,693 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 340 with the following transitions: [2018-11-12 19:06:01,694 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], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:06:01,696 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:06:01,697 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:06:01,850 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:06:01,954 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:06:01,954 INFO L272 AbstractInterpreter]: Visited 120 different actions 357 times. Merged at 8 different actions 19 times. Never widened. Performed 3430 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3430 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 19:06:01,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:06:01,965 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:06:02,235 INFO L227 lantSequenceWeakener]: Weakened 336 states. On average, predicates are now at 80.23% of their original sizes. [2018-11-12 19:06:02,235 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:06:02,339 INFO L415 sIntCurrentIteration]: We unified 338 AI predicates to 338 [2018-11-12 19:06:02,339 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:06:02,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:06:02,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2018-11-12 19:06:02,340 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:06:02,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 19:06:02,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 19:06:02,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-12 19:06:02,341 INFO L87 Difference]: Start difference. First operand 3440 states and 4348 transitions. Second operand 10 states. [2018-11-12 19:06:09,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:06:09,435 INFO L93 Difference]: Finished difference Result 5378 states and 7400 transitions. [2018-11-12 19:06:09,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 19:06:09,435 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 339 [2018-11-12 19:06:09,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:06:09,450 INFO L225 Difference]: With dead ends: 5378 [2018-11-12 19:06:09,450 INFO L226 Difference]: Without dead ends: 4032 [2018-11-12 19:06:09,457 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 346 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-12 19:06:09,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4032 states. [2018-11-12 19:06:09,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4032 to 3809. [2018-11-12 19:06:09,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3809 states. [2018-11-12 19:06:09,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3809 states to 3809 states and 4809 transitions. [2018-11-12 19:06:09,541 INFO L78 Accepts]: Start accepts. Automaton has 3809 states and 4809 transitions. Word has length 339 [2018-11-12 19:06:09,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:06:09,542 INFO L480 AbstractCegarLoop]: Abstraction has 3809 states and 4809 transitions. [2018-11-12 19:06:09,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 19:06:09,542 INFO L276 IsEmpty]: Start isEmpty. Operand 3809 states and 4809 transitions. [2018-11-12 19:06:09,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-11-12 19:06:09,557 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:06:09,557 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, 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, 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:06:09,557 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:06:09,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:06:09,558 INFO L82 PathProgramCache]: Analyzing trace with hash -622963045, now seen corresponding path program 1 times [2018-11-12 19:06:09,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:06:09,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:09,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:06:09,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:09,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:06:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:06:10,344 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 189 proven. 211 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:06:10,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:06:10,344 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:06:10,345 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 409 with the following transitions: [2018-11-12 19:06:10,345 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], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [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:06:10,348 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:06:10,348 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:06:10,825 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:06:11,069 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:06:11,069 INFO L272 AbstractInterpreter]: Visited 168 different actions 329 times. Merged at 4 different actions 4 times. Never widened. Performed 4639 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4639 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:11,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:06:11,076 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:06:11,684 INFO L227 lantSequenceWeakener]: Weakened 81 states. On average, predicates are now at 77.44% of their original sizes. [2018-11-12 19:06:11,684 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:06:12,283 INFO L415 sIntCurrentIteration]: We unified 407 AI predicates to 407 [2018-11-12 19:06:12,283 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:06:12,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:06:12,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [12] total 28 [2018-11-12 19:06:12,283 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:06:12,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 19:06:12,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 19:06:12,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-11-12 19:06:12,285 INFO L87 Difference]: Start difference. First operand 3809 states and 4809 transitions. Second operand 18 states. [2018-11-12 19:06:38,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:06:38,161 INFO L93 Difference]: Finished difference Result 6579 states and 8669 transitions. [2018-11-12 19:06:38,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 19:06:38,161 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 408 [2018-11-12 19:06:38,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:06:38,179 INFO L225 Difference]: With dead ends: 6579 [2018-11-12 19:06:38,179 INFO L226 Difference]: Without dead ends: 4864 [2018-11-12 19:06:38,193 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 416 GetRequests, 385 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2018-11-12 19:06:38,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4864 states. [2018-11-12 19:06:38,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4864 to 4278. [2018-11-12 19:06:38,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4278 states. [2018-11-12 19:06:38,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4278 states to 4278 states and 5307 transitions. [2018-11-12 19:06:38,308 INFO L78 Accepts]: Start accepts. Automaton has 4278 states and 5307 transitions. Word has length 408 [2018-11-12 19:06:38,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:06:38,309 INFO L480 AbstractCegarLoop]: Abstraction has 4278 states and 5307 transitions. [2018-11-12 19:06:38,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 19:06:38,309 INFO L276 IsEmpty]: Start isEmpty. Operand 4278 states and 5307 transitions. [2018-11-12 19:06:38,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-11-12 19:06:38,323 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:06:38,324 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, 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, 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:06:38,324 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:06:38,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:06:38,325 INFO L82 PathProgramCache]: Analyzing trace with hash -976073869, now seen corresponding path program 1 times [2018-11-12 19:06:38,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:06:38,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:38,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:06:38,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:38,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:06:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:06:40,142 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 177 proven. 223 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:06:40,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:06:40,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:06:40,143 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 421 with the following transitions: [2018-11-12 19:06:40,143 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], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [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:06:40,146 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:06:40,146 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:06:40,209 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:06:40,478 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:06:40,479 INFO L272 AbstractInterpreter]: Visited 180 different actions 353 times. Merged at 4 different actions 4 times. Never widened. Performed 5051 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5051 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:40,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:06:40,490 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:06:41,099 INFO L227 lantSequenceWeakener]: Weakened 114 states. On average, predicates are now at 77.39% of their original sizes. [2018-11-12 19:06:41,099 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:06:41,731 INFO L415 sIntCurrentIteration]: We unified 419 AI predicates to 419 [2018-11-12 19:06:41,732 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:06:41,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:06:41,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [14] total 33 [2018-11-12 19:06:41,732 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:06:41,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 19:06:41,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 19:06:41,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-11-12 19:06:41,734 INFO L87 Difference]: Start difference. First operand 4278 states and 5307 transitions. Second operand 21 states. [2018-11-12 19:07:03,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:07:03,895 INFO L93 Difference]: Finished difference Result 6966 states and 9068 transitions. [2018-11-12 19:07:03,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 19:07:03,895 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 420 [2018-11-12 19:07:03,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:07:03,909 INFO L225 Difference]: With dead ends: 6966 [2018-11-12 19:07:03,909 INFO L226 Difference]: Without dead ends: 5251 [2018-11-12 19:07:03,916 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 427 GetRequests, 394 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2018-11-12 19:07:03,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5251 states. [2018-11-12 19:07:03,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5251 to 4664. [2018-11-12 19:07:03,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4664 states. [2018-11-12 19:07:04,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 5719 transitions. [2018-11-12 19:07:04,006 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 5719 transitions. Word has length 420 [2018-11-12 19:07:04,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:07:04,007 INFO L480 AbstractCegarLoop]: Abstraction has 4664 states and 5719 transitions. [2018-11-12 19:07:04,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 19:07:04,007 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 5719 transitions. [2018-11-12 19:07:04,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-11-12 19:07:04,020 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:07:04,021 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,021 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:07:04,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:07:04,022 INFO L82 PathProgramCache]: Analyzing trace with hash 886254657, now seen corresponding path program 1 times [2018-11-12 19:07:04,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:07:04,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:07:04,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:07:04,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:07:04,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:07:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:07:04,372 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-12 19:07:04,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:07:04,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 19:07:04,372 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:07:04,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 19:07:04,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 19:07:04,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 19:07:04,374 INFO L87 Difference]: Start difference. First operand 4664 states and 5719 transitions. Second operand 4 states. [2018-11-12 19:07:05,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:07:05,990 INFO L93 Difference]: Finished difference Result 9246 states and 11780 transitions. [2018-11-12 19:07:05,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 19:07:05,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 442 [2018-11-12 19:07:05,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:07:06,003 INFO L225 Difference]: With dead ends: 9246 [2018-11-12 19:07:06,003 INFO L226 Difference]: Without dead ends: 5331 [2018-11-12 19:07:06,014 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 19:07:06,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5331 states. [2018-11-12 19:07:06,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5331 to 5295. [2018-11-12 19:07:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5295 states. [2018-11-12 19:07:06,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5295 states to 5295 states and 6429 transitions. [2018-11-12 19:07:06,107 INFO L78 Accepts]: Start accepts. Automaton has 5295 states and 6429 transitions. Word has length 442 [2018-11-12 19:07:06,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:07:06,108 INFO L480 AbstractCegarLoop]: Abstraction has 5295 states and 6429 transitions. [2018-11-12 19:07:06,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 19:07:06,108 INFO L276 IsEmpty]: Start isEmpty. Operand 5295 states and 6429 transitions. [2018-11-12 19:07:06,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2018-11-12 19:07:06,121 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:07:06,121 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, 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, 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:07:06,121 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:07:06,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:07:06,122 INFO L82 PathProgramCache]: Analyzing trace with hash 185450881, now seen corresponding path program 1 times [2018-11-12 19:07:06,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:07:06,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:07:06,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:07:06,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:07:06,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:07:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:07:06,712 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 229 proven. 166 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-11-12 19:07:06,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:07:06,712 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:07:06,712 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 446 with the following transitions: [2018-11-12 19:07:06,713 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], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [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:07:06,714 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:07:06,714 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:07:06,785 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:07:07,002 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 19:07:07,003 INFO L272 AbstractInterpreter]: Visited 124 different actions 364 times. Merged at 7 different actions 16 times. Never widened. Performed 4390 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4390 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:07:07,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:07:07,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 19:07:07,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:07:07,010 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 19:07:07,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:07:07,021 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 19:07:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:07:07,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 19:07:08,234 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 525 proven. 2 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-11-12 19:07:08,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 19:07:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 229 proven. 166 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-11-12 19:07:08,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 19:07:08,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-12 19:07:08,688 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 19:07:08,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 19:07:08,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 19:07:08,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-12 19:07:08,690 INFO L87 Difference]: Start difference. First operand 5295 states and 6429 transitions. Second operand 9 states. [2018-11-12 19:07:13,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:07:13,410 INFO L93 Difference]: Finished difference Result 13774 states and 17583 transitions. [2018-11-12 19:07:13,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 19:07:13,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 445 [2018-11-12 19:07:13,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:07:13,432 INFO L225 Difference]: With dead ends: 13774 [2018-11-12 19:07:13,433 INFO L226 Difference]: Without dead ends: 6852 [2018-11-12 19:07:13,452 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 920 GetRequests, 897 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2018-11-12 19:07:13,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6852 states. [2018-11-12 19:07:13,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6852 to 5648. [2018-11-12 19:07:13,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5648 states. [2018-11-12 19:07:13,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5648 states to 5648 states and 7209 transitions. [2018-11-12 19:07:13,571 INFO L78 Accepts]: Start accepts. Automaton has 5648 states and 7209 transitions. Word has length 445 [2018-11-12 19:07:13,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:07:13,572 INFO L480 AbstractCegarLoop]: Abstraction has 5648 states and 7209 transitions. [2018-11-12 19:07:13,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 19:07:13,572 INFO L276 IsEmpty]: Start isEmpty. Operand 5648 states and 7209 transitions. [2018-11-12 19:07:13,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2018-11-12 19:07:13,587 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:07:13,587 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, 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, 4, 4, 4, 4, 4, 4, 4, 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:07:13,587 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:07:13,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:07:13,588 INFO L82 PathProgramCache]: Analyzing trace with hash 916834010, now seen corresponding path program 1 times [2018-11-12 19:07:13,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:07:13,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:07:13,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:07:13,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:07:13,589 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:07:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:07:14,720 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 247 proven. 449 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:07:14,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:07:14,721 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:07:14,721 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 449 with the following transitions: [2018-11-12 19:07:14,721 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], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [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:07:14,723 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:07:14,724 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:07:14,791 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:07:15,002 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 19:07:15,002 INFO L272 AbstractInterpreter]: Visited 124 different actions 365 times. Merged at 7 different actions 17 times. Never widened. Performed 4205 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4205 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-12 19:07:15,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:07:15,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 19:07:15,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:07:15,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 19:07:15,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:07:15,017 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 19:07:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:07:15,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 19:07:15,313 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2018-11-12 19:07:15,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 19:07:15,658 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2018-11-12 19:07:15,679 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:07:15,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [15] total 17 [2018-11-12 19:07:15,679 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:07:15,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 19:07:15,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 19:07:15,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-11-12 19:07:15,681 INFO L87 Difference]: Start difference. First operand 5648 states and 7209 transitions. Second operand 3 states. [2018-11-12 19:07:16,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:07:16,649 INFO L93 Difference]: Finished difference Result 12600 states and 16755 transitions. [2018-11-12 19:07:16,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 19:07:16,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 448 [2018-11-12 19:07:16,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:07:16,650 INFO L225 Difference]: With dead ends: 12600 [2018-11-12 19:07:16,650 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 19:07:16,688 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 911 GetRequests, 895 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-11-12 19:07:16,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 19:07:16,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 19:07:16,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 19:07:16,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 19:07:16,689 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 448 [2018-11-12 19:07:16,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:07:16,689 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 19:07:16,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 19:07:16,690 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 19:07:16,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 19:07:16,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 19:07:16,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:07:16,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:07:16,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:07:16,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:07:16,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:07:16,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:07:17,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:07:17,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:07:17,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:07:17,036 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 120 [2018-11-12 19:07:17,605 WARN L179 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2018-11-12 19:07:18,115 WARN L179 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2018-11-12 19:07:19,160 WARN L179 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 221 DAG size of output: 88 [2018-11-12 19:07:19,599 WARN L179 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 62 [2018-11-12 19:07:19,836 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 62 [2018-11-12 19:07:19,839 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 19:07:19,840 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a12~0 |old(~a12~0)|) (= ~a21~0 |old(~a21~0)|) (= |old(~a15~0)| ~a15~0)) [2018-11-12 19:07:19,840 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 19:07:19,840 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-11-12 19:07:19,840 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-11-12 19:07:19,840 INFO L425 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,840 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,841 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,841 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-11-12 19:07:19,841 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-12 19:07:19,841 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-12 19:07:19,841 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-12 19:07:19,841 INFO L425 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-11-12 19:07:19,841 INFO L425 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-11-12 19:07:19,841 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-11-12 19:07:19,841 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-11-12 19:07:19,842 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,842 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,842 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,842 INFO L425 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-11-12 19:07:19,842 INFO L425 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-11-12 19:07:19,842 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-12 19:07:19,842 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-12 19:07:19,842 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-12 19:07:19,842 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-11-12 19:07:19,842 INFO L425 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-11-12 19:07:19,843 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-11-12 19:07:19,843 INFO L425 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,843 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,843 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,843 INFO L425 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-11-12 19:07:19,843 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-12 19:07:19,843 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-12 19:07:19,843 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-12 19:07:19,843 INFO L425 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-11-12 19:07:19,844 INFO L425 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-11-12 19:07:19,844 INFO L425 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-11-12 19:07:19,844 INFO L425 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-11-12 19:07:19,844 INFO L425 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-11-12 19:07:19,844 INFO L425 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,844 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,844 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,844 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-11-12 19:07:19,844 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-12 19:07:19,845 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-12 19:07:19,845 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-12 19:07:19,845 INFO L425 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-11-12 19:07:19,845 INFO L425 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-11-12 19:07:19,845 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-11-12 19:07:19,845 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,845 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,845 INFO L425 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,846 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-11-12 19:07:19,846 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-12 19:07:19,846 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-12 19:07:19,846 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-12 19:07:19,846 INFO L425 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-11-12 19:07:19,846 INFO L425 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-11-12 19:07:19,846 INFO L425 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-11-12 19:07:19,846 INFO L425 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-11-12 19:07:19,846 INFO L425 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-11-12 19:07:19,847 INFO L425 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,847 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,847 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,847 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,847 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-11-12 19:07:19,847 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-12 19:07:19,847 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-12 19:07:19,847 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-12 19:07:19,847 INFO L425 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-11-12 19:07:19,848 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-11-12 19:07:19,848 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-11-12 19:07:19,848 INFO L425 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-11-12 19:07:19,848 INFO L425 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,848 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,848 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,848 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-12 19:07:19,848 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-12 19:07:19,848 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-12 19:07:19,849 INFO L425 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-11-12 19:07:19,849 INFO L425 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-11-12 19:07:19,849 INFO L425 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-11-12 19:07:19,849 INFO L425 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-11-12 19:07:19,849 INFO L425 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-11-12 19:07:19,849 INFO L425 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,849 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,849 INFO L425 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,850 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 106) no Hoare annotation was computed. [2018-11-12 19:07:19,850 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-11-12 19:07:19,850 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-11-12 19:07:19,850 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-12 19:07:19,850 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-12 19:07:19,850 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-12 19:07:19,850 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-11-12 19:07:19,851 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 872) the Hoare annotation is: (let ((.cse3 (< |calculate_output_#in~input| 1)) (.cse1 (< 6 |calculate_output_#in~input|)) (.cse0 (= ~a24~0 1)) (.cse4 (< |old(~a21~0)| 6)) (.cse2 (not (= 1 |old(~a24~0)|))) (.cse8 (not (= 0 (+ |old(~a12~0)| 49)))) (.cse9 (< 8 |old(~a15~0)|)) (.cse6 (< 7 |old(~a21~0)|)) (.cse10 (<= |old(~a12~0)| 11)) (.cse5 (= 7 |old(~a21~0)|)) (.cse11 (and (= ~a12~0 |old(~a12~0)|) (= ~a21~0 |old(~a21~0)|) (= |old(~a15~0)| ~a15~0))) (.cse7 (= 6 |old(~a15~0)|)) (.cse12 (= 9 |old(~a15~0)|))) (and (or .cse0 (or .cse1 (< 10 |old(~a21~0)|) .cse2 (not (= 8 |old(~a15~0)|)) (< |old(~a21~0)| 7) .cse3)) (or .cse4 .cse5 (not (= 4 ~inputD~0)) .cse6 .cse3 .cse1 (< |old(~a15~0)| 5) (not (= ~inputE~0 5)) .cse7 (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) .cse0 (not (= 2 ~inputB~0)) .cse2 .cse8 .cse9 (not (= ~inputF~0 6))) (or .cse0 (or .cse4 .cse2 .cse8 .cse9 .cse6 (< |old(~a15~0)| 6)) .cse5 .cse7) (or .cse5 .cse10 .cse11) (or .cse5 (= 8 |old(~a21~0)|) .cse11) (or (not .cse12) .cse11 .cse10) (or .cse5 .cse11 .cse7) (or .cse11 .cse7 .cse12))) [2018-11-12 19:07:19,851 INFO L425 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-11-12 19:07:19,851 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-11-12 19:07:19,851 INFO L425 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,851 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,852 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,852 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-12 19:07:19,852 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-12 19:07:19,852 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-12 19:07:19,852 INFO L425 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-11-12 19:07:19,852 INFO L425 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-11-12 19:07:19,852 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-11-12 19:07:19,852 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-11-12 19:07:19,852 INFO L425 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-11-12 19:07:19,853 INFO L425 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,853 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,853 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,853 INFO L425 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-11-12 19:07:19,853 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-11-12 19:07:19,853 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-12 19:07:19,853 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-12 19:07:19,853 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-12 19:07:19,853 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-11-12 19:07:19,853 INFO L425 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-11-12 19:07:19,854 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-11-12 19:07:19,854 INFO L425 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,854 INFO L425 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,854 INFO L425 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,854 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-11-12 19:07:19,854 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-12 19:07:19,854 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-12 19:07:19,854 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-12 19:07:19,854 INFO L425 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-11-12 19:07:19,854 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-11-12 19:07:19,855 INFO L425 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-11-12 19:07:19,855 INFO L425 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-11-12 19:07:19,855 INFO L425 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,855 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,855 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,855 INFO L425 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-11-12 19:07:19,855 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-12 19:07:19,855 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-12 19:07:19,855 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-12 19:07:19,855 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-11-12 19:07:19,855 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-11-12 19:07:19,855 INFO L425 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-11-12 19:07:19,855 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-11-12 19:07:19,855 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,855 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,856 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-11-12 19:07:19,856 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-12 19:07:19,856 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-12 19:07:19,856 INFO L425 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-11-12 19:07:19,856 INFO L425 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-11-12 19:07:19,856 INFO L425 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-11-12 19:07:19,856 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-11-12 19:07:19,856 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-11-12 19:07:19,856 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,856 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,856 INFO L425 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-11-12 19:07:19,856 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-12 19:07:19,856 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-12 19:07:19,857 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-11-12 19:07:19,857 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-11-12 19:07:19,857 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-11-12 19:07:19,857 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,857 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,857 INFO L425 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-11-12 19:07:19,857 INFO L425 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-11-12 19:07:19,857 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-12 19:07:19,857 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-12 19:07:19,857 INFO L425 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-11-12 19:07:19,857 INFO L425 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-11-12 19:07:19,857 INFO L425 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-11-12 19:07:19,857 INFO L425 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-11-12 19:07:19,857 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,858 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,858 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-11-12 19:07:19,858 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-11-12 19:07:19,858 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-12 19:07:19,858 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-12 19:07:19,858 INFO L425 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-11-12 19:07:19,858 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-11-12 19:07:19,858 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-11-12 19:07:19,858 INFO L425 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,859 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,859 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,859 INFO L425 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-11-12 19:07:19,859 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-11-12 19:07:19,859 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-12 19:07:19,859 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-12 19:07:19,859 INFO L425 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-11-12 19:07:19,859 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-11-12 19:07:19,859 INFO L425 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,859 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,860 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-12 19:07:19,860 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,860 INFO L425 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-11-12 19:07:19,860 INFO L425 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-11-12 19:07:19,860 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-11-12 19:07:19,860 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-12 19:07:19,860 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-12 19:07:19,860 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-12 19:07:19,860 INFO L425 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-11-12 19:07:19,860 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-11-12 19:07:19,860 INFO L425 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-11-12 19:07:19,861 INFO L425 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-11-12 19:07:19,861 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,861 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,861 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,861 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-11-12 19:07:19,861 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-12 19:07:19,861 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-12 19:07:19,861 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-12 19:07:19,861 INFO L425 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-11-12 19:07:19,861 INFO L425 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-11-12 19:07:19,862 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-11-12 19:07:19,862 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-11-12 19:07:19,862 INFO L425 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,862 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,862 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,862 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-11-12 19:07:19,862 INFO L425 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-11-12 19:07:19,862 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-12 19:07:19,862 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-12 19:07:19,862 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-12 19:07:19,862 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-11-12 19:07:19,863 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-11-12 19:07:19,863 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-11-12 19:07:19,863 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,863 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,863 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,863 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-11-12 19:07:19,863 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-12 19:07:19,863 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-12 19:07:19,863 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-12 19:07:19,863 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-11-12 19:07:19,863 INFO L425 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-11-12 19:07:19,864 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-11-12 19:07:19,864 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-11-12 19:07:19,864 INFO L425 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-11-12 19:07:19,864 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,864 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,864 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:19,864 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-11-12 19:07:19,864 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-12 19:07:19,864 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-12 19:07:19,864 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-12 19:07:19,865 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-11-12 19:07:19,865 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 19:07:19,865 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:07:19,865 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 19:07:19,865 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 19:07:19,865 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 874 890) the Hoare annotation is: (or (not (= |old(~a15~0)| 8)) (and (= (+ ~a12~0 49) 0) (= ~a21~0 7) (= |old(~a15~0)| ~a15~0) (= ~a24~0 1)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (not (= 1 |old(~a24~0)|)) (not (= |old(~a21~0)| 7)) (not (= 0 (+ |old(~a12~0)| 49))) (not (= ~inputF~0 6))) [2018-11-12 19:07:19,866 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 874 890) no Hoare annotation was computed. [2018-11-12 19:07:19,866 INFO L421 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse1 (not (= ~a21~0 7))) (.cse2 (< 11 ~a12~0)) (.cse0 (not (= 6 ~a15~0)))) (or (and .cse0 .cse1) (not (= |old(~a15~0)| 8)) (and .cse2 .cse1) (and (not (= ~a21~0 8)) .cse1) (and .cse2 (= 9 ~a15~0)) (not (= 4 ~inputD~0)) (and (not (= ~a15~0 9)) .cse0) (not (= ~inputE~0 5)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (not (= 1 |old(~a24~0)|)) (not (= |old(~a21~0)| 7)) (not (= 0 (+ |old(~a12~0)| 49))) (not (= ~inputF~0 6)))) [2018-11-12 19:07:19,866 INFO L425 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2018-11-12 19:07:19,866 INFO L425 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-11-12 19:07:19,866 INFO L425 ceAbstractionStarter]: For program point L880-1(lines 880 889) no Hoare annotation was computed. [2018-11-12 19:07:19,866 INFO L421 ceAbstractionStarter]: At program point L880-3(lines 880 889) the Hoare annotation is: (let ((.cse1 (not (= ~a21~0 7))) (.cse2 (< 11 ~a12~0)) (.cse0 (not (= 6 ~a15~0)))) (or (and .cse0 .cse1) (not (= |old(~a15~0)| 8)) (and .cse2 .cse1) (and (not (= ~a21~0 8)) .cse1) (and .cse2 (= 9 ~a15~0)) (not (= 4 ~inputD~0)) (and (not (= ~a15~0 9)) .cse0) (not (= ~inputE~0 5)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (not (= 1 |old(~a24~0)|)) (not (= |old(~a21~0)| 7)) (not (= 0 (+ |old(~a12~0)| 49))) (not (= ~inputF~0 6)))) [2018-11-12 19:07:19,866 INFO L425 ceAbstractionStarter]: For program point L880-4(lines 874 890) no Hoare annotation was computed. [2018-11-12 19:07:19,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:07:19 BoogieIcfgContainer [2018-11-12 19:07:19,879 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 19:07:19,880 INFO L168 Benchmark]: Toolchain (without parser) took 200363.72 ms. Allocated memory was 1.5 GB in the beginning and 4.6 GB in the end (delta: 3.0 GB). Free memory was 1.4 GB in the beginning and 3.5 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-11-12 19:07:19,881 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 19:07:19,882 INFO L168 Benchmark]: CACSL2BoogieTranslator took 768.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-11-12 19:07:19,882 INFO L168 Benchmark]: Boogie Procedure Inliner took 162.00 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -840.2 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. [2018-11-12 19:07:19,883 INFO L168 Benchmark]: Boogie Preprocessor took 96.01 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 19:07:19,884 INFO L168 Benchmark]: RCFGBuilder took 3708.65 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 143.6 MB). Peak memory consumption was 143.6 MB. Max. memory is 7.1 GB. [2018-11-12 19:07:19,885 INFO L168 Benchmark]: TraceAbstraction took 195622.94 ms. Allocated memory was 2.3 GB in the beginning and 4.6 GB in the end (delta: 2.3 GB). Free memory was 2.1 GB in the beginning and 3.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 905.3 MB. Max. memory is 7.1 GB. [2018-11-12 19:07:19,890 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 768.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 162.00 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -840.2 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 96.01 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3708.65 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 143.6 MB). Peak memory consumption was 143.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 195622.94 ms. Allocated memory was 2.3 GB in the beginning and 4.6 GB in the end (delta: 2.3 GB). Free memory was 2.1 GB in the beginning and 3.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 905.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 106]: 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: ((((((((((((((!(6 == a15) && !(a21 == 7)) || !(\old(a15) == 8)) || (11 < a12 && !(a21 == 7))) || (!(a21 == 8) && !(a21 == 7))) || (11 < a12 && 9 == a15)) || !(4 == inputD)) || (!(a15 == 9) && !(6 == a15))) || !(inputE == 5)) || !(inputA == 1)) || !(3 == inputC)) || !(2 == inputB)) || !(1 == \old(a24))) || !(\old(a21) == 7)) || !(0 == \old(a12) + 49)) || !(inputF == 6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. SAFE Result, 195.5s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 161.8s AutomataDifference, 0.0s DeadEndRemovalTime, 3.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 2826 SDtfs, 25446 SDslu, 1989 SDs, 0 SdLazy, 30045 SolverSat, 3445 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 58.5s Time, PredicateUnifierStatistics: 16 DeclaredPredicates, 4511 GetRequests, 4247 SyntacticMatches, 32 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1231 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5648occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.8s AbstIntTime, 10 AbstIntIterations, 8 AbstIntStrong, 0.9970462395399081 AbsIntWeakeningRatio, 0.09682416731216112 AbsIntAvgWeakeningVarsNumRemoved, 11.701394268009295 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 4249 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 134 PreInvPairs, 198 NumberOfFragments, 495 HoareAnnotationTreeSize, 134 FomulaSimplifications, 6633 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 4028 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 5159 NumberOfCodeBlocks, 5159 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 6034 ConstructedInterpolants, 0 QuantifiedInterpolants, 11037020 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1406 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 5726/7306 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...